./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4fc63b2a 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_b6b19570-5ebc-42d2-9675-a684ba1d9031/bin/utaipan-verify-DbMuA5NWw2/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b19570-5ebc-42d2-9675-a684ba1d9031/bin/utaipan-verify-DbMuA5NWw2/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b19570-5ebc-42d2-9675-a684ba1d9031/bin/utaipan-verify-DbMuA5NWw2/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b19570-5ebc-42d2-9675-a684ba1d9031/bin/utaipan-verify-DbMuA5NWw2/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b19570-5ebc-42d2-9675-a684ba1d9031/bin/utaipan-verify-DbMuA5NWw2/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b19570-5ebc-42d2-9675-a684ba1d9031/bin/utaipan-verify-DbMuA5NWw2 --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 87c512ff7772c648d2c2d28b30bf4d136366c31440eeddc6ab833b392d36d780 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-11-02 11:25:22,474 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-02 11:25:22,559 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b19570-5ebc-42d2-9675-a684ba1d9031/bin/utaipan-verify-DbMuA5NWw2/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-02 11:25:22,568 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-02 11:25:22,569 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-02 11:25:22,599 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-02 11:25:22,600 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-02 11:25:22,600 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-02 11:25:22,601 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-02 11:25:22,601 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-02 11:25:22,602 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-02 11:25:22,602 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-02 11:25:22,602 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-02 11:25:22,603 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-02 11:25:22,603 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-02 11:25:22,604 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-02 11:25:22,604 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-02 11:25:22,604 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-02 11:25:22,605 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-02 11:25:22,605 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-02 11:25:22,606 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-02 11:25:22,610 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-02 11:25:22,610 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-02 11:25:22,611 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-02 11:25:22,611 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-02 11:25:22,612 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-02 11:25:22,612 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-02 11:25:22,612 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-02 11:25:22,613 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-02 11:25:22,613 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-02 11:25:22,613 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-02 11:25:22,614 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-02 11:25:22,614 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-02 11:25:22,614 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-02 11:25:22,615 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-02 11:25:22,615 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-02 11:25:22,615 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-02 11:25:22,616 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-02 11:25:22,620 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-02 11:25:22,621 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-02 11:25:22,621 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-02 11:25:22,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-02 11:25:22,622 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-02 11:25:22,622 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-02 11:25:22,622 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-02 11:25:22,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-02 11:25:22,623 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-02 11:25:22,623 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-02 11:25:22,624 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-02 11:25:22,624 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_b6b19570-5ebc-42d2-9675-a684ba1d9031/bin/utaipan-verify-DbMuA5NWw2/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_b6b19570-5ebc-42d2-9675-a684ba1d9031/bin/utaipan-verify-DbMuA5NWw2 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 -> 87c512ff7772c648d2c2d28b30bf4d136366c31440eeddc6ab833b392d36d780 [2024-11-02 11:25:22,953 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-02 11:25:22,984 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-02 11:25:22,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-02 11:25:22,988 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-02 11:25:22,989 INFO L274 PluginConnector]: CDTParser initialized [2024-11-02 11:25:22,990 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b19570-5ebc-42d2-9675-a684ba1d9031/bin/utaipan-verify-DbMuA5NWw2/../../sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i Unable to find full path for "g++" [2024-11-02 11:25:25,381 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-02 11:25:25,642 INFO L384 CDTParser]: Found 1 translation units. [2024-11-02 11:25:25,646 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b19570-5ebc-42d2-9675-a684ba1d9031/sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2024-11-02 11:25:25,668 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b19570-5ebc-42d2-9675-a684ba1d9031/bin/utaipan-verify-DbMuA5NWw2/data/862b85071/deaad815ce2343de961bcab916b2c57c/FLAG59bd5f73d [2024-11-02 11:25:25,948 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b19570-5ebc-42d2-9675-a684ba1d9031/bin/utaipan-verify-DbMuA5NWw2/data/862b85071/deaad815ce2343de961bcab916b2c57c [2024-11-02 11:25:25,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-02 11:25:25,952 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-02 11:25:25,953 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-02 11:25:25,954 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-02 11:25:25,960 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-02 11:25:25,961 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 11:25:25" (1/1) ... [2024-11-02 11:25:25,962 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e903f81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:25:25, skipping insertion in model container [2024-11-02 11:25:25,963 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 11:25:25" (1/1) ... [2024-11-02 11:25:26,015 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-02 11:25:26,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 11:25:26,608 INFO L200 MainTranslator]: Completed pre-run [2024-11-02 11:25:26,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 11:25:26,774 INFO L204 MainTranslator]: Completed translation [2024-11-02 11:25:26,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:25:26 WrapperNode [2024-11-02 11:25:26,775 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-02 11:25:26,776 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-02 11:25:26,776 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-02 11:25:26,776 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-02 11:25:26,785 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:25:26" (1/1) ... [2024-11-02 11:25:26,809 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:25:26" (1/1) ... [2024-11-02 11:25:26,862 INFO L138 Inliner]: procedures = 175, calls = 49, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 128 [2024-11-02 11:25:26,862 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-02 11:25:26,863 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-02 11:25:26,863 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-02 11:25:26,863 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-02 11:25:26,877 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:25:26" (1/1) ... [2024-11-02 11:25:26,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:25:26" (1/1) ... [2024-11-02 11:25:26,880 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:25:26" (1/1) ... [2024-11-02 11:25:26,882 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:25:26" (1/1) ... [2024-11-02 11:25:26,898 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:25:26" (1/1) ... [2024-11-02 11:25:26,900 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:25:26" (1/1) ... [2024-11-02 11:25:26,907 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:25:26" (1/1) ... [2024-11-02 11:25:26,908 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:25:26" (1/1) ... [2024-11-02 11:25:26,915 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-02 11:25:26,920 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-02 11:25:26,920 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-02 11:25:26,920 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-02 11:25:26,921 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:25:26" (1/1) ... [2024-11-02 11:25:26,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-02 11:25:26,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b19570-5ebc-42d2-9675-a684ba1d9031/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 11:25:26,971 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b19570-5ebc-42d2-9675-a684ba1d9031/bin/utaipan-verify-DbMuA5NWw2/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-02 11:25:26,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b19570-5ebc-42d2-9675-a684ba1d9031/bin/utaipan-verify-DbMuA5NWw2/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-02 11:25:27,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-02 11:25:27,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-02 11:25:27,011 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-02 11:25:27,012 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-02 11:25:27,012 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-02 11:25:27,013 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-02 11:25:27,013 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-02 11:25:27,014 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-02 11:25:27,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-02 11:25:27,014 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-02 11:25:27,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-02 11:25:27,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-02 11:25:27,016 WARN L207 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-02 11:25:27,214 INFO L238 CfgBuilder]: Building ICFG [2024-11-02 11:25:27,216 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-02 11:25:27,736 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-02 11:25:27,737 INFO L287 CfgBuilder]: Performing block encoding [2024-11-02 11:25:28,019 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-02 11:25:28,019 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-02 11:25:28,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 11:25:28 BoogieIcfgContainer [2024-11-02 11:25:28,020 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-02 11:25:28,023 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-02 11:25:28,024 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-02 11:25:28,028 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-02 11:25:28,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 11:25:25" (1/3) ... [2024-11-02 11:25:28,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2789e9c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 11:25:28, skipping insertion in model container [2024-11-02 11:25:28,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:25:26" (2/3) ... [2024-11-02 11:25:28,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2789e9c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 11:25:28, skipping insertion in model container [2024-11-02 11:25:28,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 11:25:28" (3/3) ... [2024-11-02 11:25:28,033 INFO L112 eAbstractionObserver]: Analyzing ICFG mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2024-11-02 11:25:28,052 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-02 11:25:28,052 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-02 11:25:28,053 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-02 11:25:28,122 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-02 11:25:28,163 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 55 places, 47 transitions, 106 flow [2024-11-02 11:25:28,731 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 8170 states, 8165 states have (on average 3.6782608695652175) internal successors, (30033), 8169 states have internal predecessors, (30033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:25:28,771 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-02 11:25:28,780 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1f799a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-02 11:25:28,781 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-02 11:25:28,815 INFO L276 IsEmpty]: Start isEmpty. Operand has 8170 states, 8165 states have (on average 3.6782608695652175) internal successors, (30033), 8169 states have internal predecessors, (30033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:25:28,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-02 11:25:28,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:25:28,833 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-02 11:25:28,834 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-02 11:25:28,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:25:28,849 INFO L85 PathProgramCache]: Analyzing trace with hash 12370397, now seen corresponding path program 1 times [2024-11-02 11:25:28,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:25:28,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402336322] [2024-11-02 11:25:28,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:25:28,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:25:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:25:29,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:25:29,717 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:25:29,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402336322] [2024-11-02 11:25:29,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402336322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:25:29,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:25:29,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-02 11:25:29,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560289463] [2024-11-02 11:25:29,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:25:29,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 11:25:29,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:25:29,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 11:25:29,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 11:25:29,784 INFO L87 Difference]: Start difference. First operand has 8170 states, 8165 states have (on average 3.6782608695652175) internal successors, (30033), 8169 states have internal predecessors, (30033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:25:30,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:25:30,225 INFO L93 Difference]: Finished difference Result 9794 states and 35590 transitions. [2024-11-02 11:25:30,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 11:25:30,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2024-11-02 11:25:30,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:25:30,325 INFO L225 Difference]: With dead ends: 9794 [2024-11-02 11:25:30,325 INFO L226 Difference]: Without dead ends: 6698 [2024-11-02 11:25:30,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 11:25:30,343 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 26 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 11:25:30,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 37 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 11:25:30,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6698 states. [2024-11-02 11:25:30,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6698 to 6698. [2024-11-02 11:25:30,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6698 states, 6696 states have (on average 3.5249402628434887) internal successors, (23603), 6697 states have internal predecessors, (23603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:25:30,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6698 states to 6698 states and 23603 transitions. [2024-11-02 11:25:30,905 INFO L78 Accepts]: Start accepts. Automaton has 6698 states and 23603 transitions. Word has length 4 [2024-11-02 11:25:30,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:25:30,906 INFO L471 AbstractCegarLoop]: Abstraction has 6698 states and 23603 transitions. [2024-11-02 11:25:30,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:25:30,908 INFO L276 IsEmpty]: Start isEmpty. Operand 6698 states and 23603 transitions. [2024-11-02 11:25:30,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-02 11:25:30,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:25:30,923 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:25:30,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-02 11:25:30,924 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-02 11:25:30,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:25:30,925 INFO L85 PathProgramCache]: Analyzing trace with hash -796805383, now seen corresponding path program 1 times [2024-11-02 11:25:30,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:25:30,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077380937] [2024-11-02 11:25:30,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:25:30,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:25:30,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:25:31,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:25:31,050 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:25:31,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077380937] [2024-11-02 11:25:31,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077380937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:25:31,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:25:31,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-02 11:25:31,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211912796] [2024-11-02 11:25:31,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:25:31,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 11:25:31,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:25:31,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 11:25:31,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 11:25:31,056 INFO L87 Difference]: Start difference. First operand 6698 states and 23603 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 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) [2024-11-02 11:25:31,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:25:31,222 INFO L93 Difference]: Finished difference Result 6698 states and 23603 transitions. [2024-11-02 11:25:31,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 11:25:31,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 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 [2024-11-02 11:25:31,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:25:31,341 INFO L225 Difference]: With dead ends: 6698 [2024-11-02 11:25:31,341 INFO L226 Difference]: Without dead ends: 5186 [2024-11-02 11:25:31,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 11:25:31,350 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 24 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 11:25:31,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 18 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 11:25:31,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5186 states. [2024-11-02 11:25:31,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5186 to 5186. [2024-11-02 11:25:31,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5186 states, 5185 states have (on average 3.4962391513982642) internal successors, (18128), 5185 states have internal predecessors, (18128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:25:31,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5186 states to 5186 states and 18128 transitions. [2024-11-02 11:25:31,638 INFO L78 Accepts]: Start accepts. Automaton has 5186 states and 18128 transitions. Word has length 15 [2024-11-02 11:25:31,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:25:31,642 INFO L471 AbstractCegarLoop]: Abstraction has 5186 states and 18128 transitions. [2024-11-02 11:25:31,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 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) [2024-11-02 11:25:31,643 INFO L276 IsEmpty]: Start isEmpty. Operand 5186 states and 18128 transitions. [2024-11-02 11:25:31,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-02 11:25:31,648 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:25:31,648 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:25:31,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-02 11:25:31,648 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-02 11:25:31,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:25:31,653 INFO L85 PathProgramCache]: Analyzing trace with hash -796803957, now seen corresponding path program 1 times [2024-11-02 11:25:31,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:25:31,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218418931] [2024-11-02 11:25:31,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:25:31,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:25:31,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:25:32,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:25:32,069 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:25:32,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218418931] [2024-11-02 11:25:32,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218418931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:25:32,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:25:32,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-02 11:25:32,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334347827] [2024-11-02 11:25:32,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:25:32,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-02 11:25:32,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:25:32,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-02 11:25:32,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-02 11:25:32,074 INFO L87 Difference]: Start difference. First operand 5186 states and 18128 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 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) [2024-11-02 11:25:32,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:25:32,776 INFO L93 Difference]: Finished difference Result 10538 states and 36275 transitions. [2024-11-02 11:25:32,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-02 11:25:32,777 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 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 [2024-11-02 11:25:32,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:25:32,986 INFO L225 Difference]: With dead ends: 10538 [2024-11-02 11:25:32,989 INFO L226 Difference]: Without dead ends: 7186 [2024-11-02 11:25:33,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-02 11:25:33,009 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 89 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-02 11:25:33,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 138 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-02 11:25:33,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7186 states. [2024-11-02 11:25:33,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7186 to 5906. [2024-11-02 11:25:33,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5906 states, 5905 states have (on average 3.4374259102455547) internal successors, (20298), 5905 states have internal predecessors, (20298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:25:33,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5906 states to 5906 states and 20298 transitions. [2024-11-02 11:25:33,443 INFO L78 Accepts]: Start accepts. Automaton has 5906 states and 20298 transitions. Word has length 15 [2024-11-02 11:25:33,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:25:33,444 INFO L471 AbstractCegarLoop]: Abstraction has 5906 states and 20298 transitions. [2024-11-02 11:25:33,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 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) [2024-11-02 11:25:33,445 INFO L276 IsEmpty]: Start isEmpty. Operand 5906 states and 20298 transitions. [2024-11-02 11:25:33,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-02 11:25:33,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:25:33,453 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:25:33,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-02 11:25:33,453 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-02 11:25:33,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:25:33,454 INFO L85 PathProgramCache]: Analyzing trace with hash -991731798, now seen corresponding path program 1 times [2024-11-02 11:25:33,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:25:33,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323385590] [2024-11-02 11:25:33,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:25:33,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:25:33,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:25:33,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:25:33,809 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:25:33,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323385590] [2024-11-02 11:25:33,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323385590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:25:33,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:25:33,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-02 11:25:33,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856932512] [2024-11-02 11:25:33,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:25:33,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-02 11:25:33,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:25:33,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-02 11:25:33,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-02 11:25:33,813 INFO L87 Difference]: Start difference. First operand 5906 states and 20298 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:25:34,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:25:34,487 INFO L93 Difference]: Finished difference Result 7996 states and 27145 transitions. [2024-11-02 11:25:34,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-02 11:25:34,488 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-02 11:25:34,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:25:34,543 INFO L225 Difference]: With dead ends: 7996 [2024-11-02 11:25:34,543 INFO L226 Difference]: Without dead ends: 5866 [2024-11-02 11:25:34,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-02 11:25:34,553 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 121 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-02 11:25:34,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 134 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-02 11:25:34,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5866 states. [2024-11-02 11:25:34,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5866 to 4586. [2024-11-02 11:25:34,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4586 states, 4585 states have (on average 3.3967284623773173) internal successors, (15574), 4585 states have internal predecessors, (15574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:25:34,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4586 states to 4586 states and 15574 transitions. [2024-11-02 11:25:34,801 INFO L78 Accepts]: Start accepts. Automaton has 4586 states and 15574 transitions. Word has length 17 [2024-11-02 11:25:34,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:25:34,802 INFO L471 AbstractCegarLoop]: Abstraction has 4586 states and 15574 transitions. [2024-11-02 11:25:34,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:25:34,803 INFO L276 IsEmpty]: Start isEmpty. Operand 4586 states and 15574 transitions. [2024-11-02 11:25:34,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-02 11:25:34,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:25:34,814 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:25:34,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-02 11:25:34,815 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-02 11:25:34,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:25:34,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1383141816, now seen corresponding path program 1 times [2024-11-02 11:25:34,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:25:34,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78701742] [2024-11-02 11:25:34,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:25:34,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:25:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:25:35,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:25:35,181 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:25:35,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78701742] [2024-11-02 11:25:35,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78701742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:25:35,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:25:35,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-02 11:25:35,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394224558] [2024-11-02 11:25:35,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:25:35,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-02 11:25:35,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:25:35,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-02 11:25:35,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-02 11:25:35,186 INFO L87 Difference]: Start difference. First operand 4586 states and 15574 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:25:35,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:25:35,580 INFO L93 Difference]: Finished difference Result 5836 states and 19699 transitions. [2024-11-02 11:25:35,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-02 11:25:35,581 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-11-02 11:25:35,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:25:35,625 INFO L225 Difference]: With dead ends: 5836 [2024-11-02 11:25:35,625 INFO L226 Difference]: Without dead ends: 4436 [2024-11-02 11:25:35,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-02 11:25:35,632 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 63 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-02 11:25:35,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 105 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-02 11:25:35,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4436 states. [2024-11-02 11:25:35,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4436 to 4436. [2024-11-02 11:25:35,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4436 states, 4435 states have (on average 3.3830890642615556) internal successors, (15004), 4435 states have internal predecessors, (15004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:25:35,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4436 states to 4436 states and 15004 transitions. [2024-11-02 11:25:35,870 INFO L78 Accepts]: Start accepts. Automaton has 4436 states and 15004 transitions. Word has length 19 [2024-11-02 11:25:35,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:25:35,871 INFO L471 AbstractCegarLoop]: Abstraction has 4436 states and 15004 transitions. [2024-11-02 11:25:35,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:25:35,872 INFO L276 IsEmpty]: Start isEmpty. Operand 4436 states and 15004 transitions. [2024-11-02 11:25:35,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-02 11:25:35,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:25:35,885 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:25:35,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-02 11:25:35,886 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-02 11:25:35,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:25:35,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1821698521, now seen corresponding path program 1 times [2024-11-02 11:25:35,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:25:35,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54462283] [2024-11-02 11:25:35,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:25:35,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:25:35,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:25:36,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:25:36,196 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:25:36,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54462283] [2024-11-02 11:25:36,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54462283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:25:36,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:25:36,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-02 11:25:36,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779130137] [2024-11-02 11:25:36,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:25:36,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-02 11:25:36,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:25:36,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-02 11:25:36,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-02 11:25:36,200 INFO L87 Difference]: Start difference. First operand 4436 states and 15004 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:25:36,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:25:36,763 INFO L93 Difference]: Finished difference Result 6411 states and 21439 transitions. [2024-11-02 11:25:36,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-02 11:25:36,764 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-02 11:25:36,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:25:36,801 INFO L225 Difference]: With dead ends: 6411 [2024-11-02 11:25:36,801 INFO L226 Difference]: Without dead ends: 4961 [2024-11-02 11:25:36,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-02 11:25:36,809 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 95 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-02 11:25:36,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 152 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-02 11:25:36,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4961 states. [2024-11-02 11:25:37,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4961 to 3721. [2024-11-02 11:25:37,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3721 states, 3720 states have (on average 3.3728494623655916) internal successors, (12547), 3720 states have internal predecessors, (12547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:25:37,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3721 states to 3721 states and 12547 transitions. [2024-11-02 11:25:37,059 INFO L78 Accepts]: Start accepts. Automaton has 3721 states and 12547 transitions. Word has length 21 [2024-11-02 11:25:37,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:25:37,060 INFO L471 AbstractCegarLoop]: Abstraction has 3721 states and 12547 transitions. [2024-11-02 11:25:37,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:25:37,060 INFO L276 IsEmpty]: Start isEmpty. Operand 3721 states and 12547 transitions. [2024-11-02 11:25:37,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-02 11:25:37,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:25:37,072 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:25:37,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-02 11:25:37,073 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-02 11:25:37,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:25:37,074 INFO L85 PathProgramCache]: Analyzing trace with hash 727136829, now seen corresponding path program 1 times [2024-11-02 11:25:37,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:25:37,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728171380] [2024-11-02 11:25:37,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:25:37,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:25:37,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:25:37,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:25:37,316 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:25:37,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728171380] [2024-11-02 11:25:37,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728171380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:25:37,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:25:37,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-02 11:25:37,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872894703] [2024-11-02 11:25:37,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:25:37,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 11:25:37,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:25:37,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 11:25:37,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 11:25:37,319 INFO L87 Difference]: Start difference. First operand 3721 states and 12547 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:25:37,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:25:37,525 INFO L93 Difference]: Finished difference Result 5331 states and 17532 transitions. [2024-11-02 11:25:37,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 11:25:37,526 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-02 11:25:37,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:25:37,560 INFO L225 Difference]: With dead ends: 5331 [2024-11-02 11:25:37,560 INFO L226 Difference]: Without dead ends: 2836 [2024-11-02 11:25:37,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-02 11:25:37,573 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 59 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 11:25:37,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 42 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 11:25:37,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2836 states. [2024-11-02 11:25:37,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2836 to 2836. [2024-11-02 11:25:37,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2836 states, 2835 states have (on average 3.181305114638448) internal successors, (9019), 2835 states have internal predecessors, (9019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:25:37,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2836 states to 2836 states and 9019 transitions. [2024-11-02 11:25:37,706 INFO L78 Accepts]: Start accepts. Automaton has 2836 states and 9019 transitions. Word has length 22 [2024-11-02 11:25:37,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:25:37,707 INFO L471 AbstractCegarLoop]: Abstraction has 2836 states and 9019 transitions. [2024-11-02 11:25:37,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:25:37,708 INFO L276 IsEmpty]: Start isEmpty. Operand 2836 states and 9019 transitions. [2024-11-02 11:25:37,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-02 11:25:37,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:25:37,717 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:25:37,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-02 11:25:37,719 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-02 11:25:37,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:25:37,720 INFO L85 PathProgramCache]: Analyzing trace with hash -936483276, now seen corresponding path program 1 times [2024-11-02 11:25:37,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:25:37,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369893196] [2024-11-02 11:25:37,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:25:37,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:25:37,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:25:38,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:25:38,045 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:25:38,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369893196] [2024-11-02 11:25:38,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369893196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:25:38,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:25:38,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-02 11:25:38,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087934378] [2024-11-02 11:25:38,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:25:38,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-02 11:25:38,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:25:38,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-02 11:25:38,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-02 11:25:38,049 INFO L87 Difference]: Start difference. First operand 2836 states and 9019 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:25:38,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:25:38,297 INFO L93 Difference]: Finished difference Result 3360 states and 10459 transitions. [2024-11-02 11:25:38,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-02 11:25:38,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2024-11-02 11:25:38,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:25:38,321 INFO L225 Difference]: With dead ends: 3360 [2024-11-02 11:25:38,322 INFO L226 Difference]: Without dead ends: 1750 [2024-11-02 11:25:38,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-02 11:25:38,327 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 109 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 11:25:38,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 52 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 11:25:38,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1750 states. [2024-11-02 11:25:38,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1750 to 1742. [2024-11-02 11:25:38,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1742 states, 1741 states have (on average 2.9959793222286044) internal successors, (5216), 1741 states have internal predecessors, (5216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:25:38,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 5216 transitions. [2024-11-02 11:25:38,406 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 5216 transitions. Word has length 25 [2024-11-02 11:25:38,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:25:38,407 INFO L471 AbstractCegarLoop]: Abstraction has 1742 states and 5216 transitions. [2024-11-02 11:25:38,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:25:38,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 5216 transitions. [2024-11-02 11:25:38,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-02 11:25:38,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:25:38,414 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:25:38,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-02 11:25:38,414 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-02 11:25:38,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:25:38,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1987735336, now seen corresponding path program 1 times [2024-11-02 11:25:38,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:25:38,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937104902] [2024-11-02 11:25:38,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:25:38,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:25:38,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:25:39,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:25:39,879 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:25:39,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937104902] [2024-11-02 11:25:39,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937104902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:25:39,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:25:39,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-02 11:25:39,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545890448] [2024-11-02 11:25:39,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:25:39,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-02 11:25:39,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:25:39,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-02 11:25:39,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-02 11:25:39,881 INFO L87 Difference]: Start difference. First operand 1742 states and 5216 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:25:40,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:25:40,412 INFO L93 Difference]: Finished difference Result 3138 states and 9243 transitions. [2024-11-02 11:25:40,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-02 11:25:40,412 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-11-02 11:25:40,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:25:40,431 INFO L225 Difference]: With dead ends: 3138 [2024-11-02 11:25:40,432 INFO L226 Difference]: Without dead ends: 2624 [2024-11-02 11:25:40,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-02 11:25:40,435 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 77 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-02 11:25:40,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 292 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-02 11:25:40,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2624 states. [2024-11-02 11:25:40,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 1984. [2024-11-02 11:25:40,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1984 states, 1983 states have (on average 2.968229954614221) internal successors, (5886), 1983 states have internal predecessors, (5886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:25:40,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1984 states to 1984 states and 5886 transitions. [2024-11-02 11:25:40,553 INFO L78 Accepts]: Start accepts. Automaton has 1984 states and 5886 transitions. Word has length 28 [2024-11-02 11:25:40,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:25:40,553 INFO L471 AbstractCegarLoop]: Abstraction has 1984 states and 5886 transitions. [2024-11-02 11:25:40,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:25:40,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1984 states and 5886 transitions. [2024-11-02 11:25:40,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-02 11:25:40,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:25:40,561 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:25:40,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-02 11:25:40,562 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-02 11:25:40,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:25:40,563 INFO L85 PathProgramCache]: Analyzing trace with hash 74152780, now seen corresponding path program 2 times [2024-11-02 11:25:40,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:25:40,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435511374] [2024-11-02 11:25:40,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:25:40,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:25:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:25:40,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:25:40,941 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:25:40,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435511374] [2024-11-02 11:25:40,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435511374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:25:40,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:25:40,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-02 11:25:40,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347258269] [2024-11-02 11:25:40,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:25:40,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-02 11:25:40,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:25:40,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-02 11:25:40,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-02 11:25:40,943 INFO L87 Difference]: Start difference. First operand 1984 states and 5886 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:25:41,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:25:41,166 INFO L93 Difference]: Finished difference Result 2048 states and 6038 transitions. [2024-11-02 11:25:41,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-02 11:25:41,166 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-11-02 11:25:41,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:25:41,182 INFO L225 Difference]: With dead ends: 2048 [2024-11-02 11:25:41,183 INFO L226 Difference]: Without dead ends: 1306 [2024-11-02 11:25:41,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-02 11:25:41,186 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 125 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 11:25:41,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 44 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 11:25:41,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2024-11-02 11:25:41,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 1242. [2024-11-02 11:25:41,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1242 states, 1241 states have (on average 2.9685737308622078) internal successors, (3684), 1241 states have internal predecessors, (3684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:25:41,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 3684 transitions. [2024-11-02 11:25:41,232 INFO L78 Accepts]: Start accepts. Automaton has 1242 states and 3684 transitions. Word has length 28 [2024-11-02 11:25:41,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:25:41,233 INFO L471 AbstractCegarLoop]: Abstraction has 1242 states and 3684 transitions. [2024-11-02 11:25:41,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:25:41,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 3684 transitions. [2024-11-02 11:25:41,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-02 11:25:41,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:25:41,237 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:25:41,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-02 11:25:41,237 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-02 11:25:41,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:25:41,238 INFO L85 PathProgramCache]: Analyzing trace with hash -260235588, now seen corresponding path program 1 times [2024-11-02 11:25:41,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:25:41,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439193636] [2024-11-02 11:25:41,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:25:41,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:25:41,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:25:41,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:25:41,721 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:25:41,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439193636] [2024-11-02 11:25:41,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439193636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:25:41,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:25:41,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-02 11:25:41,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733234818] [2024-11-02 11:25:41,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:25:41,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-02 11:25:41,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:25:41,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-02 11:25:41,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-02 11:25:41,723 INFO L87 Difference]: Start difference. First operand 1242 states and 3684 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:25:41,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:25:41,977 INFO L93 Difference]: Finished difference Result 1786 states and 5262 transitions. [2024-11-02 11:25:41,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-02 11:25:41,977 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2024-11-02 11:25:41,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:25:41,993 INFO L225 Difference]: With dead ends: 1786 [2024-11-02 11:25:41,993 INFO L226 Difference]: Without dead ends: 1014 [2024-11-02 11:25:41,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-02 11:25:42,000 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 52 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 11:25:42,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 88 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 11:25:42,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2024-11-02 11:25:42,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 1014. [2024-11-02 11:25:42,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1014 states, 1013 states have (on average 2.884501480750247) internal successors, (2922), 1013 states have internal predecessors, (2922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:25:42,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 2922 transitions. [2024-11-02 11:25:42,039 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 2922 transitions. Word has length 33 [2024-11-02 11:25:42,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:25:42,040 INFO L471 AbstractCegarLoop]: Abstraction has 1014 states and 2922 transitions. [2024-11-02 11:25:42,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:25:42,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 2922 transitions. [2024-11-02 11:25:42,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-02 11:25:42,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:25:42,045 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:25:42,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-02 11:25:42,045 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-02 11:25:42,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:25:42,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1902111706, now seen corresponding path program 2 times [2024-11-02 11:25:42,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:25:42,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206556218] [2024-11-02 11:25:42,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:25:42,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:25:42,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:25:44,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:25:44,150 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:25:44,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206556218] [2024-11-02 11:25:44,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206556218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:25:44,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:25:44,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-02 11:25:44,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525218761] [2024-11-02 11:25:44,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:25:44,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-02 11:25:44,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:25:44,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-02 11:25:44,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-02 11:25:44,154 INFO L87 Difference]: Start difference. First operand 1014 states and 2922 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:25:44,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:25:44,771 INFO L93 Difference]: Finished difference Result 1528 states and 4314 transitions. [2024-11-02 11:25:44,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-02 11:25:44,771 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2024-11-02 11:25:44,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:25:44,789 INFO L225 Difference]: With dead ends: 1528 [2024-11-02 11:25:44,789 INFO L226 Difference]: Without dead ends: 1212 [2024-11-02 11:25:44,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-02 11:25:44,791 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 63 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-02 11:25:44,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 227 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-02 11:25:44,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2024-11-02 11:25:44,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 924. [2024-11-02 11:25:44,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 923 states have (on average 2.8732394366197185) internal successors, (2652), 923 states have internal predecessors, (2652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:25:44,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 2652 transitions. [2024-11-02 11:25:44,834 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 2652 transitions. Word has length 33 [2024-11-02 11:25:44,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:25:44,834 INFO L471 AbstractCegarLoop]: Abstraction has 924 states and 2652 transitions. [2024-11-02 11:25:44,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:25:44,835 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 2652 transitions. [2024-11-02 11:25:44,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-02 11:25:44,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:25:44,838 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:25:44,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-02 11:25:44,839 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-02 11:25:44,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:25:44,840 INFO L85 PathProgramCache]: Analyzing trace with hash -114211966, now seen corresponding path program 3 times [2024-11-02 11:25:44,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:25:44,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559844641] [2024-11-02 11:25:44,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:25:44,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:25:44,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-02 11:25:44,995 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-02 11:25:45,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-02 11:25:45,215 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-02 11:25:45,215 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-02 11:25:45,217 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-02 11:25:45,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-02 11:25:45,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-02 11:25:45,221 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-02 11:25:45,221 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-02 11:25:45,221 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-02 11:25:45,221 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-02 11:25:45,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-02 11:25:45,226 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:25:45,363 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-02 11:25:45,364 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-02 11:25:45,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 11:25:45 BasicIcfg [2024-11-02 11:25:45,368 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-02 11:25:45,368 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-02 11:25:45,369 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-02 11:25:45,369 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-02 11:25:45,370 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 11:25:28" (3/4) ... [2024-11-02 11:25:45,372 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-02 11:25:45,374 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-02 11:25:45,375 INFO L158 Benchmark]: Toolchain (without parser) took 19423.01ms. Allocated memory was 144.7MB in the beginning and 1.0GB in the end (delta: 887.1MB). Free memory was 104.3MB in the beginning and 409.2MB in the end (delta: -304.9MB). Peak memory consumption was 584.3MB. Max. memory is 16.1GB. [2024-11-02 11:25:45,375 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 107.0MB. Free memory is still 79.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-02 11:25:45,376 INFO L158 Benchmark]: CACSL2BoogieTranslator took 821.94ms. Allocated memory is still 144.7MB. Free memory was 103.7MB in the beginning and 77.5MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-02 11:25:45,376 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.44ms. Allocated memory is still 144.7MB. Free memory was 77.5MB in the beginning and 74.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-02 11:25:45,377 INFO L158 Benchmark]: Boogie Preprocessor took 55.76ms. Allocated memory is still 144.7MB. Free memory was 74.9MB in the beginning and 73.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-02 11:25:45,377 INFO L158 Benchmark]: RCFGBuilder took 1101.05ms. Allocated memory is still 144.7MB. Free memory was 73.3MB in the beginning and 77.3MB in the end (delta: -3.9MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. [2024-11-02 11:25:45,378 INFO L158 Benchmark]: TraceAbstraction took 17344.73ms. Allocated memory was 144.7MB in the beginning and 1.0GB in the end (delta: 887.1MB). Free memory was 76.4MB in the beginning and 409.2MB in the end (delta: -332.8MB). Peak memory consumption was 555.0MB. Max. memory is 16.1GB. [2024-11-02 11:25:45,378 INFO L158 Benchmark]: Witness Printer took 5.84ms. Allocated memory is still 1.0GB. Free memory is still 409.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-02 11:25:45,380 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 107.0MB. Free memory is still 79.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 821.94ms. Allocated memory is still 144.7MB. Free memory was 103.7MB in the beginning and 77.5MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.44ms. Allocated memory is still 144.7MB. Free memory was 77.5MB in the beginning and 74.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.76ms. Allocated memory is still 144.7MB. Free memory was 74.9MB in the beginning and 73.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1101.05ms. Allocated memory is still 144.7MB. Free memory was 73.3MB in the beginning and 77.3MB in the end (delta: -3.9MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. * TraceAbstraction took 17344.73ms. Allocated memory was 144.7MB in the beginning and 1.0GB in the end (delta: 887.1MB). Free memory was 76.4MB in the beginning and 409.2MB in the end (delta: -332.8MB). Peak memory consumption was 555.0MB. Max. memory is 16.1GB. * Witness Printer took 5.84ms. Allocated memory is still 1.0GB. Free memory is still 409.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool a$flush_delayed; [L721] 0 int a$mem_tmp; [L722] 0 _Bool a$r_buff0_thd0; [L723] 0 _Bool a$r_buff0_thd1; [L724] 0 _Bool a$r_buff0_thd2; [L725] 0 _Bool a$r_buff0_thd3; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$read_delayed; [L731] 0 int *a$read_delayed_var; [L732] 0 int a$w_buff0; [L733] 0 _Bool a$w_buff0_used; [L734] 0 int a$w_buff1; [L735] 0 _Bool a$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L848] 0 pthread_t t633; [L849] FCALL, FORK 0 pthread_create(&t633, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t633=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L749] 1 a$w_buff1 = a$w_buff0 [L750] 1 a$w_buff0 = 1 [L751] 1 a$w_buff1_used = a$w_buff0_used [L752] 1 a$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L754] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L755] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L756] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L757] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L764] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L767] 1 __unbuffered_p0_EBX = y VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L850] 0 pthread_t t634; [L851] FCALL, FORK 0 pthread_create(&t634, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t633=-1, t634=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L852] 0 pthread_t t635; [L853] FCALL, FORK 0 pthread_create(&t635, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t633=-1, t634=0, t635=1, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L787] 2 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L804] 3 z = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L807] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 a$flush_delayed = weak$$choice2 [L813] 3 a$mem_tmp = a [L814] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L815] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L816] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L817] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L818] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L820] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 __unbuffered_p2_EBX = a [L822] 3 a = a$flush_delayed ? a$mem_tmp : a [L823] 3 a$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=2] [L826] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L827] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L828] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L829] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L830] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=2] [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=2] [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=2] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=2] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t633=-1, t634=0, t635=1, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=2] [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 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L860] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L861] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L862] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L863] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t633=-1, t634=0, t635=1, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=2] [L866] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t633=-1, t634=0, t635=1, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=2] [L868] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=2] [L17] 0 __assert_fail ("0", "mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 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: 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 7 procedures, 74 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 17.0s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 903 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 903 mSDsluCounter, 1329 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 956 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1734 IncrementalHoareTripleChecker+Invalid, 1761 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 373 mSDtfsCounter, 1734 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8170occurred in iteration=0, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 4800 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 293 NumberOfCodeBlocks, 293 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 248 ConstructedInterpolants, 0 QuantifiedInterpolants, 1689 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-02 11:25:45,420 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b19570-5ebc-42d2-9675-a684ba1d9031/bin/utaipan-verify-DbMuA5NWw2/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b19570-5ebc-42d2-9675-a684ba1d9031/bin/utaipan-verify-DbMuA5NWw2/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b19570-5ebc-42d2-9675-a684ba1d9031/bin/utaipan-verify-DbMuA5NWw2/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b19570-5ebc-42d2-9675-a684ba1d9031/bin/utaipan-verify-DbMuA5NWw2/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b19570-5ebc-42d2-9675-a684ba1d9031/bin/utaipan-verify-DbMuA5NWw2/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b19570-5ebc-42d2-9675-a684ba1d9031/bin/utaipan-verify-DbMuA5NWw2/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b19570-5ebc-42d2-9675-a684ba1d9031/bin/utaipan-verify-DbMuA5NWw2 --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 87c512ff7772c648d2c2d28b30bf4d136366c31440eeddc6ab833b392d36d780 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-11-02 11:25:48,123 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-02 11:25:48,231 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b19570-5ebc-42d2-9675-a684ba1d9031/bin/utaipan-verify-DbMuA5NWw2/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2024-11-02 11:25:48,238 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-02 11:25:48,239 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-02 11:25:48,291 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-02 11:25:48,292 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-02 11:25:48,292 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-02 11:25:48,293 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-02 11:25:48,295 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-02 11:25:48,296 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-02 11:25:48,297 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-02 11:25:48,297 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-02 11:25:48,297 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-02 11:25:48,298 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-02 11:25:48,298 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-02 11:25:48,298 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-02 11:25:48,299 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-02 11:25:48,299 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-02 11:25:48,299 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-02 11:25:48,300 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-02 11:25:48,304 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-02 11:25:48,304 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-02 11:25:48,305 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-02 11:25:48,305 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-02 11:25:48,305 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-02 11:25:48,306 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-02 11:25:48,306 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-02 11:25:48,306 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-02 11:25:48,306 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-02 11:25:48,308 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-02 11:25:48,308 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-02 11:25:48,309 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-02 11:25:48,309 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-02 11:25:48,309 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-02 11:25:48,309 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-02 11:25:48,310 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-02 11:25:48,311 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-02 11:25:48,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-02 11:25:48,311 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-02 11:25:48,312 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-02 11:25:48,312 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-02 11:25:48,312 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-02 11:25:48,312 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-02 11:25:48,313 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-02 11:25:48,313 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-02 11:25:48,313 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_b6b19570-5ebc-42d2-9675-a684ba1d9031/bin/utaipan-verify-DbMuA5NWw2/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_b6b19570-5ebc-42d2-9675-a684ba1d9031/bin/utaipan-verify-DbMuA5NWw2 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 -> 87c512ff7772c648d2c2d28b30bf4d136366c31440eeddc6ab833b392d36d780 [2024-11-02 11:25:48,709 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-02 11:25:48,754 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-02 11:25:48,766 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-02 11:25:48,771 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-02 11:25:48,773 INFO L274 PluginConnector]: CDTParser initialized [2024-11-02 11:25:48,775 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b19570-5ebc-42d2-9675-a684ba1d9031/bin/utaipan-verify-DbMuA5NWw2/../../sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i Unable to find full path for "g++" [2024-11-02 11:25:51,043 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-02 11:25:51,371 INFO L384 CDTParser]: Found 1 translation units. [2024-11-02 11:25:51,371 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b19570-5ebc-42d2-9675-a684ba1d9031/sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2024-11-02 11:25:51,388 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b19570-5ebc-42d2-9675-a684ba1d9031/bin/utaipan-verify-DbMuA5NWw2/data/bfb1eaf6e/93d037436a1a4465b94194088a621049/FLAG39301c122 [2024-11-02 11:25:51,614 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b19570-5ebc-42d2-9675-a684ba1d9031/bin/utaipan-verify-DbMuA5NWw2/data/bfb1eaf6e/93d037436a1a4465b94194088a621049 [2024-11-02 11:25:51,616 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-02 11:25:51,618 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-02 11:25:51,619 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-02 11:25:51,619 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-02 11:25:51,625 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-02 11:25:51,627 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 11:25:51" (1/1) ... [2024-11-02 11:25:51,628 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12e29413 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:25:51, skipping insertion in model container [2024-11-02 11:25:51,628 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 11:25:51" (1/1) ... [2024-11-02 11:25:51,700 INFO L175 MainTranslator]: Built tables and reachable declarations