./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix044.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89b32aa4-2134-4c86-87a7-b131cb45d51d/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89b32aa4-2134-4c86-87a7-b131cb45d51d/bin/utaipan-verify-NcY6lQBIFX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89b32aa4-2134-4c86-87a7-b131cb45d51d/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89b32aa4-2134-4c86-87a7-b131cb45d51d/bin/utaipan-verify-NcY6lQBIFX/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix044.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89b32aa4-2134-4c86-87a7-b131cb45d51d/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89b32aa4-2134-4c86-87a7-b131cb45d51d/bin/utaipan-verify-NcY6lQBIFX --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 bb408c890b0d52a937687fd58d564d57121120b7f4647156375768e776a678b4 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 01:01:09,495 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 01:01:09,589 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89b32aa4-2134-4c86-87a7-b131cb45d51d/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-12 01:01:09,596 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 01:01:09,596 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 01:01:09,630 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 01:01:09,631 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 01:01:09,632 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 01:01:09,633 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 01:01:09,634 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 01:01:09,635 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 01:01:09,635 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 01:01:09,636 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 01:01:09,637 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 01:01:09,638 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 01:01:09,639 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 01:01:09,639 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 01:01:09,640 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 01:01:09,641 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 01:01:09,642 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 01:01:09,642 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 01:01:09,643 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 01:01:09,644 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 01:01:09,645 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 01:01:09,646 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 01:01:09,646 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 01:01:09,647 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 01:01:09,648 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 01:01:09,648 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 01:01:09,649 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 01:01:09,650 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 01:01:09,650 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-12 01:01:09,651 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 01:01:09,651 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 01:01:09,652 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 01:01:09,653 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 01:01:09,653 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 01:01:09,654 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 01:01:09,655 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 01:01:09,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 01:01:09,656 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 01:01:09,657 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 01:01:09,657 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 01:01:09,657 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 01:01:09,658 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 01:01:09,658 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 01:01:09,658 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89b32aa4-2134-4c86-87a7-b131cb45d51d/bin/utaipan-verify-NcY6lQBIFX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89b32aa4-2134-4c86-87a7-b131cb45d51d/bin/utaipan-verify-NcY6lQBIFX 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 -> bb408c890b0d52a937687fd58d564d57121120b7f4647156375768e776a678b4 [2023-11-12 01:01:09,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 01:01:10,031 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 01:01:10,034 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 01:01:10,036 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 01:01:10,038 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 01:01:10,040 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89b32aa4-2134-4c86-87a7-b131cb45d51d/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/pthread-wmm/mix044.opt.i [2023-11-12 01:01:13,819 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 01:01:14,309 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 01:01:14,311 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89b32aa4-2134-4c86-87a7-b131cb45d51d/sv-benchmarks/c/pthread-wmm/mix044.opt.i [2023-11-12 01:01:14,344 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89b32aa4-2134-4c86-87a7-b131cb45d51d/bin/utaipan-verify-NcY6lQBIFX/data/794c01cb4/8d9869e041d3463ab4261a5b1803feb2/FLAG65ea5a93a [2023-11-12 01:01:14,375 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89b32aa4-2134-4c86-87a7-b131cb45d51d/bin/utaipan-verify-NcY6lQBIFX/data/794c01cb4/8d9869e041d3463ab4261a5b1803feb2 [2023-11-12 01:01:14,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 01:01:14,388 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 01:01:14,392 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 01:01:14,393 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 01:01:14,399 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 01:01:14,400 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:01:14" (1/1) ... [2023-11-12 01:01:14,402 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aaf3acd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:01:14, skipping insertion in model container [2023-11-12 01:01:14,402 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:01:14" (1/1) ... [2023-11-12 01:01:14,498 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 01:01:14,947 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 01:01:14,962 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 01:01:15,107 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 01:01:15,169 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 01:01:15,170 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 01:01:15,179 INFO L206 MainTranslator]: Completed translation [2023-11-12 01:01:15,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:01:15 WrapperNode [2023-11-12 01:01:15,181 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 01:01:15,182 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 01:01:15,182 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 01:01:15,183 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 01:01:15,192 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:01:15" (1/1) ... [2023-11-12 01:01:15,235 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:01:15" (1/1) ... [2023-11-12 01:01:15,307 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 173 [2023-11-12 01:01:15,308 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 01:01:15,308 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 01:01:15,309 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 01:01:15,309 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 01:01:15,321 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:01:15" (1/1) ... [2023-11-12 01:01:15,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:01:15" (1/1) ... [2023-11-12 01:01:15,341 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:01:15" (1/1) ... [2023-11-12 01:01:15,343 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:01:15" (1/1) ... [2023-11-12 01:01:15,356 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:01:15" (1/1) ... [2023-11-12 01:01:15,359 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:01:15" (1/1) ... [2023-11-12 01:01:15,362 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:01:15" (1/1) ... [2023-11-12 01:01:15,365 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:01:15" (1/1) ... [2023-11-12 01:01:15,370 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 01:01:15,372 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 01:01:15,372 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 01:01:15,372 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 01:01:15,373 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:01:15" (1/1) ... [2023-11-12 01:01:15,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 01:01:15,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89b32aa4-2134-4c86-87a7-b131cb45d51d/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 01:01:15,414 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89b32aa4-2134-4c86-87a7-b131cb45d51d/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 01:01:15,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89b32aa4-2134-4c86-87a7-b131cb45d51d/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 01:01:15,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 01:01:15,472 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-12 01:01:15,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 01:01:15,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 01:01:15,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 01:01:15,473 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-12 01:01:15,476 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-12 01:01:15,476 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-12 01:01:15,477 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-12 01:01:15,477 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-12 01:01:15,478 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-12 01:01:15,478 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-12 01:01:15,478 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-12 01:01:15,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 01:01:15,479 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-12 01:01:15,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 01:01:15,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 01:01:15,483 WARN L210 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-12 01:01:15,672 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 01:01:15,675 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 01:01:16,218 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 01:01:16,510 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 01:01:16,511 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-12 01:01:16,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:01:16 BoogieIcfgContainer [2023-11-12 01:01:16,516 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 01:01:16,521 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 01:01:16,521 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 01:01:16,526 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 01:01:16,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:01:14" (1/3) ... [2023-11-12 01:01:16,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a7f4605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:01:16, skipping insertion in model container [2023-11-12 01:01:16,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:01:15" (2/3) ... [2023-11-12 01:01:16,531 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a7f4605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:01:16, skipping insertion in model container [2023-11-12 01:01:16,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:01:16" (3/3) ... [2023-11-12 01:01:16,534 INFO L112 eAbstractionObserver]: Analyzing ICFG mix044.opt.i [2023-11-12 01:01:16,567 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 01:01:16,567 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-12 01:01:16,567 INFO L521 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-12 01:01:16,672 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-12 01:01:16,744 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-12 01:01:16,763 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 150 transitions, 316 flow [2023-11-12 01:01:16,767 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 160 places, 150 transitions, 316 flow [2023-11-12 01:01:16,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 150 transitions, 316 flow [2023-11-12 01:01:16,890 INFO L124 PetriNetUnfolderBase]: 3/146 cut-off events. [2023-11-12 01:01:16,890 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 01:01:16,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 3/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 121 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2023-11-12 01:01:16,906 INFO L119 LiptonReduction]: Number of co-enabled transitions 3780 [2023-11-12 01:01:24,952 INFO L134 LiptonReduction]: Checked pairs total: 8773 [2023-11-12 01:01:24,953 INFO L136 LiptonReduction]: Total number of compositions: 150 [2023-11-12 01:01:24,962 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 55 places, 43 transitions, 102 flow [2023-11-12 01:01:25,288 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3924 states, 3911 states have (on average 4.0460240347737155) internal successors, (15824), 3923 states have internal predecessors, (15824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:01:25,320 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 01:01:25,330 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@752b42c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 01:01:25,330 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-12 01:01:25,352 INFO L276 IsEmpty]: Start isEmpty. Operand has 3924 states, 3911 states have (on average 4.0460240347737155) internal successors, (15824), 3923 states have internal predecessors, (15824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:01:25,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2023-11-12 01:01:25,358 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:01:25,358 INFO L195 NwaCegarLoop]: trace histogram [1] [2023-11-12 01:01:25,359 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 01:01:25,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:01:25,369 INFO L85 PathProgramCache]: Analyzing trace with hash 639, now seen corresponding path program 1 times [2023-11-12 01:01:25,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:01:25,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946846597] [2023-11-12 01:01:25,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:01:25,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:01:25,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:01:25,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 01:01:25,568 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:01:25,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946846597] [2023-11-12 01:01:25,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946846597] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:01:25,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:01:25,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-12 01:01:25,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658239143] [2023-11-12 01:01:25,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:01:25,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 01:01:25,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:01:25,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 01:01:25,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 01:01:25,659 INFO L87 Difference]: Start difference. First operand has 3924 states, 3911 states have (on average 4.0460240347737155) internal successors, (15824), 3923 states have internal predecessors, (15824), 0 states have call successors, (0), 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 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:01:25,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:01:25,837 INFO L93 Difference]: Finished difference Result 3722 states and 14640 transitions. [2023-11-12 01:01:25,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 01:01:25,840 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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 1 [2023-11-12 01:01:25,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:01:25,905 INFO L225 Difference]: With dead ends: 3722 [2023-11-12 01:01:25,905 INFO L226 Difference]: Without dead ends: 3722 [2023-11-12 01:01:25,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 01:01:25,912 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 01:01:25,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 01:01:25,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2023-11-12 01:01:26,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3722. [2023-11-12 01:01:26,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3722 states, 3717 states have (on average 3.9386602098466503) internal successors, (14640), 3721 states have internal predecessors, (14640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:01:26,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3722 states to 3722 states and 14640 transitions. [2023-11-12 01:01:26,346 INFO L78 Accepts]: Start accepts. Automaton has 3722 states and 14640 transitions. Word has length 1 [2023-11-12 01:01:26,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:01:26,347 INFO L495 AbstractCegarLoop]: Abstraction has 3722 states and 14640 transitions. [2023-11-12 01:01:26,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:01:26,348 INFO L276 IsEmpty]: Start isEmpty. Operand 3722 states and 14640 transitions. [2023-11-12 01:01:26,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-12 01:01:26,350 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:01:26,350 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 01:01:26,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 01:01:26,351 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 01:01:26,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:01:26,352 INFO L85 PathProgramCache]: Analyzing trace with hash 511274519, now seen corresponding path program 1 times [2023-11-12 01:01:26,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:01:26,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085990196] [2023-11-12 01:01:26,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:01:26,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:01:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:01:26,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 01:01:26,892 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:01:26,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085990196] [2023-11-12 01:01:26,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085990196] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:01:26,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:01:26,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 01:01:26,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876548282] [2023-11-12 01:01:26,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:01:26,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 01:01:26,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:01:26,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 01:01:26,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 01:01:26,897 INFO L87 Difference]: Start difference. First operand 3722 states and 14640 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:01:27,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:01:27,046 INFO L93 Difference]: Finished difference Result 3162 states and 12312 transitions. [2023-11-12 01:01:27,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 01:01:27,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2023-11-12 01:01:27,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:01:27,137 INFO L225 Difference]: With dead ends: 3162 [2023-11-12 01:01:27,142 INFO L226 Difference]: Without dead ends: 3082 [2023-11-12 01:01:27,143 INFO L412 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 [2023-11-12 01:01:27,144 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 13 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 01:01:27,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 10 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 01:01:27,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3082 states. [2023-11-12 01:01:27,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3082 to 3082. [2023-11-12 01:01:27,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3082 states, 3080 states have (on average 3.911688311688312) internal successors, (12048), 3081 states have internal predecessors, (12048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:01:27,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3082 states to 3082 states and 12048 transitions. [2023-11-12 01:01:27,350 INFO L78 Accepts]: Start accepts. Automaton has 3082 states and 12048 transitions. Word has length 9 [2023-11-12 01:01:27,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:01:27,352 INFO L495 AbstractCegarLoop]: Abstraction has 3082 states and 12048 transitions. [2023-11-12 01:01:27,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:01:27,352 INFO L276 IsEmpty]: Start isEmpty. Operand 3082 states and 12048 transitions. [2023-11-12 01:01:27,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-12 01:01:27,357 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:01:27,357 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 01:01:27,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 01:01:27,358 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 01:01:27,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:01:27,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1428420641, now seen corresponding path program 1 times [2023-11-12 01:01:27,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:01:27,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576217044] [2023-11-12 01:01:27,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:01:27,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:01:27,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:01:28,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 01:01:28,273 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:01:28,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576217044] [2023-11-12 01:01:28,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576217044] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:01:28,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:01:28,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 01:01:28,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637986484] [2023-11-12 01:01:28,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:01:28,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 01:01:28,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:01:28,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 01:01:28,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-12 01:01:28,276 INFO L87 Difference]: Start difference. First operand 3082 states and 12048 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:01:28,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:01:28,564 INFO L93 Difference]: Finished difference Result 2602 states and 10064 transitions. [2023-11-12 01:01:28,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 01:01:28,564 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2023-11-12 01:01:28,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:01:28,604 INFO L225 Difference]: With dead ends: 2602 [2023-11-12 01:01:28,604 INFO L226 Difference]: Without dead ends: 2602 [2023-11-12 01:01:28,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-12 01:01:28,606 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 50 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 01:01:28,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 51 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 01:01:28,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2023-11-12 01:01:28,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2602. [2023-11-12 01:01:28,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2602 states, 2601 states have (on average 3.869281045751634) internal successors, (10064), 2601 states have internal predecessors, (10064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:01:28,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 10064 transitions. [2023-11-12 01:01:28,739 INFO L78 Accepts]: Start accepts. Automaton has 2602 states and 10064 transitions. Word has length 12 [2023-11-12 01:01:28,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:01:28,739 INFO L495 AbstractCegarLoop]: Abstraction has 2602 states and 10064 transitions. [2023-11-12 01:01:28,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:01:28,739 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 10064 transitions. [2023-11-12 01:01:28,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-12 01:01:28,742 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:01:28,742 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 01:01:28,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 01:01:28,743 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 01:01:28,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:01:28,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1428420595, now seen corresponding path program 1 times [2023-11-12 01:01:28,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:01:28,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389081955] [2023-11-12 01:01:28,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:01:28,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:01:28,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:01:28,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 01:01:28,951 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:01:28,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389081955] [2023-11-12 01:01:28,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389081955] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:01:28,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:01:28,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 01:01:28,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832504889] [2023-11-12 01:01:28,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:01:28,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 01:01:28,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:01:28,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 01:01:28,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 01:01:28,954 INFO L87 Difference]: Start difference. First operand 2602 states and 10064 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:01:29,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:01:29,109 INFO L93 Difference]: Finished difference Result 2762 states and 10352 transitions. [2023-11-12 01:01:29,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 01:01:29,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2023-11-12 01:01:29,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:01:29,140 INFO L225 Difference]: With dead ends: 2762 [2023-11-12 01:01:29,140 INFO L226 Difference]: Without dead ends: 2282 [2023-11-12 01:01:29,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 01:01:29,142 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 37 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 01:01:29,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 23 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 01:01:29,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2023-11-12 01:01:29,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2282. [2023-11-12 01:01:29,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2282 states, 2281 states have (on average 3.8088557650153443) internal successors, (8688), 2281 states have internal predecessors, (8688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:01:29,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 2282 states and 8688 transitions. [2023-11-12 01:01:29,301 INFO L78 Accepts]: Start accepts. Automaton has 2282 states and 8688 transitions. Word has length 12 [2023-11-12 01:01:29,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:01:29,302 INFO L495 AbstractCegarLoop]: Abstraction has 2282 states and 8688 transitions. [2023-11-12 01:01:29,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:01:29,302 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 8688 transitions. [2023-11-12 01:01:29,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-12 01:01:29,306 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:01:29,306 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 01:01:29,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 01:01:29,307 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 01:01:29,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:01:29,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1677795703, now seen corresponding path program 1 times [2023-11-12 01:01:29,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:01:29,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159694274] [2023-11-12 01:01:29,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:01:29,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:01:29,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:01:30,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 01:01:30,438 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:01:30,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159694274] [2023-11-12 01:01:30,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159694274] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:01:30,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:01:30,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 01:01:30,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150450027] [2023-11-12 01:01:30,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:01:30,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 01:01:30,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:01:30,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 01:01:30,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 01:01:30,441 INFO L87 Difference]: Start difference. First operand 2282 states and 8688 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:01:30,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:01:30,956 INFO L93 Difference]: Finished difference Result 3704 states and 13429 transitions. [2023-11-12 01:01:30,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 01:01:30,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2023-11-12 01:01:30,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:01:30,993 INFO L225 Difference]: With dead ends: 3704 [2023-11-12 01:01:30,993 INFO L226 Difference]: Without dead ends: 3214 [2023-11-12 01:01:30,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-12 01:01:30,995 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 48 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 01:01:30,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 31 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 01:01:31,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3214 states. [2023-11-12 01:01:31,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3214 to 2346. [2023-11-12 01:01:31,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2346 states, 2345 states have (on average 3.7236673773987206) internal successors, (8732), 2345 states have internal predecessors, (8732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:01:31,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2346 states to 2346 states and 8732 transitions. [2023-11-12 01:01:31,129 INFO L78 Accepts]: Start accepts. Automaton has 2346 states and 8732 transitions. Word has length 14 [2023-11-12 01:01:31,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:01:31,130 INFO L495 AbstractCegarLoop]: Abstraction has 2346 states and 8732 transitions. [2023-11-12 01:01:31,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:01:31,130 INFO L276 IsEmpty]: Start isEmpty. Operand 2346 states and 8732 transitions. [2023-11-12 01:01:31,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-12 01:01:31,134 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:01:31,134 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 01:01:31,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 01:01:31,134 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 01:01:31,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:01:31,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1012028103, now seen corresponding path program 1 times [2023-11-12 01:01:31,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:01:31,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391763039] [2023-11-12 01:01:31,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:01:31,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:01:31,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:01:32,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 01:01:32,073 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:01:32,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391763039] [2023-11-12 01:01:32,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391763039] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:01:32,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:01:32,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 01:01:32,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56405702] [2023-11-12 01:01:32,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:01:32,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 01:01:32,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:01:32,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 01:01:32,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-12 01:01:32,076 INFO L87 Difference]: Start difference. First operand 2346 states and 8732 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:01:32,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:01:32,331 INFO L93 Difference]: Finished difference Result 2514 states and 9126 transitions. [2023-11-12 01:01:32,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 01:01:32,332 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2023-11-12 01:01:32,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:01:32,346 INFO L225 Difference]: With dead ends: 2514 [2023-11-12 01:01:32,346 INFO L226 Difference]: Without dead ends: 2234 [2023-11-12 01:01:32,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-12 01:01:32,349 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 38 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 01:01:32,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 43 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 01:01:32,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2234 states. [2023-11-12 01:01:32,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2234 to 2234. [2023-11-12 01:01:32,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2234 states, 2233 states have (on average 3.688311688311688) internal successors, (8236), 2233 states have internal predecessors, (8236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:01:32,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 8236 transitions. [2023-11-12 01:01:32,449 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 8236 transitions. Word has length 15 [2023-11-12 01:01:32,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:01:32,450 INFO L495 AbstractCegarLoop]: Abstraction has 2234 states and 8236 transitions. [2023-11-12 01:01:32,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:01:32,450 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 8236 transitions. [2023-11-12 01:01:32,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-12 01:01:32,456 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:01:32,456 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 01:01:32,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 01:01:32,457 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 01:01:32,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:01:32,457 INFO L85 PathProgramCache]: Analyzing trace with hash -639180933, now seen corresponding path program 1 times [2023-11-12 01:01:32,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:01:32,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80801949] [2023-11-12 01:01:32,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:01:32,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:01:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:01:33,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 01:01:33,886 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:01:33,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80801949] [2023-11-12 01:01:33,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80801949] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:01:33,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:01:33,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 01:01:33,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297067160] [2023-11-12 01:01:33,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:01:33,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 01:01:33,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:01:33,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 01:01:33,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-12 01:01:33,888 INFO L87 Difference]: Start difference. First operand 2234 states and 8236 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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) [2023-11-12 01:01:34,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:01:34,425 INFO L93 Difference]: Finished difference Result 3400 states and 12262 transitions. [2023-11-12 01:01:34,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-12 01:01:34,426 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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 [2023-11-12 01:01:34,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:01:34,446 INFO L225 Difference]: With dead ends: 3400 [2023-11-12 01:01:34,447 INFO L226 Difference]: Without dead ends: 3172 [2023-11-12 01:01:34,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-12 01:01:34,448 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 91 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 01:01:34,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 50 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 01:01:34,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3172 states. [2023-11-12 01:01:34,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3172 to 2278. [2023-11-12 01:01:34,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2278 states, 2277 states have (on average 3.6855511638120335) internal successors, (8392), 2277 states have internal predecessors, (8392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:01:34,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2278 states to 2278 states and 8392 transitions. [2023-11-12 01:01:34,563 INFO L78 Accepts]: Start accepts. Automaton has 2278 states and 8392 transitions. Word has length 17 [2023-11-12 01:01:34,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:01:34,563 INFO L495 AbstractCegarLoop]: Abstraction has 2278 states and 8392 transitions. [2023-11-12 01:01:34,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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) [2023-11-12 01:01:34,564 INFO L276 IsEmpty]: Start isEmpty. Operand 2278 states and 8392 transitions. [2023-11-12 01:01:34,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-12 01:01:34,570 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:01:34,570 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 01:01:34,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 01:01:34,571 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 01:01:34,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:01:34,571 INFO L85 PathProgramCache]: Analyzing trace with hash -637624113, now seen corresponding path program 2 times [2023-11-12 01:01:34,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:01:34,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858508386] [2023-11-12 01:01:34,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:01:34,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:01:34,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:01:35,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 01:01:35,278 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:01:35,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858508386] [2023-11-12 01:01:35,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858508386] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:01:35,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:01:35,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 01:01:35,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527765524] [2023-11-12 01:01:35,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:01:35,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 01:01:35,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:01:35,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 01:01:35,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-12 01:01:35,282 INFO L87 Difference]: Start difference. First operand 2278 states and 8392 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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) [2023-11-12 01:01:35,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:01:35,564 INFO L93 Difference]: Finished difference Result 2666 states and 9762 transitions. [2023-11-12 01:01:35,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 01:01:35,565 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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 [2023-11-12 01:01:35,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:01:35,582 INFO L225 Difference]: With dead ends: 2666 [2023-11-12 01:01:35,582 INFO L226 Difference]: Without dead ends: 2498 [2023-11-12 01:01:35,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-12 01:01:35,583 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 53 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 01:01:35,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 48 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 01:01:35,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2498 states. [2023-11-12 01:01:35,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2498 to 2374. [2023-11-12 01:01:35,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2374 states, 2373 states have (on average 3.7184997892962497) internal successors, (8824), 2373 states have internal predecessors, (8824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:01:35,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2374 states to 2374 states and 8824 transitions. [2023-11-12 01:01:35,696 INFO L78 Accepts]: Start accepts. Automaton has 2374 states and 8824 transitions. Word has length 17 [2023-11-12 01:01:35,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:01:35,697 INFO L495 AbstractCegarLoop]: Abstraction has 2374 states and 8824 transitions. [2023-11-12 01:01:35,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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) [2023-11-12 01:01:35,698 INFO L276 IsEmpty]: Start isEmpty. Operand 2374 states and 8824 transitions. [2023-11-12 01:01:35,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-12 01:01:35,705 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:01:35,705 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 01:01:35,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 01:01:35,707 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 01:01:35,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:01:35,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1926034663, now seen corresponding path program 3 times [2023-11-12 01:01:35,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:01:35,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201780671] [2023-11-12 01:01:35,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:01:35,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:01:35,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:01:37,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 01:01:37,051 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:01:37,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201780671] [2023-11-12 01:01:37,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201780671] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:01:37,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:01:37,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 01:01:37,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612094073] [2023-11-12 01:01:37,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:01:37,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 01:01:37,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:01:37,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 01:01:37,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 01:01:37,054 INFO L87 Difference]: Start difference. First operand 2374 states and 8824 transitions. Second operand has 6 states, 5 states have (on average 3.4) 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) [2023-11-12 01:01:37,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:01:37,642 INFO L93 Difference]: Finished difference Result 3900 states and 14076 transitions. [2023-11-12 01:01:37,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 01:01:37,643 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) 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 [2023-11-12 01:01:37,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:01:37,667 INFO L225 Difference]: With dead ends: 3900 [2023-11-12 01:01:37,667 INFO L226 Difference]: Without dead ends: 3512 [2023-11-12 01:01:37,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-12 01:01:37,669 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 82 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 01:01:37,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 41 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 01:01:37,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3512 states. [2023-11-12 01:01:37,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3512 to 2618. [2023-11-12 01:01:37,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2618 states, 2617 states have (on average 3.73098968284295) internal successors, (9764), 2617 states have internal predecessors, (9764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:01:37,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2618 states to 2618 states and 9764 transitions. [2023-11-12 01:01:37,797 INFO L78 Accepts]: Start accepts. Automaton has 2618 states and 9764 transitions. Word has length 17 [2023-11-12 01:01:37,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:01:37,798 INFO L495 AbstractCegarLoop]: Abstraction has 2618 states and 9764 transitions. [2023-11-12 01:01:37,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) 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) [2023-11-12 01:01:37,798 INFO L276 IsEmpty]: Start isEmpty. Operand 2618 states and 9764 transitions. [2023-11-12 01:01:37,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-12 01:01:37,807 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:01:37,807 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 01:01:37,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 01:01:37,807 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 01:01:37,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:01:37,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1925775193, now seen corresponding path program 4 times [2023-11-12 01:01:37,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:01:37,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330523223] [2023-11-12 01:01:37,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:01:37,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:01:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:01:38,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 01:01:38,291 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:01:38,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330523223] [2023-11-12 01:01:38,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330523223] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:01:38,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:01:38,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 01:01:38,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682830501] [2023-11-12 01:01:38,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:01:38,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 01:01:38,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:01:38,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 01:01:38,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-12 01:01:38,294 INFO L87 Difference]: Start difference. First operand 2618 states and 9764 transitions. Second operand has 6 states, 5 states have (on average 3.4) 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) [2023-11-12 01:01:38,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:01:38,630 INFO L93 Difference]: Finished difference Result 3102 states and 11398 transitions. [2023-11-12 01:01:38,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 01:01:38,631 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) 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 [2023-11-12 01:01:38,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:01:38,650 INFO L225 Difference]: With dead ends: 3102 [2023-11-12 01:01:38,650 INFO L226 Difference]: Without dead ends: 2910 [2023-11-12 01:01:38,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2023-11-12 01:01:38,651 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 51 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 01:01:38,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 37 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 01:01:38,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2023-11-12 01:01:38,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 2634. [2023-11-12 01:01:38,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2634 states, 2633 states have (on average 3.728066843904292) internal successors, (9816), 2633 states have internal predecessors, (9816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:01:38,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2634 states to 2634 states and 9816 transitions. [2023-11-12 01:01:38,771 INFO L78 Accepts]: Start accepts. Automaton has 2634 states and 9816 transitions. Word has length 17 [2023-11-12 01:01:38,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:01:38,774 INFO L495 AbstractCegarLoop]: Abstraction has 2634 states and 9816 transitions. [2023-11-12 01:01:38,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) 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) [2023-11-12 01:01:38,774 INFO L276 IsEmpty]: Start isEmpty. Operand 2634 states and 9816 transitions. [2023-11-12 01:01:38,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-12 01:01:38,782 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:01:38,782 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 01:01:38,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 01:01:38,783 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 01:01:38,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:01:38,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1963974943, now seen corresponding path program 5 times [2023-11-12 01:01:38,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:01:38,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493649278] [2023-11-12 01:01:38,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:01:38,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:01:38,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:01:39,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 01:01:39,412 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:01:39,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493649278] [2023-11-12 01:01:39,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493649278] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:01:39,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:01:39,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 01:01:39,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336919702] [2023-11-12 01:01:39,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:01:39,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 01:01:39,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:01:39,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 01:01:39,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-12 01:01:39,415 INFO L87 Difference]: Start difference. First operand 2634 states and 9816 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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) [2023-11-12 01:01:39,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:01:39,754 INFO L93 Difference]: Finished difference Result 3306 states and 12134 transitions. [2023-11-12 01:01:39,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 01:01:39,755 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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 [2023-11-12 01:01:39,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:01:39,775 INFO L225 Difference]: With dead ends: 3306 [2023-11-12 01:01:39,775 INFO L226 Difference]: Without dead ends: 3138 [2023-11-12 01:01:39,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-11-12 01:01:39,777 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 62 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 01:01:39,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 44 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 01:01:39,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3138 states. [2023-11-12 01:01:39,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3138 to 2374. [2023-11-12 01:01:39,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2374 states, 2373 states have (on average 3.6738305941845764) internal successors, (8718), 2373 states have internal predecessors, (8718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:01:39,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2374 states to 2374 states and 8718 transitions. [2023-11-12 01:01:39,886 INFO L78 Accepts]: Start accepts. Automaton has 2374 states and 8718 transitions. Word has length 17 [2023-11-12 01:01:39,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:01:39,887 INFO L495 AbstractCegarLoop]: Abstraction has 2374 states and 8718 transitions. [2023-11-12 01:01:39,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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) [2023-11-12 01:01:39,887 INFO L276 IsEmpty]: Start isEmpty. Operand 2374 states and 8718 transitions. [2023-11-12 01:01:39,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-12 01:01:39,893 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:01:39,894 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 01:01:39,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 01:01:39,894 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 01:01:39,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:01:39,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1893772488, now seen corresponding path program 1 times [2023-11-12 01:01:39,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:01:39,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242151473] [2023-11-12 01:01:39,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:01:39,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:01:39,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:01:40,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 01:01:40,105 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:01:40,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242151473] [2023-11-12 01:01:40,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242151473] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:01:40,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:01:40,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 01:01:40,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140849820] [2023-11-12 01:01:40,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:01:40,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 01:01:40,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:01:40,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 01:01:40,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 01:01:40,107 INFO L87 Difference]: Start difference. First operand 2374 states and 8718 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) 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) [2023-11-12 01:01:40,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:01:40,220 INFO L93 Difference]: Finished difference Result 1882 states and 6266 transitions. [2023-11-12 01:01:40,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 01:01:40,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) 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 [2023-11-12 01:01:40,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:01:40,231 INFO L225 Difference]: With dead ends: 1882 [2023-11-12 01:01:40,232 INFO L226 Difference]: Without dead ends: 1882 [2023-11-12 01:01:40,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 01:01:40,233 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 10 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 01:01:40,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 10 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 01:01:40,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2023-11-12 01:01:40,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1882. [2023-11-12 01:01:40,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1882 states, 1881 states have (on average 3.3312068048910155) internal successors, (6266), 1881 states have internal predecessors, (6266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:01:40,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1882 states to 1882 states and 6266 transitions. [2023-11-12 01:01:40,302 INFO L78 Accepts]: Start accepts. Automaton has 1882 states and 6266 transitions. Word has length 17 [2023-11-12 01:01:40,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:01:40,302 INFO L495 AbstractCegarLoop]: Abstraction has 1882 states and 6266 transitions. [2023-11-12 01:01:40,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) 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) [2023-11-12 01:01:40,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 6266 transitions. [2023-11-12 01:01:40,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-12 01:01:40,308 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:01:40,308 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 01:01:40,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-12 01:01:40,309 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 01:01:40,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:01:40,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1081881286, now seen corresponding path program 1 times [2023-11-12 01:01:40,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:01:40,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009648578] [2023-11-12 01:01:40,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:01:40,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:01:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:01:40,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 01:01:40,508 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:01:40,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009648578] [2023-11-12 01:01:40,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009648578] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:01:40,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:01:40,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 01:01:40,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262902853] [2023-11-12 01:01:40,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:01:40,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 01:01:40,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:01:40,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 01:01:40,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 01:01:40,511 INFO L87 Difference]: Start difference. First operand 1882 states and 6266 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:01:40,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:01:40,619 INFO L93 Difference]: Finished difference Result 1208 states and 3584 transitions. [2023-11-12 01:01:40,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 01:01:40,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2023-11-12 01:01:40,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:01:40,625 INFO L225 Difference]: With dead ends: 1208 [2023-11-12 01:01:40,626 INFO L226 Difference]: Without dead ends: 1208 [2023-11-12 01:01:40,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 01:01:40,627 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 29 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 01:01:40,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 15 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 01:01:40,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2023-11-12 01:01:40,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1204. [2023-11-12 01:01:40,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1204 states, 1203 states have (on average 2.9675810473815463) internal successors, (3570), 1203 states have internal predecessors, (3570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:01:40,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 3570 transitions. [2023-11-12 01:01:40,663 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 3570 transitions. Word has length 18 [2023-11-12 01:01:40,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:01:40,664 INFO L495 AbstractCegarLoop]: Abstraction has 1204 states and 3570 transitions. [2023-11-12 01:01:40,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:01:40,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 3570 transitions. [2023-11-12 01:01:40,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-12 01:01:40,668 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:01:40,668 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 01:01:40,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-12 01:01:40,668 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 01:01:40,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:01:40,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1573358833, now seen corresponding path program 1 times [2023-11-12 01:01:40,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:01:40,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326507084] [2023-11-12 01:01:40,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:01:40,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:01:40,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:01:41,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 01:01:41,575 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:01:41,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326507084] [2023-11-12 01:01:41,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326507084] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:01:41,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:01:41,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 01:01:41,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578809104] [2023-11-12 01:01:41,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:01:41,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 01:01:41,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:01:41,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 01:01:41,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 01:01:41,577 INFO L87 Difference]: Start difference. First operand 1204 states and 3570 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:01:41,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:01:41,895 INFO L93 Difference]: Finished difference Result 1701 states and 4884 transitions. [2023-11-12 01:01:41,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 01:01:41,896 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2023-11-12 01:01:41,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:01:41,902 INFO L225 Difference]: With dead ends: 1701 [2023-11-12 01:01:41,902 INFO L226 Difference]: Without dead ends: 1122 [2023-11-12 01:01:41,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-12 01:01:41,903 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 43 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 01:01:41,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 23 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 01:01:41,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2023-11-12 01:01:41,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1036. [2023-11-12 01:01:41,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1036 states, 1035 states have (on average 2.863768115942029) internal successors, (2964), 1035 states have internal predecessors, (2964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:01:41,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 2964 transitions. [2023-11-12 01:01:41,953 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 2964 transitions. Word has length 20 [2023-11-12 01:01:41,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:01:41,953 INFO L495 AbstractCegarLoop]: Abstraction has 1036 states and 2964 transitions. [2023-11-12 01:01:41,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:01:41,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 2964 transitions. [2023-11-12 01:01:41,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-12 01:01:41,958 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:01:41,959 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 01:01:41,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-12 01:01:41,959 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 01:01:41,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:01:41,960 INFO L85 PathProgramCache]: Analyzing trace with hash 2048385661, now seen corresponding path program 1 times [2023-11-12 01:01:41,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:01:41,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144393278] [2023-11-12 01:01:41,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:01:41,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:01:42,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:01:42,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 01:01:42,229 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:01:42,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144393278] [2023-11-12 01:01:42,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144393278] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:01:42,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:01:42,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 01:01:42,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892859496] [2023-11-12 01:01:42,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:01:42,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 01:01:42,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:01:42,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 01:01:42,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-12 01:01:42,232 INFO L87 Difference]: Start difference. First operand 1036 states and 2964 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:01:42,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:01:42,366 INFO L93 Difference]: Finished difference Result 762 states and 2168 transitions. [2023-11-12 01:01:42,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 01:01:42,367 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2023-11-12 01:01:42,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:01:42,369 INFO L225 Difference]: With dead ends: 762 [2023-11-12 01:01:42,369 INFO L226 Difference]: Without dead ends: 762 [2023-11-12 01:01:42,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-12 01:01:42,370 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 37 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 01:01:42,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 20 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 01:01:42,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2023-11-12 01:01:42,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 750. [2023-11-12 01:01:42,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 749 states have (on average 2.8518024032042724) internal successors, (2136), 749 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:01:42,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 2136 transitions. [2023-11-12 01:01:42,400 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 2136 transitions. Word has length 20 [2023-11-12 01:01:42,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:01:42,400 INFO L495 AbstractCegarLoop]: Abstraction has 750 states and 2136 transitions. [2023-11-12 01:01:42,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:01:42,401 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 2136 transitions. [2023-11-12 01:01:42,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-12 01:01:42,405 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:01:42,405 INFO L195 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] [2023-11-12 01:01:42,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-12 01:01:42,406 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 01:01:42,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:01:42,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1989714480, now seen corresponding path program 1 times [2023-11-12 01:01:42,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:01:42,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310013142] [2023-11-12 01:01:42,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:01:42,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:01:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:01:43,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 01:01:43,464 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:01:43,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310013142] [2023-11-12 01:01:43,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310013142] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:01:43,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:01:43,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 01:01:43,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800251433] [2023-11-12 01:01:43,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:01:43,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 01:01:43,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:01:43,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 01:01:43,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-12 01:01:43,467 INFO L87 Difference]: Start difference. First operand 750 states and 2136 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 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) [2023-11-12 01:01:44,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:01:44,268 INFO L93 Difference]: Finished difference Result 1230 states and 3440 transitions. [2023-11-12 01:01:44,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-12 01:01:44,268 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 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 [2023-11-12 01:01:44,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:01:44,271 INFO L225 Difference]: With dead ends: 1230 [2023-11-12 01:01:44,271 INFO L226 Difference]: Without dead ends: 1028 [2023-11-12 01:01:44,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2023-11-12 01:01:44,272 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 77 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-12 01:01:44,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 75 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-12 01:01:44,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2023-11-12 01:01:44,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 900. [2023-11-12 01:01:44,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 899 states have (on average 2.791991101223582) internal successors, (2510), 899 states have internal predecessors, (2510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:01:44,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 2510 transitions. [2023-11-12 01:01:44,297 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 2510 transitions. Word has length 23 [2023-11-12 01:01:44,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:01:44,297 INFO L495 AbstractCegarLoop]: Abstraction has 900 states and 2510 transitions. [2023-11-12 01:01:44,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 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) [2023-11-12 01:01:44,298 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 2510 transitions. [2023-11-12 01:01:44,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-12 01:01:44,306 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:01:44,306 INFO L195 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] [2023-11-12 01:01:44,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-12 01:01:44,307 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 01:01:44,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:01:44,308 INFO L85 PathProgramCache]: Analyzing trace with hash 2060461908, now seen corresponding path program 2 times [2023-11-12 01:01:44,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:01:44,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537700087] [2023-11-12 01:01:44,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:01:44,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:01:44,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:01:44,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 01:01:44,602 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:01:44,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537700087] [2023-11-12 01:01:44,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537700087] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:01:44,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:01:44,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 01:01:44,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720007540] [2023-11-12 01:01:44,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:01:44,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 01:01:44,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:01:44,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 01:01:44,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-12 01:01:44,607 INFO L87 Difference]: Start difference. First operand 900 states and 2510 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 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) [2023-11-12 01:01:44,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:01:44,769 INFO L93 Difference]: Finished difference Result 838 states and 2389 transitions. [2023-11-12 01:01:44,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 01:01:44,769 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 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 [2023-11-12 01:01:44,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:01:44,771 INFO L225 Difference]: With dead ends: 838 [2023-11-12 01:01:44,771 INFO L226 Difference]: Without dead ends: 469 [2023-11-12 01:01:44,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-12 01:01:44,772 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 47 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 01:01:44,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 19 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 01:01:44,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2023-11-12 01:01:44,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 461. [2023-11-12 01:01:44,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 460 states have (on average 2.756521739130435) internal successors, (1268), 460 states have internal predecessors, (1268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:01:44,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 1268 transitions. [2023-11-12 01:01:44,787 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 1268 transitions. Word has length 23 [2023-11-12 01:01:44,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:01:44,788 INFO L495 AbstractCegarLoop]: Abstraction has 461 states and 1268 transitions. [2023-11-12 01:01:44,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 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) [2023-11-12 01:01:44,788 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 1268 transitions. [2023-11-12 01:01:44,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-12 01:01:44,790 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:01:44,790 INFO L195 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] [2023-11-12 01:01:44,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-12 01:01:44,791 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 01:01:44,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:01:44,791 INFO L85 PathProgramCache]: Analyzing trace with hash -935217311, now seen corresponding path program 1 times [2023-11-12 01:01:44,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:01:44,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648457780] [2023-11-12 01:01:44,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:01:44,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:01:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:01:45,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 01:01:45,050 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:01:45,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648457780] [2023-11-12 01:01:45,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648457780] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:01:45,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:01:45,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 01:01:45,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939918374] [2023-11-12 01:01:45,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:01:45,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 01:01:45,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:01:45,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 01:01:45,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 01:01:45,053 INFO L87 Difference]: Start difference. First operand 461 states and 1268 transitions. Second operand has 5 states, 4 states have (on average 6.75) 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) [2023-11-12 01:01:45,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:01:45,213 INFO L93 Difference]: Finished difference Result 599 states and 1634 transitions. [2023-11-12 01:01:45,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 01:01:45,214 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) 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 [2023-11-12 01:01:45,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:01:45,214 INFO L225 Difference]: With dead ends: 599 [2023-11-12 01:01:45,214 INFO L226 Difference]: Without dead ends: 185 [2023-11-12 01:01:45,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-12 01:01:45,215 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 20 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 01:01:45,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 28 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 01:01:45,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2023-11-12 01:01:45,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2023-11-12 01:01:45,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 2.472826086956522) internal successors, (455), 184 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:01:45,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 455 transitions. [2023-11-12 01:01:45,221 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 455 transitions. Word has length 27 [2023-11-12 01:01:45,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:01:45,222 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 455 transitions. [2023-11-12 01:01:45,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) 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) [2023-11-12 01:01:45,222 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 455 transitions. [2023-11-12 01:01:45,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-12 01:01:45,223 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:01:45,223 INFO L195 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] [2023-11-12 01:01:45,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-12 01:01:45,224 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 01:01:45,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:01:45,225 INFO L85 PathProgramCache]: Analyzing trace with hash -907584193, now seen corresponding path program 2 times [2023-11-12 01:01:45,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:01:45,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450983799] [2023-11-12 01:01:45,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:01:45,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:01:45,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:01:46,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 01:01:46,300 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:01:46,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450983799] [2023-11-12 01:01:46,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450983799] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:01:46,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:01:46,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 01:01:46,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719598432] [2023-11-12 01:01:46,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:01:46,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 01:01:46,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:01:46,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 01:01:46,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-12 01:01:46,302 INFO L87 Difference]: Start difference. First operand 185 states and 455 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 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) [2023-11-12 01:01:46,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:01:46,708 INFO L93 Difference]: Finished difference Result 260 states and 642 transitions. [2023-11-12 01:01:46,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 01:01:46,709 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 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 [2023-11-12 01:01:46,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:01:46,710 INFO L225 Difference]: With dead ends: 260 [2023-11-12 01:01:46,710 INFO L226 Difference]: Without dead ends: 97 [2023-11-12 01:01:46,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-11-12 01:01:46,711 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 29 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 01:01:46,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 28 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 01:01:46,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-12 01:01:46,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2023-11-12 01:01:46,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 2.1630434782608696) internal successors, (199), 92 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:01:46,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 199 transitions. [2023-11-12 01:01:46,715 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 199 transitions. Word has length 27 [2023-11-12 01:01:46,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:01:46,715 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 199 transitions. [2023-11-12 01:01:46,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 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) [2023-11-12 01:01:46,715 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 199 transitions. [2023-11-12 01:01:46,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-12 01:01:46,716 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:01:46,716 INFO L195 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] [2023-11-12 01:01:46,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-12 01:01:46,716 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 01:01:46,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:01:46,717 INFO L85 PathProgramCache]: Analyzing trace with hash 938120511, now seen corresponding path program 3 times [2023-11-12 01:01:46,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:01:46,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591836046] [2023-11-12 01:01:46,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:01:46,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:01:46,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:01:47,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 01:01:47,905 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:01:47,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591836046] [2023-11-12 01:01:47,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591836046] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:01:47,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:01:47,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 01:01:47,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73151646] [2023-11-12 01:01:47,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:01:47,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 01:01:47,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:01:47,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 01:01:47,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-12 01:01:47,908 INFO L87 Difference]: Start difference. First operand 93 states and 199 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 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) [2023-11-12 01:01:48,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:01:48,130 INFO L93 Difference]: Finished difference Result 120 states and 254 transitions. [2023-11-12 01:01:48,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 01:01:48,130 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 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 [2023-11-12 01:01:48,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:01:48,131 INFO L225 Difference]: With dead ends: 120 [2023-11-12 01:01:48,131 INFO L226 Difference]: Without dead ends: 65 [2023-11-12 01:01:48,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-11-12 01:01:48,132 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 34 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 01:01:48,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 23 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 01:01:48,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-12 01:01:48,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2023-11-12 01:01:48,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.921875) internal successors, (123), 64 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:01:48,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 123 transitions. [2023-11-12 01:01:48,135 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 123 transitions. Word has length 27 [2023-11-12 01:01:48,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:01:48,135 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 123 transitions. [2023-11-12 01:01:48,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 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) [2023-11-12 01:01:48,136 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 123 transitions. [2023-11-12 01:01:48,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-12 01:01:48,136 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:01:48,136 INFO L195 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] [2023-11-12 01:01:48,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-12 01:01:48,137 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 01:01:48,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:01:48,137 INFO L85 PathProgramCache]: Analyzing trace with hash -440563359, now seen corresponding path program 4 times [2023-11-12 01:01:48,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:01:48,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26911733] [2023-11-12 01:01:48,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:01:48,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:01:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 01:01:48,193 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 01:01:48,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 01:01:48,318 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-12 01:01:48,320 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-12 01:01:48,322 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-12 01:01:48,324 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-12 01:01:48,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-12 01:01:48,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-12 01:01:48,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-12 01:01:48,326 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-12 01:01:48,326 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-12 01:01:48,326 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-12 01:01:48,327 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-12 01:01:48,327 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-12 01:01:48,327 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-12 01:01:48,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-12 01:01:48,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-12 01:01:48,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-12 01:01:48,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-12 01:01:48,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-12 01:01:48,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-12 01:01:48,331 INFO L445 BasicCegarLoop]: Path program histogram: [5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 01:01:48,338 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-12 01:01:48,338 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 01:01:48,429 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-12 01:01:48,431 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-12 01:01:48,433 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-12 01:01:48,434 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-12 01:01:48,456 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-12 01:01:48,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 01:01:48 BasicIcfg [2023-11-12 01:01:48,476 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 01:01:48,477 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 01:01:48,477 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 01:01:48,478 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 01:01:48,478 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:01:16" (3/4) ... [2023-11-12 01:01:48,480 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-12 01:01:48,481 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 01:01:48,482 INFO L158 Benchmark]: Toolchain (without parser) took 34094.37ms. Allocated memory was 148.9MB in the beginning and 817.9MB in the end (delta: 669.0MB). Free memory was 114.0MB in the beginning and 375.0MB in the end (delta: -261.0MB). Peak memory consumption was 410.1MB. Max. memory is 16.1GB. [2023-11-12 01:01:48,483 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 148.9MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 01:01:48,483 INFO L158 Benchmark]: CACSL2BoogieTranslator took 788.71ms. Allocated memory is still 148.9MB. Free memory was 114.0MB in the beginning and 90.5MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-12 01:01:48,483 INFO L158 Benchmark]: Boogie Procedure Inliner took 125.75ms. Allocated memory is still 148.9MB. Free memory was 90.5MB in the beginning and 87.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 01:01:48,484 INFO L158 Benchmark]: Boogie Preprocessor took 62.30ms. Allocated memory is still 148.9MB. Free memory was 87.8MB in the beginning and 85.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 01:01:48,488 INFO L158 Benchmark]: RCFGBuilder took 1144.95ms. Allocated memory was 148.9MB in the beginning and 209.7MB in the end (delta: 60.8MB). Free memory was 85.7MB in the beginning and 173.3MB in the end (delta: -87.6MB). Peak memory consumption was 44.5MB. Max. memory is 16.1GB. [2023-11-12 01:01:48,490 INFO L158 Benchmark]: TraceAbstraction took 31956.13ms. Allocated memory was 209.7MB in the beginning and 817.9MB in the end (delta: 608.2MB). Free memory was 172.2MB in the beginning and 376.1MB in the end (delta: -203.8MB). Peak memory consumption was 403.3MB. Max. memory is 16.1GB. [2023-11-12 01:01:48,490 INFO L158 Benchmark]: Witness Printer took 4.44ms. Allocated memory is still 817.9MB. Free memory was 376.1MB in the beginning and 375.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 01:01:48,497 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.46ms. Allocated memory is still 148.9MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 788.71ms. Allocated memory is still 148.9MB. Free memory was 114.0MB in the beginning and 90.5MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 125.75ms. Allocated memory is still 148.9MB. Free memory was 90.5MB in the beginning and 87.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.30ms. Allocated memory is still 148.9MB. Free memory was 87.8MB in the beginning and 85.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1144.95ms. Allocated memory was 148.9MB in the beginning and 209.7MB in the end (delta: 60.8MB). Free memory was 85.7MB in the beginning and 173.3MB in the end (delta: -87.6MB). Peak memory consumption was 44.5MB. Max. memory is 16.1GB. * TraceAbstraction took 31956.13ms. Allocated memory was 209.7MB in the beginning and 817.9MB in the end (delta: 608.2MB). Free memory was 172.2MB in the beginning and 376.1MB in the end (delta: -203.8MB). Peak memory consumption was 403.3MB. Max. memory is 16.1GB. * Witness Printer took 4.44ms. Allocated memory is still 817.9MB. Free memory was 376.1MB in the beginning and 375.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.2s, 160 PlacesBefore, 55 PlacesAfterwards, 150 TransitionsBefore, 43 TransitionsAfterwards, 3780 CoEnabledTransitionPairs, 6 FixpointIterations, 53 TrivialSequentialCompositions, 83 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 150 TotalNumberOfCompositions, 8773 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4178, independent: 4005, independent conditional: 0, independent unconditional: 4005, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2497, independent: 2443, independent conditional: 0, independent unconditional: 2443, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2497, independent: 2418, independent conditional: 0, independent unconditional: 2418, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 79, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 549, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 503, dependent conditional: 0, dependent unconditional: 503, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4178, independent: 1562, independent conditional: 0, independent unconditional: 1562, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 2497, unknown conditional: 0, unknown unconditional: 2497] , Statistics on independence cache: Total cache size (in pairs): 203, Positive cache size: 182, Positive conditional cache size: 0, Positive unconditional cache size: 182, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1165; [L847] FCALL, FORK 0 pthread_create(&t1165, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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, t1165={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L848] 0 pthread_t t1166; [L849] FCALL, FORK 0 pthread_create(&t1166, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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, t1165={5:0}, t1166={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L850] 0 pthread_t t1167; [L851] FCALL, FORK 0 pthread_create(&t1167, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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, t1165={5:0}, t1166={6:0}, t1167={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L852] 0 pthread_t t1168; [L853] FCALL, FORK 0 pthread_create(&t1168, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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, t1165={5:0}, t1166={6:0}, t1167={7:0}, t1168={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L806] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L806] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 [L815] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L818] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L821] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_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=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_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=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L767] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, 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=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, 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=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L782] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L785] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L788] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 3 return 0; [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1165={5:0}, t1166={6:0}, t1167={7:0}, t1168={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix044.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 844]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 185 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 31.6s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.1s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 851 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 851 mSDsluCounter, 624 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 418 mSDsCounter, 102 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2658 IncrementalHoareTripleChecker+Invalid, 2760 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 102 mSolverCounterUnsat, 206 mSDtfsCounter, 2658 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3924occurred in iteration=0, InterpolantAutomatonStates: 124, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 20 MinimizatonAttempts, 4062 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 12.9s InterpolantComputationTime, 377 NumberOfCodeBlocks, 377 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 330 ConstructedInterpolants, 0 QuantifiedInterpolants, 2988 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-12 01:01:48,540 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89b32aa4-2134-4c86-87a7-b131cb45d51d/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89b32aa4-2134-4c86-87a7-b131cb45d51d/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89b32aa4-2134-4c86-87a7-b131cb45d51d/bin/utaipan-verify-NcY6lQBIFX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89b32aa4-2134-4c86-87a7-b131cb45d51d/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89b32aa4-2134-4c86-87a7-b131cb45d51d/bin/utaipan-verify-NcY6lQBIFX/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix044.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89b32aa4-2134-4c86-87a7-b131cb45d51d/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89b32aa4-2134-4c86-87a7-b131cb45d51d/bin/utaipan-verify-NcY6lQBIFX --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 bb408c890b0d52a937687fd58d564d57121120b7f4647156375768e776a678b4 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 01:01:51,514 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 01:01:51,658 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89b32aa4-2134-4c86-87a7-b131cb45d51d/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2023-11-12 01:01:51,671 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 01:01:51,672 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 01:01:51,725 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 01:01:51,726 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 01:01:51,727 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 01:01:51,728 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 01:01:51,733 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 01:01:51,734 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 01:01:51,735 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 01:01:51,735 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 01:01:51,737 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 01:01:51,738 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 01:01:51,738 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 01:01:51,739 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 01:01:51,740 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 01:01:51,741 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 01:01:51,742 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 01:01:51,743 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 01:01:51,743 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 01:01:51,744 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 01:01:51,744 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 01:01:51,745 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 01:01:51,745 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-12 01:01:51,746 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 01:01:51,746 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 01:01:51,747 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-12 01:01:51,747 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-12 01:01:51,749 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 01:01:51,749 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 01:01:51,749 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 01:01:51,750 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 01:01:51,750 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 01:01:51,750 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 01:01:51,752 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 01:01:51,752 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 01:01:51,752 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 01:01:51,753 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-11-12 01:01:51,753 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-12 01:01:51,753 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 01:01:51,754 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 01:01:51,754 INFO L153 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89b32aa4-2134-4c86-87a7-b131cb45d51d/bin/utaipan-verify-NcY6lQBIFX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89b32aa4-2134-4c86-87a7-b131cb45d51d/bin/utaipan-verify-NcY6lQBIFX 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 -> bb408c890b0d52a937687fd58d564d57121120b7f4647156375768e776a678b4 [2023-11-12 01:01:52,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 01:01:52,249 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 01:01:52,252 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 01:01:52,254 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 01:01:52,254 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 01:01:52,256 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89b32aa4-2134-4c86-87a7-b131cb45d51d/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/pthread-wmm/mix044.opt.i