./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe018_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe018_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2ca99869d70e44347287c08401504e0aa96889a44ad1dcfb8d04f6de3849ab47 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-22 00:14:04,231 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 00:14:04,234 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 00:14:04,259 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 00:14:04,259 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 00:14:04,260 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 00:14:04,261 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 00:14:04,263 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 00:14:04,265 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 00:14:04,265 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 00:14:04,266 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 00:14:04,268 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 00:14:04,268 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 00:14:04,269 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 00:14:04,270 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 00:14:04,271 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 00:14:04,272 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 00:14:04,273 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 00:14:04,274 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 00:14:04,276 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 00:14:04,277 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 00:14:04,279 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 00:14:04,284 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 00:14:04,285 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 00:14:04,294 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 00:14:04,294 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 00:14:04,294 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 00:14:04,295 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 00:14:04,296 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 00:14:04,297 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 00:14:04,297 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 00:14:04,302 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 00:14:04,303 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 00:14:04,304 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 00:14:04,305 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 00:14:04,305 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 00:14:04,306 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 00:14:04,308 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 00:14:04,308 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 00:14:04,309 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 00:14:04,311 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 00:14:04,312 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-22 00:14:04,347 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 00:14:04,352 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 00:14:04,353 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 00:14:04,353 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 00:14:04,354 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 00:14:04,354 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 00:14:04,354 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 00:14:04,355 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 00:14:04,355 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 00:14:04,355 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 00:14:04,356 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 00:14:04,356 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 00:14:04,357 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 00:14:04,357 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 00:14:04,357 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 00:14:04,357 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 00:14:04,357 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 00:14:04,358 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 00:14:04,358 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-22 00:14:04,359 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-22 00:14:04,359 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 00:14:04,359 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 00:14:04,359 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 00:14:04,360 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 00:14:04,360 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 00:14:04,360 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 00:14:04,360 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-22 00:14:04,360 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-22 00:14:04,361 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-22 00:14:04,361 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 00:14:04,361 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-22 00:14:04,361 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 00:14:04,362 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 00:14:04,362 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 00:14:04,362 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 00:14:04,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 00:14:04,363 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 00:14:04,363 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 00:14:04,363 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 00:14:04,363 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 00:14:04,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 00:14:04,364 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 00:14:04,364 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/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_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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 -> 2ca99869d70e44347287c08401504e0aa96889a44ad1dcfb8d04f6de3849ab47 [2022-11-22 00:14:04,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 00:14:04,666 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 00:14:04,668 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 00:14:04,670 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 00:14:04,670 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 00:14:04,672 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/pthread-wmm/safe018_rmo.opt.i [2022-11-22 00:14:07,948 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 00:14:08,210 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 00:14:08,215 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/sv-benchmarks/c/pthread-wmm/safe018_rmo.opt.i [2022-11-22 00:14:08,233 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/data/a83288107/edfb643fb94640e19c7032993beb2996/FLAG3fea71b45 [2022-11-22 00:14:08,251 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/data/a83288107/edfb643fb94640e19c7032993beb2996 [2022-11-22 00:14:08,257 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 00:14:08,259 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 00:14:08,262 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 00:14:08,262 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 00:14:08,266 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 00:14:08,267 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:14:08" (1/1) ... [2022-11-22 00:14:08,268 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f000f07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:14:08, skipping insertion in model container [2022-11-22 00:14:08,268 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:14:08" (1/1) ... [2022-11-22 00:14:08,276 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 00:14:08,354 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 00:14:08,580 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/sv-benchmarks/c/pthread-wmm/safe018_rmo.opt.i[992,1005] [2022-11-22 00:14:08,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 00:14:08,886 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 00:14:08,906 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/sv-benchmarks/c/pthread-wmm/safe018_rmo.opt.i[992,1005] [2022-11-22 00:14:08,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 00:14:09,030 INFO L208 MainTranslator]: Completed translation [2022-11-22 00:14:09,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:14:09 WrapperNode [2022-11-22 00:14:09,031 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 00:14:09,032 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 00:14:09,032 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 00:14:09,032 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 00:14:09,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:14:09" (1/1) ... [2022-11-22 00:14:09,057 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:14:09" (1/1) ... [2022-11-22 00:14:09,079 INFO L138 Inliner]: procedures = 176, calls = 73, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 136 [2022-11-22 00:14:09,080 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 00:14:09,080 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 00:14:09,081 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 00:14:09,081 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 00:14:09,090 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:14:09" (1/1) ... [2022-11-22 00:14:09,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:14:09" (1/1) ... [2022-11-22 00:14:09,095 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:14:09" (1/1) ... [2022-11-22 00:14:09,095 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:14:09" (1/1) ... [2022-11-22 00:14:09,107 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:14:09" (1/1) ... [2022-11-22 00:14:09,109 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:14:09" (1/1) ... [2022-11-22 00:14:09,112 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:14:09" (1/1) ... [2022-11-22 00:14:09,114 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:14:09" (1/1) ... [2022-11-22 00:14:09,118 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 00:14:09,119 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 00:14:09,119 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 00:14:09,119 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 00:14:09,120 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:14:09" (1/1) ... [2022-11-22 00:14:09,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 00:14:09,139 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:14:09,153 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 00:14:09,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 00:14:09,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-22 00:14:09,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-22 00:14:09,211 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-22 00:14:09,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 00:14:09,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-22 00:14:09,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 00:14:09,212 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-22 00:14:09,212 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-22 00:14:09,212 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-22 00:14:09,212 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-22 00:14:09,212 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-22 00:14:09,213 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-22 00:14:09,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 00:14:09,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-22 00:14:09,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 00:14:09,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 00:14:09,215 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-22 00:14:09,433 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 00:14:09,435 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 00:14:10,152 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 00:14:10,663 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 00:14:10,663 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-22 00:14:10,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:14:10 BoogieIcfgContainer [2022-11-22 00:14:10,666 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 00:14:10,669 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 00:14:10,669 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 00:14:10,672 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 00:14:10,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:14:08" (1/3) ... [2022-11-22 00:14:10,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9cf2d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:14:10, skipping insertion in model container [2022-11-22 00:14:10,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:14:09" (2/3) ... [2022-11-22 00:14:10,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9cf2d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:14:10, skipping insertion in model container [2022-11-22 00:14:10,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:14:10" (3/3) ... [2022-11-22 00:14:10,681 INFO L112 eAbstractionObserver]: Analyzing ICFG safe018_rmo.opt.i [2022-11-22 00:14:10,703 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 00:14:10,704 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 48 error locations. [2022-11-22 00:14:10,704 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-22 00:14:10,857 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-22 00:14:10,900 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-22 00:14:10,919 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 189 places, 181 transitions, 377 flow [2022-11-22 00:14:10,924 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 189 places, 181 transitions, 377 flow [2022-11-22 00:14:10,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 189 places, 181 transitions, 377 flow [2022-11-22 00:14:11,056 INFO L130 PetriNetUnfolder]: 2/178 cut-off events. [2022-11-22 00:14:11,056 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-22 00:14:11,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 178 events. 2/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 254 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 117. Up to 2 conditions per place. [2022-11-22 00:14:11,075 INFO L119 LiptonReduction]: Number of co-enabled transitions 7128 [2022-11-22 00:14:27,451 INFO L134 LiptonReduction]: Checked pairs total: 28841 [2022-11-22 00:14:27,451 INFO L136 LiptonReduction]: Total number of compositions: 170 [2022-11-22 00:14:27,460 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 85 places, 76 transitions, 167 flow [2022-11-22 00:14:29,466 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 51276 states, 37144 states have (on average 5.206951324574629) internal successors, (193407), 51275 states have internal predecessors, (193407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:14:29,505 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 00:14:29,511 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@64f4588e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 00:14:29,512 INFO L358 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2022-11-22 00:14:29,606 INFO L276 IsEmpty]: Start isEmpty. Operand has 51276 states, 37144 states have (on average 5.206951324574629) internal successors, (193407), 51275 states have internal predecessors, (193407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:14:29,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-22 00:14:29,611 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:14:29,612 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-22 00:14:29,613 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-22 00:14:29,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:14:29,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1033, now seen corresponding path program 1 times [2022-11-22 00:14:29,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:14:29,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721977190] [2022-11-22 00:14:29,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:14:29,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:14:29,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:14:29,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:14:29,785 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:14:29,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721977190] [2022-11-22 00:14:29,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721977190] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:14:29,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:14:29,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-22 00:14:29,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831238210] [2022-11-22 00:14:29,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:14:29,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-22 00:14:29,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:14:29,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-22 00:14:29,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-22 00:14:29,889 INFO L87 Difference]: Start difference. First operand has 51276 states, 37144 states have (on average 5.206951324574629) internal successors, (193407), 51275 states have internal predecessors, (193407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:14:30,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:14:30,267 INFO L93 Difference]: Finished difference Result 10092 states and 35895 transitions. [2022-11-22 00:14:30,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-22 00:14:30,269 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-11-22 00:14:30,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:14:30,494 INFO L225 Difference]: With dead ends: 10092 [2022-11-22 00:14:30,495 INFO L226 Difference]: Without dead ends: 10092 [2022-11-22 00:14:30,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-22 00:14:30,499 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:14:30,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:14:30,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10092 states. [2022-11-22 00:14:31,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10092 to 10092. [2022-11-22 00:14:31,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10092 states, 8770 states have (on average 4.092930444697833) internal successors, (35895), 10091 states have internal predecessors, (35895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:14:31,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10092 states to 10092 states and 35895 transitions. [2022-11-22 00:14:31,155 INFO L78 Accepts]: Start accepts. Automaton has 10092 states and 35895 transitions. Word has length 1 [2022-11-22 00:14:31,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:14:31,156 INFO L495 AbstractCegarLoop]: Abstraction has 10092 states and 35895 transitions. [2022-11-22 00:14:31,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:14:31,156 INFO L276 IsEmpty]: Start isEmpty. Operand 10092 states and 35895 transitions. [2022-11-22 00:14:31,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-22 00:14:31,157 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:14:31,157 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-22 00:14:31,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 00:14:31,158 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-22 00:14:31,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:14:31,158 INFO L85 PathProgramCache]: Analyzing trace with hash 31571177, now seen corresponding path program 1 times [2022-11-22 00:14:31,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:14:31,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928759693] [2022-11-22 00:14:31,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:14:31,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:14:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:14:31,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:14:31,395 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:14:31,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928759693] [2022-11-22 00:14:31,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928759693] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:14:31,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:14:31,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 00:14:31,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839172551] [2022-11-22 00:14:31,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:14:31,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:14:31,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:14:31,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:14:31,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:14:31,398 INFO L87 Difference]: Start difference. First operand 10092 states and 35895 transitions. 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) [2022-11-22 00:14:31,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:14:31,728 INFO L93 Difference]: Finished difference Result 7506 states and 24185 transitions. [2022-11-22 00:14:31,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:14:31,736 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 [2022-11-22 00:14:31,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:14:31,819 INFO L225 Difference]: With dead ends: 7506 [2022-11-22 00:14:31,820 INFO L226 Difference]: Without dead ends: 7502 [2022-11-22 00:14:31,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:14:31,821 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 28 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:14:31,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 2 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:14:31,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7502 states. [2022-11-22 00:14:32,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7502 to 6614. [2022-11-22 00:14:32,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6614 states, 6161 states have (on average 3.733971757831521) internal successors, (23005), 6613 states have internal predecessors, (23005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:14:32,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6614 states to 6614 states and 23005 transitions. [2022-11-22 00:14:32,219 INFO L78 Accepts]: Start accepts. Automaton has 6614 states and 23005 transitions. Word has length 4 [2022-11-22 00:14:32,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:14:32,220 INFO L495 AbstractCegarLoop]: Abstraction has 6614 states and 23005 transitions. [2022-11-22 00:14:32,220 INFO L496 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) [2022-11-22 00:14:32,220 INFO L276 IsEmpty]: Start isEmpty. Operand 6614 states and 23005 transitions. [2022-11-22 00:14:32,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-22 00:14:32,221 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:14:32,221 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-22 00:14:32,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 00:14:32,222 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-22 00:14:32,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:14:32,222 INFO L85 PathProgramCache]: Analyzing trace with hash 31571178, now seen corresponding path program 1 times [2022-11-22 00:14:32,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:14:32,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773788515] [2022-11-22 00:14:32,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:14:32,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:14:32,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:14:32,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:14:32,431 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:14:32,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773788515] [2022-11-22 00:14:32,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773788515] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:14:32,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:14:32,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 00:14:32,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204189622] [2022-11-22 00:14:32,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:14:32,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:14:32,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:14:32,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:14:32,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:14:32,436 INFO L87 Difference]: Start difference. First operand 6614 states and 23005 transitions. 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) [2022-11-22 00:14:32,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:14:32,564 INFO L93 Difference]: Finished difference Result 2394 states and 7373 transitions. [2022-11-22 00:14:32,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:14:32,564 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 [2022-11-22 00:14:32,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:14:32,578 INFO L225 Difference]: With dead ends: 2394 [2022-11-22 00:14:32,579 INFO L226 Difference]: Without dead ends: 2328 [2022-11-22 00:14:32,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:14:32,583 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:14:32,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:14:32,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2328 states. [2022-11-22 00:14:32,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2328 to 2328. [2022-11-22 00:14:32,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2328 states, 2262 states have (on average 3.163129973474801) internal successors, (7155), 2327 states have internal predecessors, (7155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:14:32,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2328 states to 2328 states and 7155 transitions. [2022-11-22 00:14:32,754 INFO L78 Accepts]: Start accepts. Automaton has 2328 states and 7155 transitions. Word has length 4 [2022-11-22 00:14:32,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:14:32,756 INFO L495 AbstractCegarLoop]: Abstraction has 2328 states and 7155 transitions. [2022-11-22 00:14:32,756 INFO L496 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) [2022-11-22 00:14:32,757 INFO L276 IsEmpty]: Start isEmpty. Operand 2328 states and 7155 transitions. [2022-11-22 00:14:32,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-22 00:14:32,758 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:14:32,758 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:14:32,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 00:14:32,759 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-22 00:14:32,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:14:32,760 INFO L85 PathProgramCache]: Analyzing trace with hash -165295603, now seen corresponding path program 1 times [2022-11-22 00:14:32,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:14:32,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995710373] [2022-11-22 00:14:32,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:14:32,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:14:32,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:14:32,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:14:32,971 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:14:32,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995710373] [2022-11-22 00:14:32,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995710373] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:14:32,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:14:32,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 00:14:32,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841504551] [2022-11-22 00:14:32,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:14:32,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:14:32,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:14:32,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:14:32,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:14:32,974 INFO L87 Difference]: Start difference. First operand 2328 states and 7155 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:14:33,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:14:33,116 INFO L93 Difference]: Finished difference Result 2296 states and 7043 transitions. [2022-11-22 00:14:33,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:14:33,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-11-22 00:14:33,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:14:33,128 INFO L225 Difference]: With dead ends: 2296 [2022-11-22 00:14:33,128 INFO L226 Difference]: Without dead ends: 2296 [2022-11-22 00:14:33,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:14:33,130 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 18 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:14:33,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 2 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:14:33,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2296 states. [2022-11-22 00:14:33,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2296 to 2296. [2022-11-22 00:14:33,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2296 states, 2230 states have (on average 3.1582959641255606) internal successors, (7043), 2295 states have internal predecessors, (7043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:14:33,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2296 states to 2296 states and 7043 transitions. [2022-11-22 00:14:33,200 INFO L78 Accepts]: Start accepts. Automaton has 2296 states and 7043 transitions. Word has length 10 [2022-11-22 00:14:33,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:14:33,201 INFO L495 AbstractCegarLoop]: Abstraction has 2296 states and 7043 transitions. [2022-11-22 00:14:33,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:14:33,201 INFO L276 IsEmpty]: Start isEmpty. Operand 2296 states and 7043 transitions. [2022-11-22 00:14:33,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-22 00:14:33,203 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:14:33,203 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:14:33,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 00:14:33,203 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-22 00:14:33,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:14:33,204 INFO L85 PathProgramCache]: Analyzing trace with hash -829275504, now seen corresponding path program 1 times [2022-11-22 00:14:33,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:14:33,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376679893] [2022-11-22 00:14:33,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:14:33,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:14:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:14:33,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:14:33,298 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:14:33,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376679893] [2022-11-22 00:14:33,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376679893] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:14:33,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:14:33,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:14:33,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631940059] [2022-11-22 00:14:33,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:14:33,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:14:33,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:14:33,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:14:33,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:14:33,301 INFO L87 Difference]: Start difference. First operand 2296 states and 7043 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:14:33,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:14:33,445 INFO L93 Difference]: Finished difference Result 2636 states and 7855 transitions. [2022-11-22 00:14:33,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:14:33,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-11-22 00:14:33,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:14:33,458 INFO L225 Difference]: With dead ends: 2636 [2022-11-22 00:14:33,458 INFO L226 Difference]: Without dead ends: 2636 [2022-11-22 00:14:33,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:14:33,459 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 13 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:14:33,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:14:33,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2022-11-22 00:14:33,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2232. [2022-11-22 00:14:33,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2232 states, 2167 states have (on average 3.154130133825565) internal successors, (6835), 2231 states have internal predecessors, (6835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:14:33,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2232 states to 2232 states and 6835 transitions. [2022-11-22 00:14:33,527 INFO L78 Accepts]: Start accepts. Automaton has 2232 states and 6835 transitions. Word has length 11 [2022-11-22 00:14:33,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:14:33,528 INFO L495 AbstractCegarLoop]: Abstraction has 2232 states and 6835 transitions. [2022-11-22 00:14:33,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:14:33,528 INFO L276 IsEmpty]: Start isEmpty. Operand 2232 states and 6835 transitions. [2022-11-22 00:14:33,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-22 00:14:33,529 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:14:33,529 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:14:33,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-22 00:14:33,530 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-22 00:14:33,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:14:33,530 INFO L85 PathProgramCache]: Analyzing trace with hash -829275503, now seen corresponding path program 1 times [2022-11-22 00:14:33,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:14:33,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589750232] [2022-11-22 00:14:33,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:14:33,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:14:33,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:14:33,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:14:33,844 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:14:33,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589750232] [2022-11-22 00:14:33,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589750232] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:14:33,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:14:33,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:14:33,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895929426] [2022-11-22 00:14:33,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:14:33,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:14:33,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:14:33,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:14:33,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:14:33,847 INFO L87 Difference]: Start difference. First operand 2232 states and 6835 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:14:33,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:14:33,998 INFO L93 Difference]: Finished difference Result 2168 states and 6627 transitions. [2022-11-22 00:14:33,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:14:33,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-11-22 00:14:33,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:14:34,007 INFO L225 Difference]: With dead ends: 2168 [2022-11-22 00:14:34,008 INFO L226 Difference]: Without dead ends: 2168 [2022-11-22 00:14:34,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:14:34,011 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:14:34,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 1 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:14:34,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2168 states. [2022-11-22 00:14:34,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2168 to 2168. [2022-11-22 00:14:34,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2168 states, 2104 states have (on average 3.1497148288973382) internal successors, (6627), 2167 states have internal predecessors, (6627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:14:34,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2168 states to 2168 states and 6627 transitions. [2022-11-22 00:14:34,070 INFO L78 Accepts]: Start accepts. Automaton has 2168 states and 6627 transitions. Word has length 11 [2022-11-22 00:14:34,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:14:34,071 INFO L495 AbstractCegarLoop]: Abstraction has 2168 states and 6627 transitions. [2022-11-22 00:14:34,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:14:34,071 INFO L276 IsEmpty]: Start isEmpty. Operand 2168 states and 6627 transitions. [2022-11-22 00:14:34,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-22 00:14:34,072 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:14:34,072 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:14:34,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-22 00:14:34,073 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-22 00:14:34,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:14:34,073 INFO L85 PathProgramCache]: Analyzing trace with hash -829199843, now seen corresponding path program 1 times [2022-11-22 00:14:34,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:14:34,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762908002] [2022-11-22 00:14:34,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:14:34,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:14:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:14:34,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:14:34,214 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:14:34,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762908002] [2022-11-22 00:14:34,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762908002] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:14:34,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:14:34,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 00:14:34,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746104384] [2022-11-22 00:14:34,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:14:34,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:14:34,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:14:34,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:14:34,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:14:34,217 INFO L87 Difference]: Start difference. First operand 2168 states and 6627 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:14:34,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:14:34,340 INFO L93 Difference]: Finished difference Result 2148 states and 6556 transitions. [2022-11-22 00:14:34,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:14:34,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-11-22 00:14:34,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:14:34,350 INFO L225 Difference]: With dead ends: 2148 [2022-11-22 00:14:34,350 INFO L226 Difference]: Without dead ends: 2148 [2022-11-22 00:14:34,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:14:34,351 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 18 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:14:34,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 2 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:14:34,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2022-11-22 00:14:34,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 2148. [2022-11-22 00:14:34,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2148 states, 2084 states have (on average 3.145873320537428) internal successors, (6556), 2147 states have internal predecessors, (6556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:14:34,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2148 states to 2148 states and 6556 transitions. [2022-11-22 00:14:34,409 INFO L78 Accepts]: Start accepts. Automaton has 2148 states and 6556 transitions. Word has length 11 [2022-11-22 00:14:34,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:14:34,409 INFO L495 AbstractCegarLoop]: Abstraction has 2148 states and 6556 transitions. [2022-11-22 00:14:34,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:14:34,410 INFO L276 IsEmpty]: Start isEmpty. Operand 2148 states and 6556 transitions. [2022-11-22 00:14:34,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-22 00:14:34,411 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:14:34,411 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:14:34,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-22 00:14:34,411 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-22 00:14:34,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:14:34,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1130098462, now seen corresponding path program 1 times [2022-11-22 00:14:34,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:14:34,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332773444] [2022-11-22 00:14:34,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:14:34,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:14:34,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:14:34,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:14:34,626 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:14:34,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332773444] [2022-11-22 00:14:34,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332773444] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:14:34,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:14:34,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:14:34,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785701343] [2022-11-22 00:14:34,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:14:34,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:14:34,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:14:34,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:14:34,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:14:34,629 INFO L87 Difference]: Start difference. First operand 2148 states and 6556 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:14:34,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:14:34,810 INFO L93 Difference]: Finished difference Result 3056 states and 9247 transitions. [2022-11-22 00:14:34,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:14:34,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-22 00:14:34,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:14:34,826 INFO L225 Difference]: With dead ends: 3056 [2022-11-22 00:14:34,826 INFO L226 Difference]: Without dead ends: 3056 [2022-11-22 00:14:34,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:14:34,827 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 61 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:14:34,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:14:34,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3056 states. [2022-11-22 00:14:34,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3056 to 2232. [2022-11-22 00:14:34,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2232 states, 2168 states have (on average 3.139760147601476) internal successors, (6807), 2231 states have internal predecessors, (6807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:14:34,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2232 states to 2232 states and 6807 transitions. [2022-11-22 00:14:34,915 INFO L78 Accepts]: Start accepts. Automaton has 2232 states and 6807 transitions. Word has length 12 [2022-11-22 00:14:34,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:14:34,916 INFO L495 AbstractCegarLoop]: Abstraction has 2232 states and 6807 transitions. [2022-11-22 00:14:34,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:14:34,916 INFO L276 IsEmpty]: Start isEmpty. Operand 2232 states and 6807 transitions. [2022-11-22 00:14:34,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-22 00:14:34,918 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:14:34,918 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:14:34,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-22 00:14:34,918 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-22 00:14:34,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:14:34,919 INFO L85 PathProgramCache]: Analyzing trace with hash 2002881896, now seen corresponding path program 1 times [2022-11-22 00:14:34,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:14:34,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66044341] [2022-11-22 00:14:34,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:14:34,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:14:34,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:14:35,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:14:35,100 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:14:35,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66044341] [2022-11-22 00:14:35,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66044341] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:14:35,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:14:35,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:14:35,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142025859] [2022-11-22 00:14:35,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:14:35,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:14:35,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:14:35,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:14:35,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:14:35,103 INFO L87 Difference]: Start difference. First operand 2232 states and 6807 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:14:35,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:14:35,262 INFO L93 Difference]: Finished difference Result 2126 states and 6112 transitions. [2022-11-22 00:14:35,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:14:35,262 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-11-22 00:14:35,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:14:35,272 INFO L225 Difference]: With dead ends: 2126 [2022-11-22 00:14:35,272 INFO L226 Difference]: Without dead ends: 2126 [2022-11-22 00:14:35,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:14:35,274 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 55 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:14:35,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:14:35,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2126 states. [2022-11-22 00:14:35,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2126 to 1866. [2022-11-22 00:14:35,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1866 states, 1802 states have (on average 3.107103218645949) internal successors, (5599), 1865 states have internal predecessors, (5599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:14:35,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 5599 transitions. [2022-11-22 00:14:35,340 INFO L78 Accepts]: Start accepts. Automaton has 1866 states and 5599 transitions. Word has length 13 [2022-11-22 00:14:35,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:14:35,341 INFO L495 AbstractCegarLoop]: Abstraction has 1866 states and 5599 transitions. [2022-11-22 00:14:35,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:14:35,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 5599 transitions. [2022-11-22 00:14:35,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-22 00:14:35,343 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:14:35,343 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:14:35,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-22 00:14:35,344 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-22 00:14:35,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:14:35,344 INFO L85 PathProgramCache]: Analyzing trace with hash -451183082, now seen corresponding path program 1 times [2022-11-22 00:14:35,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:14:35,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139254175] [2022-11-22 00:14:35,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:14:35,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:14:35,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:14:36,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:14:36,780 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:14:36,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139254175] [2022-11-22 00:14:36,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139254175] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:14:36,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:14:36,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 00:14:36,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900792513] [2022-11-22 00:14:36,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:14:36,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-22 00:14:36,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:14:36,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-22 00:14:36,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-22 00:14:36,783 INFO L87 Difference]: Start difference. First operand 1866 states and 5599 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:14:37,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:14:37,355 INFO L93 Difference]: Finished difference Result 1863 states and 5588 transitions. [2022-11-22 00:14:37,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-22 00:14:37,356 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-22 00:14:37,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:14:37,365 INFO L225 Difference]: With dead ends: 1863 [2022-11-22 00:14:37,365 INFO L226 Difference]: Without dead ends: 1863 [2022-11-22 00:14:37,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-11-22 00:14:37,367 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 61 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 00:14:37,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 9 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 00:14:37,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1863 states. [2022-11-22 00:14:37,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1863 to 1863. [2022-11-22 00:14:37,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1863 states, 1799 states have (on average 3.106170094496943) internal successors, (5588), 1862 states have internal predecessors, (5588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:14:37,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1863 states to 1863 states and 5588 transitions. [2022-11-22 00:14:37,429 INFO L78 Accepts]: Start accepts. Automaton has 1863 states and 5588 transitions. Word has length 14 [2022-11-22 00:14:37,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:14:37,429 INFO L495 AbstractCegarLoop]: Abstraction has 1863 states and 5588 transitions. [2022-11-22 00:14:37,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:14:37,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1863 states and 5588 transitions. [2022-11-22 00:14:37,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-22 00:14:37,431 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:14:37,432 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:14:37,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-22 00:14:37,432 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-22 00:14:37,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:14:37,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1959796211, now seen corresponding path program 1 times [2022-11-22 00:14:37,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:14:37,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711881100] [2022-11-22 00:14:37,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:14:37,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:14:37,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:14:37,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:14:37,753 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:14:37,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711881100] [2022-11-22 00:14:37,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711881100] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:14:37,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:14:37,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 00:14:37,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514180174] [2022-11-22 00:14:37,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:14:37,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-22 00:14:37,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:14:37,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-22 00:14:37,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-22 00:14:37,755 INFO L87 Difference]: Start difference. First operand 1863 states and 5588 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:14:38,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:14:38,080 INFO L93 Difference]: Finished difference Result 2508 states and 7329 transitions. [2022-11-22 00:14:38,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 00:14:38,081 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-22 00:14:38,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:14:38,092 INFO L225 Difference]: With dead ends: 2508 [2022-11-22 00:14:38,092 INFO L226 Difference]: Without dead ends: 2508 [2022-11-22 00:14:38,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-22 00:14:38,093 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 94 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 00:14:38,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 7 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 00:14:38,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2508 states. [2022-11-22 00:14:38,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2508 to 2090. [2022-11-22 00:14:38,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2090 states, 2026 states have (on average 3.068608094768016) internal successors, (6217), 2089 states have internal predecessors, (6217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:14:38,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 6217 transitions. [2022-11-22 00:14:38,167 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 6217 transitions. Word has length 14 [2022-11-22 00:14:38,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:14:38,168 INFO L495 AbstractCegarLoop]: Abstraction has 2090 states and 6217 transitions. [2022-11-22 00:14:38,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:14:38,168 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 6217 transitions. [2022-11-22 00:14:38,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-22 00:14:38,170 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:14:38,171 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:14:38,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-22 00:14:38,171 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-22 00:14:38,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:14:38,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1959796267, now seen corresponding path program 1 times [2022-11-22 00:14:38,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:14:38,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381928666] [2022-11-22 00:14:38,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:14:38,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:14:38,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:14:38,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:14:38,798 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:14:38,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381928666] [2022-11-22 00:14:38,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381928666] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:14:38,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:14:38,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 00:14:38,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288480482] [2022-11-22 00:14:38,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:14:38,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-22 00:14:38,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:14:38,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-22 00:14:38,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-22 00:14:38,800 INFO L87 Difference]: Start difference. First operand 2090 states and 6217 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:14:39,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:14:39,416 INFO L93 Difference]: Finished difference Result 2378 states and 7168 transitions. [2022-11-22 00:14:39,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 00:14:39,417 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-22 00:14:39,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:14:39,428 INFO L225 Difference]: With dead ends: 2378 [2022-11-22 00:14:39,428 INFO L226 Difference]: Without dead ends: 2330 [2022-11-22 00:14:39,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-22 00:14:39,430 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 49 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 00:14:39,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 17 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 00:14:39,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2330 states. [2022-11-22 00:14:39,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2330 to 2330. [2022-11-22 00:14:39,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2330 states, 2266 states have (on average 3.078552515445719) internal successors, (6976), 2329 states have internal predecessors, (6976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:14:39,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2330 states to 2330 states and 6976 transitions. [2022-11-22 00:14:39,506 INFO L78 Accepts]: Start accepts. Automaton has 2330 states and 6976 transitions. Word has length 14 [2022-11-22 00:14:39,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:14:39,506 INFO L495 AbstractCegarLoop]: Abstraction has 2330 states and 6976 transitions. [2022-11-22 00:14:39,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:14:39,507 INFO L276 IsEmpty]: Start isEmpty. Operand 2330 states and 6976 transitions. [2022-11-22 00:14:39,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-22 00:14:39,510 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:14:39,510 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:14:39,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-22 00:14:39,510 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-22 00:14:39,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:14:39,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1485784390, now seen corresponding path program 1 times [2022-11-22 00:14:39,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:14:39,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732086483] [2022-11-22 00:14:39,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:14:39,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:14:39,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:14:39,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:14:39,999 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:14:40,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732086483] [2022-11-22 00:14:40,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732086483] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:14:40,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:14:40,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 00:14:40,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360323307] [2022-11-22 00:14:40,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:14:40,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-22 00:14:40,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:14:40,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-22 00:14:40,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-22 00:14:40,001 INFO L87 Difference]: Start difference. First operand 2330 states and 6976 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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) [2022-11-22 00:14:40,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:14:40,534 INFO L93 Difference]: Finished difference Result 1980 states and 5836 transitions. [2022-11-22 00:14:40,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 00:14:40,535 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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 [2022-11-22 00:14:40,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:14:40,544 INFO L225 Difference]: With dead ends: 1980 [2022-11-22 00:14:40,544 INFO L226 Difference]: Without dead ends: 1932 [2022-11-22 00:14:40,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-22 00:14:40,546 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 66 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 00:14:40,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 16 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 00:14:40,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1932 states. [2022-11-22 00:14:40,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1932 to 1596. [2022-11-22 00:14:40,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1596 states, 1564 states have (on average 2.9130434782608696) internal successors, (4556), 1595 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:14:40,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 4556 transitions. [2022-11-22 00:14:40,585 INFO L78 Accepts]: Start accepts. Automaton has 1596 states and 4556 transitions. Word has length 15 [2022-11-22 00:14:40,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:14:40,587 INFO L495 AbstractCegarLoop]: Abstraction has 1596 states and 4556 transitions. [2022-11-22 00:14:40,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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) [2022-11-22 00:14:40,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 4556 transitions. [2022-11-22 00:14:40,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-22 00:14:40,589 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:14:40,589 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:14:40,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-22 00:14:40,590 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-22 00:14:40,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:14:40,590 INFO L85 PathProgramCache]: Analyzing trace with hash -502538056, now seen corresponding path program 1 times [2022-11-22 00:14:40,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:14:40,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001570530] [2022-11-22 00:14:40,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:14:40,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:14:40,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:14:40,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:14:40,840 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:14:40,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001570530] [2022-11-22 00:14:40,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001570530] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:14:40,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:14:40,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:14:40,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79309809] [2022-11-22 00:14:40,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:14:40,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:14:40,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:14:40,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:14:40,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:14:40,842 INFO L87 Difference]: Start difference. First operand 1596 states and 4556 transitions. Second operand has 3 states, 3 states have (on average 5.0) 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) [2022-11-22 00:14:40,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:14:40,940 INFO L93 Difference]: Finished difference Result 856 states and 2061 transitions. [2022-11-22 00:14:40,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:14:40,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) 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 [2022-11-22 00:14:40,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:14:40,943 INFO L225 Difference]: With dead ends: 856 [2022-11-22 00:14:40,943 INFO L226 Difference]: Without dead ends: 856 [2022-11-22 00:14:40,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:14:40,944 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 3 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:14:40,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:14:40,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2022-11-22 00:14:40,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 856. [2022-11-22 00:14:40,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 833 states have (on average 2.474189675870348) internal successors, (2061), 855 states have internal predecessors, (2061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:14:40,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 2061 transitions. [2022-11-22 00:14:40,962 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 2061 transitions. Word has length 15 [2022-11-22 00:14:40,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:14:40,963 INFO L495 AbstractCegarLoop]: Abstraction has 856 states and 2061 transitions. [2022-11-22 00:14:40,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) 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) [2022-11-22 00:14:40,963 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 2061 transitions. [2022-11-22 00:14:40,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 00:14:40,964 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:14:40,964 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:14:40,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-22 00:14:40,965 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-22 00:14:40,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:14:40,965 INFO L85 PathProgramCache]: Analyzing trace with hash 57435308, now seen corresponding path program 1 times [2022-11-22 00:14:40,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:14:40,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994567143] [2022-11-22 00:14:40,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:14:40,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:14:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:14:42,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:14:42,389 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:14:42,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994567143] [2022-11-22 00:14:42,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994567143] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:14:42,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:14:42,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-22 00:14:42,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984623355] [2022-11-22 00:14:42,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:14:42,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-22 00:14:42,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:14:42,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-22 00:14:42,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-22 00:14:42,391 INFO L87 Difference]: Start difference. First operand 856 states and 2061 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:14:42,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:14:42,916 INFO L93 Difference]: Finished difference Result 852 states and 2050 transitions. [2022-11-22 00:14:42,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-22 00:14:42,917 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-22 00:14:42,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:14:42,920 INFO L225 Difference]: With dead ends: 852 [2022-11-22 00:14:42,920 INFO L226 Difference]: Without dead ends: 852 [2022-11-22 00:14:42,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-11-22 00:14:42,925 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 87 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 00:14:42,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 9 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 00:14:42,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2022-11-22 00:14:42,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 852. [2022-11-22 00:14:42,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 829 states have (on average 2.4728588661037394) internal successors, (2050), 851 states have internal predecessors, (2050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:14:42,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 2050 transitions. [2022-11-22 00:14:42,943 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 2050 transitions. Word has length 16 [2022-11-22 00:14:42,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:14:42,944 INFO L495 AbstractCegarLoop]: Abstraction has 852 states and 2050 transitions. [2022-11-22 00:14:42,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:14:42,944 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 2050 transitions. [2022-11-22 00:14:42,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-22 00:14:42,945 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:14:42,946 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:14:42,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-22 00:14:42,946 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-22 00:14:42,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:14:42,947 INFO L85 PathProgramCache]: Analyzing trace with hash -282846625, now seen corresponding path program 1 times [2022-11-22 00:14:42,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:14:42,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751506252] [2022-11-22 00:14:42,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:14:42,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:14:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:14:43,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:14:43,172 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:14:43,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751506252] [2022-11-22 00:14:43,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751506252] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:14:43,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:14:43,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:14:43,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879497905] [2022-11-22 00:14:43,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:14:43,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:14:43,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:14:43,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:14:43,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:14:43,177 INFO L87 Difference]: Start difference. First operand 852 states and 2050 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:14:43,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:14:43,310 INFO L93 Difference]: Finished difference Result 373 states and 767 transitions. [2022-11-22 00:14:43,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:14:43,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-22 00:14:43,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:14:43,312 INFO L225 Difference]: With dead ends: 373 [2022-11-22 00:14:43,312 INFO L226 Difference]: Without dead ends: 373 [2022-11-22 00:14:43,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:14:43,313 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 27 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:14:43,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 3 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:14:43,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2022-11-22 00:14:43,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2022-11-22 00:14:43,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 365 states have (on average 2.1013698630136988) internal successors, (767), 372 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:14:43,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 767 transitions. [2022-11-22 00:14:43,320 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 767 transitions. Word has length 17 [2022-11-22 00:14:43,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:14:43,321 INFO L495 AbstractCegarLoop]: Abstraction has 373 states and 767 transitions. [2022-11-22 00:14:43,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:14:43,321 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 767 transitions. [2022-11-22 00:14:43,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-22 00:14:43,322 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:14:43,322 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:14:43,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-22 00:14:43,323 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-22 00:14:43,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:14:43,325 INFO L85 PathProgramCache]: Analyzing trace with hash -794118131, now seen corresponding path program 1 times [2022-11-22 00:14:43,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:14:43,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252148500] [2022-11-22 00:14:43,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:14:43,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:14:43,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:14:44,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:14:44,952 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:14:44,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252148500] [2022-11-22 00:14:44,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252148500] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:14:44,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:14:44,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 00:14:44,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369247039] [2022-11-22 00:14:44,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:14:44,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 00:14:44,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:14:44,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 00:14:44,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:14:44,954 INFO L87 Difference]: Start difference. First operand 373 states and 767 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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) [2022-11-22 00:14:45,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:14:45,362 INFO L93 Difference]: Finished difference Result 592 states and 1154 transitions. [2022-11-22 00:14:45,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 00:14:45,363 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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 [2022-11-22 00:14:45,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:14:45,364 INFO L225 Difference]: With dead ends: 592 [2022-11-22 00:14:45,364 INFO L226 Difference]: Without dead ends: 576 [2022-11-22 00:14:45,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-22 00:14:45,365 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 56 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 00:14:45,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 6 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 00:14:45,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2022-11-22 00:14:45,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 379. [2022-11-22 00:14:45,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 371 states have (on average 2.1078167115902966) internal successors, (782), 378 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:14:45,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 782 transitions. [2022-11-22 00:14:45,374 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 782 transitions. Word has length 19 [2022-11-22 00:14:45,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:14:45,376 INFO L495 AbstractCegarLoop]: Abstraction has 379 states and 782 transitions. [2022-11-22 00:14:45,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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) [2022-11-22 00:14:45,376 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 782 transitions. [2022-11-22 00:14:45,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-22 00:14:45,378 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:14:45,378 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:14:45,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-22 00:14:45,378 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-22 00:14:45,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:14:45,379 INFO L85 PathProgramCache]: Analyzing trace with hash 206978633, now seen corresponding path program 1 times [2022-11-22 00:14:45,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:14:45,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609443749] [2022-11-22 00:14:45,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:14:45,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:14:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:14:45,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:14:45,652 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:14:45,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609443749] [2022-11-22 00:14:45,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609443749] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:14:45,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:14:45,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 00:14:45,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948349150] [2022-11-22 00:14:45,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:14:45,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:14:45,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:14:45,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:14:45,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:14:45,655 INFO L87 Difference]: Start difference. First operand 379 states and 782 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) [2022-11-22 00:14:45,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:14:45,765 INFO L93 Difference]: Finished difference Result 273 states and 602 transitions. [2022-11-22 00:14:45,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:14:45,766 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 [2022-11-22 00:14:45,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:14:45,767 INFO L225 Difference]: With dead ends: 273 [2022-11-22 00:14:45,767 INFO L226 Difference]: Without dead ends: 82 [2022-11-22 00:14:45,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:14:45,768 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 38 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:14:45,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 3 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:14:45,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-22 00:14:45,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-11-22 00:14:45,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.9382716049382716) internal successors, (157), 81 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:14:45,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 157 transitions. [2022-11-22 00:14:45,770 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 157 transitions. Word has length 19 [2022-11-22 00:14:45,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:14:45,770 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 157 transitions. [2022-11-22 00:14:45,771 INFO L496 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) [2022-11-22 00:14:45,771 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 157 transitions. [2022-11-22 00:14:45,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-22 00:14:45,771 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:14:45,771 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:14:45,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-22 00:14:45,772 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-22 00:14:45,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:14:45,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1776519543, now seen corresponding path program 1 times [2022-11-22 00:14:45,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:14:45,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335549886] [2022-11-22 00:14:45,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:14:45,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:14:45,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:14:48,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:14:48,426 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:14:48,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335549886] [2022-11-22 00:14:48,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335549886] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:14:48,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:14:48,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-22 00:14:48,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021163127] [2022-11-22 00:14:48,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:14:48,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-22 00:14:48,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:14:48,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-22 00:14:48,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-11-22 00:14:48,429 INFO L87 Difference]: Start difference. First operand 82 states and 157 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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) [2022-11-22 00:14:48,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:14:48,803 INFO L93 Difference]: Finished difference Result 206 states and 387 transitions. [2022-11-22 00:14:48,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 00:14:48,803 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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 [2022-11-22 00:14:48,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:14:48,804 INFO L225 Difference]: With dead ends: 206 [2022-11-22 00:14:48,804 INFO L226 Difference]: Without dead ends: 98 [2022-11-22 00:14:48,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2022-11-22 00:14:48,805 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 54 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 00:14:48,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 8 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 00:14:48,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-11-22 00:14:48,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 79. [2022-11-22 00:14:48,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.8205128205128205) internal successors, (142), 78 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:14:48,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 142 transitions. [2022-11-22 00:14:48,807 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 142 transitions. Word has length 21 [2022-11-22 00:14:48,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:14:48,807 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 142 transitions. [2022-11-22 00:14:48,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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) [2022-11-22 00:14:48,808 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 142 transitions. [2022-11-22 00:14:48,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-22 00:14:48,811 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:14:48,811 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:14:48,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-22 00:14:48,811 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-22 00:14:48,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:14:48,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1639725173, now seen corresponding path program 2 times [2022-11-22 00:14:48,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:14:48,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784474999] [2022-11-22 00:14:48,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:14:48,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:14:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:14:52,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:14:52,678 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:14:52,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784474999] [2022-11-22 00:14:52,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784474999] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:14:52,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:14:52,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-22 00:14:52,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046097893] [2022-11-22 00:14:52,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:14:52,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-22 00:14:52,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:14:52,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-22 00:14:52,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-22 00:14:52,682 INFO L87 Difference]: Start difference. First operand 79 states and 142 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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) [2022-11-22 00:14:53,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:14:53,376 INFO L93 Difference]: Finished difference Result 97 states and 172 transitions. [2022-11-22 00:14:53,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 00:14:53,377 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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 [2022-11-22 00:14:53,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:14:53,377 INFO L225 Difference]: With dead ends: 97 [2022-11-22 00:14:53,377 INFO L226 Difference]: Without dead ends: 43 [2022-11-22 00:14:53,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2022-11-22 00:14:53,379 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 73 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 00:14:53,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 6 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 00:14:53,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-22 00:14:53,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-11-22 00:14:53,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.6428571428571428) internal successors, (69), 42 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:14:53,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 69 transitions. [2022-11-22 00:14:53,386 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 69 transitions. Word has length 21 [2022-11-22 00:14:53,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:14:53,386 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 69 transitions. [2022-11-22 00:14:53,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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) [2022-11-22 00:14:53,387 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 69 transitions. [2022-11-22 00:14:53,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-22 00:14:53,387 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:14:53,388 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:14:53,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-22 00:14:53,388 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-22 00:14:53,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:14:53,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1525720331, now seen corresponding path program 3 times [2022-11-22 00:14:53,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:14:53,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806605016] [2022-11-22 00:14:53,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:14:53,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:14:53,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 00:14:53,492 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-22 00:14:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 00:14:53,643 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-22 00:14:53,645 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-22 00:14:53,647 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (84 of 85 remaining) [2022-11-22 00:14:53,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 85 remaining) [2022-11-22 00:14:53,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 85 remaining) [2022-11-22 00:14:53,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 85 remaining) [2022-11-22 00:14:53,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 85 remaining) [2022-11-22 00:14:53,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 85 remaining) [2022-11-22 00:14:53,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 85 remaining) [2022-11-22 00:14:53,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 85 remaining) [2022-11-22 00:14:53,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 85 remaining) [2022-11-22 00:14:53,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 85 remaining) [2022-11-22 00:14:53,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 85 remaining) [2022-11-22 00:14:53,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 85 remaining) [2022-11-22 00:14:53,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 85 remaining) [2022-11-22 00:14:53,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 85 remaining) [2022-11-22 00:14:53,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 85 remaining) [2022-11-22 00:14:53,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 85 remaining) [2022-11-22 00:14:53,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 85 remaining) [2022-11-22 00:14:53,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 85 remaining) [2022-11-22 00:14:53,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 85 remaining) [2022-11-22 00:14:53,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 85 remaining) [2022-11-22 00:14:53,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 85 remaining) [2022-11-22 00:14:53,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 85 remaining) [2022-11-22 00:14:53,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 85 remaining) [2022-11-22 00:14:53,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 85 remaining) [2022-11-22 00:14:53,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 85 remaining) [2022-11-22 00:14:53,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 85 remaining) [2022-11-22 00:14:53,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 85 remaining) [2022-11-22 00:14:53,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 85 remaining) [2022-11-22 00:14:53,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 85 remaining) [2022-11-22 00:14:53,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 85 remaining) [2022-11-22 00:14:53,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 85 remaining) [2022-11-22 00:14:53,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 85 remaining) [2022-11-22 00:14:53,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 85 remaining) [2022-11-22 00:14:53,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 85 remaining) [2022-11-22 00:14:53,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 85 remaining) [2022-11-22 00:14:53,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 85 remaining) [2022-11-22 00:14:53,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 85 remaining) [2022-11-22 00:14:53,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 85 remaining) [2022-11-22 00:14:53,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 85 remaining) [2022-11-22 00:14:53,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 85 remaining) [2022-11-22 00:14:53,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 85 remaining) [2022-11-22 00:14:53,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 85 remaining) [2022-11-22 00:14:53,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 85 remaining) [2022-11-22 00:14:53,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 85 remaining) [2022-11-22 00:14:53,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 85 remaining) [2022-11-22 00:14:53,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 85 remaining) [2022-11-22 00:14:53,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 85 remaining) [2022-11-22 00:14:53,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (37 of 85 remaining) [2022-11-22 00:14:53,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 85 remaining) [2022-11-22 00:14:53,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 85 remaining) [2022-11-22 00:14:53,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 85 remaining) [2022-11-22 00:14:53,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 85 remaining) [2022-11-22 00:14:53,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 85 remaining) [2022-11-22 00:14:53,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 85 remaining) [2022-11-22 00:14:53,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 85 remaining) [2022-11-22 00:14:53,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 85 remaining) [2022-11-22 00:14:53,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 85 remaining) [2022-11-22 00:14:53,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 85 remaining) [2022-11-22 00:14:53,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 85 remaining) [2022-11-22 00:14:53,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 85 remaining) [2022-11-22 00:14:53,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 85 remaining) [2022-11-22 00:14:53,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 85 remaining) [2022-11-22 00:14:53,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 85 remaining) [2022-11-22 00:14:53,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 85 remaining) [2022-11-22 00:14:53,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 85 remaining) [2022-11-22 00:14:53,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 85 remaining) [2022-11-22 00:14:53,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 85 remaining) [2022-11-22 00:14:53,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 85 remaining) [2022-11-22 00:14:53,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 85 remaining) [2022-11-22 00:14:53,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 85 remaining) [2022-11-22 00:14:53,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 85 remaining) [2022-11-22 00:14:53,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 85 remaining) [2022-11-22 00:14:53,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 85 remaining) [2022-11-22 00:14:53,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 85 remaining) [2022-11-22 00:14:53,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 85 remaining) [2022-11-22 00:14:53,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 85 remaining) [2022-11-22 00:14:53,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 85 remaining) [2022-11-22 00:14:53,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 85 remaining) [2022-11-22 00:14:53,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 85 remaining) [2022-11-22 00:14:53,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 85 remaining) [2022-11-22 00:14:53,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 85 remaining) [2022-11-22 00:14:53,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 85 remaining) [2022-11-22 00:14:53,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 85 remaining) [2022-11-22 00:14:53,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 85 remaining) [2022-11-22 00:14:53,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 85 remaining) [2022-11-22 00:14:53,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-22 00:14:53,670 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:14:53,677 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-22 00:14:53,677 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 00:14:53,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 12:14:53 BasicIcfg [2022-11-22 00:14:53,783 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 00:14:53,783 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 00:14:53,783 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 00:14:53,784 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 00:14:53,784 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:14:10" (3/4) ... [2022-11-22 00:14:53,787 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-22 00:14:53,787 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 00:14:53,788 INFO L158 Benchmark]: Toolchain (without parser) took 45528.74ms. Allocated memory was 186.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 137.0MB in the beginning and 587.9MB in the end (delta: -450.9MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2022-11-22 00:14:53,788 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 186.6MB. Free memory is still 155.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 00:14:53,788 INFO L158 Benchmark]: CACSL2BoogieTranslator took 769.58ms. Allocated memory is still 186.6MB. Free memory was 137.0MB in the beginning and 112.5MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-22 00:14:53,789 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.92ms. Allocated memory is still 186.6MB. Free memory was 112.5MB in the beginning and 109.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 00:14:53,789 INFO L158 Benchmark]: Boogie Preprocessor took 37.86ms. Allocated memory is still 186.6MB. Free memory was 109.7MB in the beginning and 107.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 00:14:53,790 INFO L158 Benchmark]: RCFGBuilder took 1547.34ms. Allocated memory was 186.6MB in the beginning and 237.0MB in the end (delta: 50.3MB). Free memory was 107.7MB in the beginning and 124.4MB in the end (delta: -16.7MB). Peak memory consumption was 44.3MB. Max. memory is 16.1GB. [2022-11-22 00:14:53,790 INFO L158 Benchmark]: TraceAbstraction took 43114.25ms. Allocated memory was 237.0MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 124.4MB in the beginning and 587.9MB in the end (delta: -463.5MB). Peak memory consumption was 956.2MB. Max. memory is 16.1GB. [2022-11-22 00:14:53,790 INFO L158 Benchmark]: Witness Printer took 3.97ms. Allocated memory is still 1.7GB. Free memory is still 587.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 00:14:53,792 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 186.6MB. Free memory is still 155.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 769.58ms. Allocated memory is still 186.6MB. Free memory was 137.0MB in the beginning and 112.5MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.92ms. Allocated memory is still 186.6MB. Free memory was 112.5MB in the beginning and 109.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.86ms. Allocated memory is still 186.6MB. Free memory was 109.7MB in the beginning and 107.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1547.34ms. Allocated memory was 186.6MB in the beginning and 237.0MB in the end (delta: 50.3MB). Free memory was 107.7MB in the beginning and 124.4MB in the end (delta: -16.7MB). Peak memory consumption was 44.3MB. Max. memory is 16.1GB. * TraceAbstraction took 43114.25ms. Allocated memory was 237.0MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 124.4MB in the beginning and 587.9MB in the end (delta: -463.5MB). Peak memory consumption was 956.2MB. Max. memory is 16.1GB. * Witness Printer took 3.97ms. Allocated memory is still 1.7GB. Free memory is still 587.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 16.5s, 189 PlacesBefore, 85 PlacesAfterwards, 181 TransitionsBefore, 76 TransitionsAfterwards, 7128 CoEnabledTransitionPairs, 8 FixpointIterations, 69 TrivialSequentialCompositions, 96 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 170 TotalNumberOfCompositions, 28841 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11340, independent: 10854, independent conditional: 0, independent unconditional: 10854, dependent: 421, dependent conditional: 0, dependent unconditional: 421, unknown: 65, unknown conditional: 0, unknown unconditional: 65] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4773, independent: 4687, independent conditional: 0, independent unconditional: 4687, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4773, independent: 4096, independent conditional: 0, independent unconditional: 4096, dependent: 677, dependent conditional: 0, dependent unconditional: 677, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 677, independent: 591, independent conditional: 0, independent unconditional: 591, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2746, independent: 2032, independent conditional: 0, independent unconditional: 2032, dependent: 574, dependent conditional: 0, dependent unconditional: 574, unknown: 140, unknown conditional: 0, unknown unconditional: 140] ], Cache Queries: [ total: 11340, independent: 6167, independent conditional: 0, independent unconditional: 6167, dependent: 343, dependent conditional: 0, dependent unconditional: 343, unknown: 4830, unknown conditional: 0, unknown unconditional: 4830] , Statistics on independence cache: Total cache size (in pairs): 670, Positive cache size: 639, Positive conditional cache size: 0, Positive unconditional cache size: 639, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, Unknown cache size: 7, Unknown conditional cache size: 0, Unknown unconditional cache size: 7 - 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: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L718] 0 int __unbuffered_p2_EAX$mem_tmp; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L727] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L728] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L729] 0 int __unbuffered_p2_EAX$w_buff0; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L731] 0 int __unbuffered_p2_EAX$w_buff1; [L732] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2216; [L850] FCALL, FORK 0 pthread_create(&t2216, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2216, ((void *)0), P0, ((void *)0))=-2, t2216={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L851] 0 pthread_t t2217; [L852] FCALL, FORK 0 pthread_create(&t2217, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2217, ((void *)0), P1, ((void *)0))=-1, t2216={7:0}, t2217={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L853] 0 pthread_t t2218; [L854] FCALL, FORK 0 pthread_create(&t2218, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2218, ((void *)0), P2, ((void *)0))=0, t2216={7:0}, t2217={8:0}, t2218={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 x$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(x) [L809] 3 x$mem_tmp = x [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] EXPR 3 \read(x) [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L811] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L812] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L813] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L814] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L816] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L818] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L819] EXPR 3 \read(x) [L819] 3 __unbuffered_p2_EAX = x [L820] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L820] 3 x = x$flush_delayed ? x$mem_tmp : x [L821] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L761] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] EXPR 1 \read(x) [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L769] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L770] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L771] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L772] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L774] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EBX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L789] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] EXPR 2 \read(x) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L793] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L795] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 \read(x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 \read(x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2216={7:0}, t2217={8:0}, t2218={5:0}, weak$$choice0=51, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L867] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L868] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L871] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 239 locations, 85 error locations. Started 1 CEGAR loops. OverallTime: 42.8s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 18.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 873 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 873 mSDsluCounter, 102 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 75 mSDsCounter, 261 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2642 IncrementalHoareTripleChecker+Invalid, 2903 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 261 mSolverCounterUnsat, 27 mSDtfsCounter, 2642 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51276occurred in iteration=0, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 20 MinimizatonAttempts, 3346 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 13.9s InterpolantComputationTime, 283 NumberOfCodeBlocks, 283 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 242 ConstructedInterpolants, 0 QuantifiedInterpolants, 3958 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-22 00:14:53,830 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe018_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2ca99869d70e44347287c08401504e0aa96889a44ad1dcfb8d04f6de3849ab47 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-22 00:14:56,398 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 00:14:56,400 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 00:14:56,421 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 00:14:56,422 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 00:14:56,423 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 00:14:56,425 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 00:14:56,427 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 00:14:56,428 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 00:14:56,430 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 00:14:56,431 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 00:14:56,432 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 00:14:56,432 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 00:14:56,434 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 00:14:56,435 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 00:14:56,436 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 00:14:56,437 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 00:14:56,438 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 00:14:56,440 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 00:14:56,441 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 00:14:56,443 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 00:14:56,444 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 00:14:56,446 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 00:14:56,447 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 00:14:56,451 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 00:14:56,451 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 00:14:56,452 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 00:14:56,453 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 00:14:56,453 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 00:14:56,454 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 00:14:56,455 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 00:14:56,455 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 00:14:56,456 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 00:14:56,457 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 00:14:56,458 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 00:14:56,464 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 00:14:56,465 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 00:14:56,465 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 00:14:56,465 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 00:14:56,466 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 00:14:56,467 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 00:14:56,468 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-22 00:14:56,498 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 00:14:56,499 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 00:14:56,500 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 00:14:56,501 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 00:14:56,502 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 00:14:56,502 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 00:14:56,502 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 00:14:56,503 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 00:14:56,503 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 00:14:56,503 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 00:14:56,504 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 00:14:56,505 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 00:14:56,505 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-22 00:14:56,506 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-22 00:14:56,506 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 00:14:56,506 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 00:14:56,506 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 00:14:56,507 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 00:14:56,507 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 00:14:56,507 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 00:14:56,507 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-22 00:14:56,508 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-22 00:14:56,508 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-22 00:14:56,508 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 00:14:56,508 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-22 00:14:56,509 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-22 00:14:56,509 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-22 00:14:56,509 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 00:14:56,509 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 00:14:56,510 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 00:14:56,510 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-22 00:14:56,510 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 00:14:56,511 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 00:14:56,511 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 00:14:56,511 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 00:14:56,511 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-22 00:14:56,512 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-22 00:14:56,512 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 00:14:56,512 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-22 00:14:56,512 INFO L138 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_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/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_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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 -> 2ca99869d70e44347287c08401504e0aa96889a44ad1dcfb8d04f6de3849ab47 [2022-11-22 00:14:56,921 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 00:14:56,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 00:14:56,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 00:14:56,946 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 00:14:56,946 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 00:14:56,948 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/pthread-wmm/safe018_rmo.opt.i [2022-11-22 00:15:00,008 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 00:15:00,274 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 00:15:00,275 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/sv-benchmarks/c/pthread-wmm/safe018_rmo.opt.i [2022-11-22 00:15:00,288 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/data/3cfc1771f/f2b9e118663946829dce75a6a5a0793e/FLAGb477075c9 [2022-11-22 00:15:00,305 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/data/3cfc1771f/f2b9e118663946829dce75a6a5a0793e [2022-11-22 00:15:00,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 00:15:00,309 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 00:15:00,311 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 00:15:00,311 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 00:15:00,322 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 00:15:00,323 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:15:00" (1/1) ... [2022-11-22 00:15:00,324 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f687370 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:00, skipping insertion in model container [2022-11-22 00:15:00,326 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:15:00" (1/1) ... [2022-11-22 00:15:00,334 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 00:15:00,380 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 00:15:00,537 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/sv-benchmarks/c/pthread-wmm/safe018_rmo.opt.i[992,1005] [2022-11-22 00:15:00,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 00:15:00,872 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 00:15:00,888 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/sv-benchmarks/c/pthread-wmm/safe018_rmo.opt.i[992,1005] [2022-11-22 00:15:00,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 00:15:01,054 INFO L208 MainTranslator]: Completed translation [2022-11-22 00:15:01,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:01 WrapperNode [2022-11-22 00:15:01,055 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 00:15:01,057 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 00:15:01,057 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 00:15:01,057 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 00:15:01,065 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:01" (1/1) ... [2022-11-22 00:15:01,098 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:01" (1/1) ... [2022-11-22 00:15:01,147 INFO L138 Inliner]: procedures = 180, calls = 73, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 137 [2022-11-22 00:15:01,148 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 00:15:01,150 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 00:15:01,150 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 00:15:01,151 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 00:15:01,160 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:01" (1/1) ... [2022-11-22 00:15:01,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:01" (1/1) ... [2022-11-22 00:15:01,179 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:01" (1/1) ... [2022-11-22 00:15:01,181 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:01" (1/1) ... [2022-11-22 00:15:01,209 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:01" (1/1) ... [2022-11-22 00:15:01,220 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:01" (1/1) ... [2022-11-22 00:15:01,223 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:01" (1/1) ... [2022-11-22 00:15:01,225 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:01" (1/1) ... [2022-11-22 00:15:01,238 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 00:15:01,239 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 00:15:01,239 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 00:15:01,240 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 00:15:01,240 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:01" (1/1) ... [2022-11-22 00:15:01,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 00:15:01,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:15:01,275 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 00:15:01,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 00:15:01,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-22 00:15:01,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-22 00:15:01,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 00:15:01,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-22 00:15:01,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 00:15:01,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-22 00:15:01,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-22 00:15:01,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-22 00:15:01,318 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-22 00:15:01,318 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-22 00:15:01,318 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-22 00:15:01,318 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-22 00:15:01,319 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-22 00:15:01,319 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-22 00:15:01,319 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-22 00:15:01,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 00:15:01,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 00:15:01,321 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-22 00:15:01,580 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 00:15:01,582 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 00:15:02,466 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 00:15:03,055 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 00:15:03,056 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-22 00:15:03,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:15:03 BoogieIcfgContainer [2022-11-22 00:15:03,058 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 00:15:03,062 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 00:15:03,062 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 00:15:03,065 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 00:15:03,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:15:00" (1/3) ... [2022-11-22 00:15:03,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@120c87d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:15:03, skipping insertion in model container [2022-11-22 00:15:03,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:15:01" (2/3) ... [2022-11-22 00:15:03,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@120c87d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:15:03, skipping insertion in model container [2022-11-22 00:15:03,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:15:03" (3/3) ... [2022-11-22 00:15:03,071 INFO L112 eAbstractionObserver]: Analyzing ICFG safe018_rmo.opt.i [2022-11-22 00:15:03,091 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 00:15:03,091 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 48 error locations. [2022-11-22 00:15:03,092 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-22 00:15:03,262 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-22 00:15:03,310 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-22 00:15:03,342 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 190 places, 182 transitions, 379 flow [2022-11-22 00:15:03,353 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 190 places, 182 transitions, 379 flow [2022-11-22 00:15:03,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 190 places, 182 transitions, 379 flow [2022-11-22 00:15:03,509 INFO L130 PetriNetUnfolder]: 2/179 cut-off events. [2022-11-22 00:15:03,509 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-22 00:15:03,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 179 events. 2/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 254 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 117. Up to 2 conditions per place. [2022-11-22 00:15:03,521 INFO L119 LiptonReduction]: Number of co-enabled transitions 7128 [2022-11-22 00:15:31,887 INFO L134 LiptonReduction]: Checked pairs total: 29286 [2022-11-22 00:15:31,888 INFO L136 LiptonReduction]: Total number of compositions: 176 [2022-11-22 00:15:31,896 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 85 places, 76 transitions, 167 flow [2022-11-22 00:15:33,583 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 51276 states, 37144 states have (on average 5.206951324574629) internal successors, (193407), 51275 states have internal predecessors, (193407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:15:33,609 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 00:15:33,623 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@54983aa6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 00:15:33,623 INFO L358 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2022-11-22 00:15:33,675 INFO L276 IsEmpty]: Start isEmpty. Operand has 51276 states, 37144 states have (on average 5.206951324574629) internal successors, (193407), 51275 states have internal predecessors, (193407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:15:33,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-22 00:15:33,681 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:33,682 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-22 00:15:33,682 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-22 00:15:33,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:33,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1039, now seen corresponding path program 1 times [2022-11-22 00:15:33,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 00:15:33,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1223300962] [2022-11-22 00:15:33,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:33,709 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 00:15:33,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 00:15:33,719 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 00:15:33,737 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-22 00:15:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:33,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-22 00:15:33,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:15:33,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:15:33,950 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:15:33,950 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 00:15:33,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1223300962] [2022-11-22 00:15:33,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1223300962] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:33,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:33,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-22 00:15:34,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166299217] [2022-11-22 00:15:34,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:34,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-22 00:15:34,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 00:15:34,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-22 00:15:34,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-22 00:15:34,241 INFO L87 Difference]: Start difference. First operand has 51276 states, 37144 states have (on average 5.206951324574629) internal successors, (193407), 51275 states have internal predecessors, (193407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:15:35,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:35,216 INFO L93 Difference]: Finished difference Result 10092 states and 35895 transitions. [2022-11-22 00:15:35,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-22 00:15:35,224 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-11-22 00:15:35,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:35,406 INFO L225 Difference]: With dead ends: 10092 [2022-11-22 00:15:35,406 INFO L226 Difference]: Without dead ends: 10092 [2022-11-22 00:15:35,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-22 00:15:35,410 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:35,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 00:15:35,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10092 states. [2022-11-22 00:15:35,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10092 to 10092. [2022-11-22 00:15:36,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10092 states, 8770 states have (on average 4.092930444697833) internal successors, (35895), 10091 states have internal predecessors, (35895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:15:36,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10092 states to 10092 states and 35895 transitions. [2022-11-22 00:15:36,139 INFO L78 Accepts]: Start accepts. Automaton has 10092 states and 35895 transitions. Word has length 1 [2022-11-22 00:15:36,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:36,140 INFO L495 AbstractCegarLoop]: Abstraction has 10092 states and 35895 transitions. [2022-11-22 00:15:36,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:15:36,144 INFO L276 IsEmpty]: Start isEmpty. Operand 10092 states and 35895 transitions. [2022-11-22 00:15:36,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-22 00:15:36,145 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:36,146 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-22 00:15:36,171 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-22 00:15:36,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 00:15:36,357 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-22 00:15:36,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:36,358 INFO L85 PathProgramCache]: Analyzing trace with hash 31751909, now seen corresponding path program 1 times [2022-11-22 00:15:36,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 00:15:36,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [169127475] [2022-11-22 00:15:36,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:36,359 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 00:15:36,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 00:15:36,379 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 00:15:36,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-22 00:15:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:36,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 00:15:36,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:15:36,790 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-22 00:15:36,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-22 00:15:36,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:15:36,822 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:15:36,823 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 00:15:36,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [169127475] [2022-11-22 00:15:36,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [169127475] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:36,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:36,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 00:15:36,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147486900] [2022-11-22 00:15:36,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:36,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:15:36,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 00:15:36,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:15:36,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:15:36,827 INFO L87 Difference]: Start difference. First operand 10092 states and 35895 transitions. 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) [2022-11-22 00:15:37,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:37,265 INFO L93 Difference]: Finished difference Result 5274 states and 18133 transitions. [2022-11-22 00:15:37,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:15:37,266 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 [2022-11-22 00:15:37,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:37,320 INFO L225 Difference]: With dead ends: 5274 [2022-11-22 00:15:37,320 INFO L226 Difference]: Without dead ends: 5274 [2022-11-22 00:15:37,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:15:37,322 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 28 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:37,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 2 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 00:15:37,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5274 states. [2022-11-22 00:15:37,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5274 to 5274. [2022-11-22 00:15:37,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5274 states, 4821 states have (on average 3.7612528521053723) internal successors, (18133), 5273 states have internal predecessors, (18133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:15:37,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5274 states to 5274 states and 18133 transitions. [2022-11-22 00:15:37,529 INFO L78 Accepts]: Start accepts. Automaton has 5274 states and 18133 transitions. Word has length 4 [2022-11-22 00:15:37,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:37,530 INFO L495 AbstractCegarLoop]: Abstraction has 5274 states and 18133 transitions. [2022-11-22 00:15:37,530 INFO L496 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) [2022-11-22 00:15:37,530 INFO L276 IsEmpty]: Start isEmpty. Operand 5274 states and 18133 transitions. [2022-11-22 00:15:37,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-22 00:15:37,531 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:37,531 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-22 00:15:37,552 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-22 00:15:37,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 00:15:37,744 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-22 00:15:37,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:37,745 INFO L85 PathProgramCache]: Analyzing trace with hash 31751910, now seen corresponding path program 1 times [2022-11-22 00:15:37,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 00:15:37,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [365228283] [2022-11-22 00:15:37,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:37,747 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 00:15:37,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 00:15:37,749 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 00:15:37,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-22 00:15:37,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:37,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-22 00:15:37,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:15:37,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:15:37,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-22 00:15:38,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:15:38,058 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:15:38,058 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 00:15:38,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [365228283] [2022-11-22 00:15:38,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [365228283] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:38,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:38,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 00:15:38,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027682123] [2022-11-22 00:15:38,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:38,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:15:38,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 00:15:38,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:15:38,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:15:38,060 INFO L87 Difference]: Start difference. First operand 5274 states and 18133 transitions. 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) [2022-11-22 00:15:38,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:38,235 INFO L93 Difference]: Finished difference Result 1734 states and 5635 transitions. [2022-11-22 00:15:38,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:15:38,236 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 [2022-11-22 00:15:38,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:38,244 INFO L225 Difference]: With dead ends: 1734 [2022-11-22 00:15:38,245 INFO L226 Difference]: Without dead ends: 1734 [2022-11-22 00:15:38,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:15:38,246 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:38,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:15:38,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2022-11-22 00:15:38,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1734. [2022-11-22 00:15:38,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1734 states, 1668 states have (on average 3.378297362110312) internal successors, (5635), 1733 states have internal predecessors, (5635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:15:38,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 5635 transitions. [2022-11-22 00:15:38,307 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 5635 transitions. Word has length 4 [2022-11-22 00:15:38,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:38,308 INFO L495 AbstractCegarLoop]: Abstraction has 1734 states and 5635 transitions. [2022-11-22 00:15:38,308 INFO L496 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) [2022-11-22 00:15:38,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 5635 transitions. [2022-11-22 00:15:38,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-22 00:15:38,309 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:38,309 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:38,326 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-22 00:15:38,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 00:15:38,522 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-22 00:15:38,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:38,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1194761317, now seen corresponding path program 1 times [2022-11-22 00:15:38,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 00:15:38,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [334398005] [2022-11-22 00:15:38,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:38,523 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 00:15:38,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 00:15:38,525 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 00:15:38,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-22 00:15:38,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:38,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 00:15:38,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:15:38,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:15:38,747 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:15:38,747 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 00:15:38,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [334398005] [2022-11-22 00:15:38,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [334398005] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:38,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:38,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:15:38,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732255946] [2022-11-22 00:15:38,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:38,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:15:38,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 00:15:38,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:15:38,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:15:38,753 INFO L87 Difference]: Start difference. First operand 1734 states and 5635 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:15:38,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:38,961 INFO L93 Difference]: Finished difference Result 847 states and 2222 transitions. [2022-11-22 00:15:38,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:15:38,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-11-22 00:15:38,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:38,968 INFO L225 Difference]: With dead ends: 847 [2022-11-22 00:15:38,972 INFO L226 Difference]: Without dead ends: 847 [2022-11-22 00:15:38,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:15:38,974 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 7 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:38,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:15:38,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2022-11-22 00:15:39,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 847. [2022-11-22 00:15:39,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 799 states have (on average 2.780976220275344) internal successors, (2222), 846 states have internal predecessors, (2222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:15:39,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 2222 transitions. [2022-11-22 00:15:39,008 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 2222 transitions. Word has length 10 [2022-11-22 00:15:39,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:39,009 INFO L495 AbstractCegarLoop]: Abstraction has 847 states and 2222 transitions. [2022-11-22 00:15:39,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:15:39,009 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 2222 transitions. [2022-11-22 00:15:39,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-22 00:15:39,010 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:39,011 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:39,032 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-22 00:15:39,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 00:15:39,227 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-22 00:15:39,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:39,228 INFO L85 PathProgramCache]: Analyzing trace with hash 563337905, now seen corresponding path program 1 times [2022-11-22 00:15:39,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 00:15:39,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [595959365] [2022-11-22 00:15:39,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:39,229 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 00:15:39,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 00:15:39,231 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 00:15:39,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-22 00:15:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:39,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 00:15:39,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:15:39,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:15:39,482 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:15:39,483 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 00:15:39,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [595959365] [2022-11-22 00:15:39,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [595959365] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:39,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:39,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:15:39,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673833217] [2022-11-22 00:15:39,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:39,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:15:39,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 00:15:39,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:15:39,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:15:39,485 INFO L87 Difference]: Start difference. First operand 847 states and 2222 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:15:39,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:39,907 INFO L93 Difference]: Finished difference Result 276 states and 576 transitions. [2022-11-22 00:15:39,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:15:39,908 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-11-22 00:15:39,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:39,909 INFO L225 Difference]: With dead ends: 276 [2022-11-22 00:15:39,910 INFO L226 Difference]: Without dead ends: 276 [2022-11-22 00:15:39,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:15:39,911 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 18 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:39,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 4 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 00:15:39,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2022-11-22 00:15:39,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2022-11-22 00:15:39,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 258 states have (on average 2.2325581395348837) internal successors, (576), 275 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:15:39,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 576 transitions. [2022-11-22 00:15:39,921 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 576 transitions. Word has length 13 [2022-11-22 00:15:39,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:39,922 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 576 transitions. [2022-11-22 00:15:39,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:15:39,936 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 576 transitions. [2022-11-22 00:15:39,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 00:15:39,959 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:39,959 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:39,991 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-22 00:15:40,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 00:15:40,176 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-22 00:15:40,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:40,176 INFO L85 PathProgramCache]: Analyzing trace with hash 253748972, now seen corresponding path program 1 times [2022-11-22 00:15:40,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 00:15:40,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1698733371] [2022-11-22 00:15:40,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:40,177 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 00:15:40,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 00:15:40,179 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 00:15:40,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-22 00:15:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:40,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-22 00:15:40,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:15:40,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:15:40,504 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:15:40,504 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 00:15:40,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1698733371] [2022-11-22 00:15:40,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1698733371] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:40,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:40,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 00:15:40,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228282088] [2022-11-22 00:15:40,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:40,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:15:40,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 00:15:40,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:15:40,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:15:40,507 INFO L87 Difference]: Start difference. First operand 276 states and 576 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:15:40,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:40,932 INFO L93 Difference]: Finished difference Result 151 states and 336 transitions. [2022-11-22 00:15:40,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:15:40,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-22 00:15:40,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:40,934 INFO L225 Difference]: With dead ends: 151 [2022-11-22 00:15:40,934 INFO L226 Difference]: Without dead ends: 151 [2022-11-22 00:15:40,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:15:40,935 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 26 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:40,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 9 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 00:15:40,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-22 00:15:40,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2022-11-22 00:15:40,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 147 states have (on average 2.2857142857142856) internal successors, (336), 150 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:15:40,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 336 transitions. [2022-11-22 00:15:40,941 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 336 transitions. Word has length 16 [2022-11-22 00:15:40,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:40,941 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 336 transitions. [2022-11-22 00:15:40,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:15:40,942 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 336 transitions. [2022-11-22 00:15:40,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 00:15:40,944 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:40,945 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:40,962 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-22 00:15:41,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 00:15:41,149 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-22 00:15:41,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:41,149 INFO L85 PathProgramCache]: Analyzing trace with hash -716448391, now seen corresponding path program 1 times [2022-11-22 00:15:41,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 00:15:41,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1086916201] [2022-11-22 00:15:41,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:41,150 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 00:15:41,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 00:15:41,152 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 00:15:41,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-22 00:15:41,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:41,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-22 00:15:41,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:15:41,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:15:41,443 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:15:41,443 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 00:15:41,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1086916201] [2022-11-22 00:15:41,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1086916201] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:41,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:41,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:15:41,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854675888] [2022-11-22 00:15:41,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:41,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:15:41,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 00:15:41,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:15:41,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:15:41,445 INFO L87 Difference]: Start difference. First operand 151 states and 336 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:15:41,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:41,602 INFO L93 Difference]: Finished difference Result 150 states and 335 transitions. [2022-11-22 00:15:41,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:15:41,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-22 00:15:41,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:41,604 INFO L225 Difference]: With dead ends: 150 [2022-11-22 00:15:41,604 INFO L226 Difference]: Without dead ends: 150 [2022-11-22 00:15:41,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:15:41,605 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 9 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:41,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:15:41,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-22 00:15:41,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-11-22 00:15:41,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 147 states have (on average 2.2789115646258504) internal successors, (335), 149 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:15:41,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 335 transitions. [2022-11-22 00:15:41,610 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 335 transitions. Word has length 20 [2022-11-22 00:15:41,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:41,615 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 335 transitions. [2022-11-22 00:15:41,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:15:41,615 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 335 transitions. [2022-11-22 00:15:41,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 00:15:41,616 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:41,617 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:41,638 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-22 00:15:41,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 00:15:41,817 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-22 00:15:41,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:41,818 INFO L85 PathProgramCache]: Analyzing trace with hash -716448390, now seen corresponding path program 1 times [2022-11-22 00:15:41,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 00:15:41,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [613829327] [2022-11-22 00:15:41,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:41,819 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 00:15:41,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 00:15:41,820 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 00:15:41,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-22 00:15:42,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:42,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 00:15:42,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:15:42,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:15:42,189 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:15:42,190 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 00:15:42,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [613829327] [2022-11-22 00:15:42,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [613829327] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:42,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:42,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:15:42,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699703417] [2022-11-22 00:15:42,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:42,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:15:42,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 00:15:42,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:15:42,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:15:42,192 INFO L87 Difference]: Start difference. First operand 150 states and 335 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:15:42,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:42,358 INFO L93 Difference]: Finished difference Result 149 states and 334 transitions. [2022-11-22 00:15:42,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:15:42,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-22 00:15:42,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:42,360 INFO L225 Difference]: With dead ends: 149 [2022-11-22 00:15:42,360 INFO L226 Difference]: Without dead ends: 149 [2022-11-22 00:15:42,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:15:42,361 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:42,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:15:42,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-11-22 00:15:42,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2022-11-22 00:15:42,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 147 states have (on average 2.272108843537415) internal successors, (334), 148 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:15:42,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 334 transitions. [2022-11-22 00:15:42,367 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 334 transitions. Word has length 20 [2022-11-22 00:15:42,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:42,367 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 334 transitions. [2022-11-22 00:15:42,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:15:42,368 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 334 transitions. [2022-11-22 00:15:42,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-22 00:15:42,369 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:42,369 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:42,388 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-22 00:15:42,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 00:15:42,575 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-22 00:15:42,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:42,575 INFO L85 PathProgramCache]: Analyzing trace with hash -735067093, now seen corresponding path program 1 times [2022-11-22 00:15:42,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 00:15:42,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311265293] [2022-11-22 00:15:42,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:15:42,577 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 00:15:42,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 00:15:42,578 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 00:15:42,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-22 00:15:42,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:15:42,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 00:15:42,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:15:42,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:15:42,879 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:15:42,879 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 00:15:42,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311265293] [2022-11-22 00:15:42,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [311265293] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:42,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:42,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:15:42,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738591403] [2022-11-22 00:15:42,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:42,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:15:42,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 00:15:42,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:15:42,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:15:42,882 INFO L87 Difference]: Start difference. First operand 149 states and 334 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 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) [2022-11-22 00:15:43,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:43,076 INFO L93 Difference]: Finished difference Result 191 states and 415 transitions. [2022-11-22 00:15:43,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:15:43,077 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 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 [2022-11-22 00:15:43,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:43,078 INFO L225 Difference]: With dead ends: 191 [2022-11-22 00:15:43,078 INFO L226 Difference]: Without dead ends: 191 [2022-11-22 00:15:43,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:15:43,079 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 18 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:43,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:15:43,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-11-22 00:15:43,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 187. [2022-11-22 00:15:43,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 185 states have (on average 2.227027027027027) internal successors, (412), 186 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:15:43,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 412 transitions. [2022-11-22 00:15:43,090 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 412 transitions. Word has length 21 [2022-11-22 00:15:43,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:43,090 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 412 transitions. [2022-11-22 00:15:43,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 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) [2022-11-22 00:15:43,091 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 412 transitions. [2022-11-22 00:15:43,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-22 00:15:43,091 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:43,092 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:43,111 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-22 00:15:43,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 00:15:43,305 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-22 00:15:43,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:43,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1530187117, now seen corresponding path program 2 times [2022-11-22 00:15:43,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 00:15:43,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [549560182] [2022-11-22 00:15:43,306 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-22 00:15:43,307 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 00:15:43,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 00:15:43,308 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 00:15:43,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-22 00:15:43,538 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-22 00:15:43,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 00:15:43,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-22 00:15:43,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:15:44,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2022-11-22 00:15:44,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 36 [2022-11-22 00:15:45,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-22 00:15:45,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-22 00:15:45,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:15:45,576 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:15:45,576 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 00:15:45,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [549560182] [2022-11-22 00:15:45,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [549560182] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:45,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:45,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 00:15:45,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372015775] [2022-11-22 00:15:45,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:45,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-22 00:15:45,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 00:15:45,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-22 00:15:45,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-22 00:15:45,578 INFO L87 Difference]: Start difference. First operand 187 states and 412 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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) [2022-11-22 00:15:46,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:46,422 INFO L93 Difference]: Finished difference Result 302 states and 645 transitions. [2022-11-22 00:15:46,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 00:15:46,423 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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 [2022-11-22 00:15:46,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:46,424 INFO L225 Difference]: With dead ends: 302 [2022-11-22 00:15:46,424 INFO L226 Difference]: Without dead ends: 302 [2022-11-22 00:15:46,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-22 00:15:46,425 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 43 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:46,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 5 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 00:15:46,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-11-22 00:15:46,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 199. [2022-11-22 00:15:46,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 197 states have (on average 2.238578680203046) internal successors, (441), 198 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:15:46,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 441 transitions. [2022-11-22 00:15:46,434 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 441 transitions. Word has length 21 [2022-11-22 00:15:46,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:46,434 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 441 transitions. [2022-11-22 00:15:46,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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) [2022-11-22 00:15:46,435 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 441 transitions. [2022-11-22 00:15:46,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-22 00:15:46,436 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:46,436 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:46,451 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-22 00:15:46,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 00:15:46,649 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-22 00:15:46,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:46,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1026892911, now seen corresponding path program 3 times [2022-11-22 00:15:46,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 00:15:46,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1653226598] [2022-11-22 00:15:46,650 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 00:15:46,651 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 00:15:46,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 00:15:46,652 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 00:15:46,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-22 00:15:46,887 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-22 00:15:46,887 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 00:15:46,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-22 00:15:46,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:15:47,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 00:15:47,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-22 00:15:47,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:15:47,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:15:47,375 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:15:47,375 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 00:15:47,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1653226598] [2022-11-22 00:15:47,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1653226598] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:47,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:47,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 00:15:47,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193103295] [2022-11-22 00:15:47,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:47,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 00:15:47,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 00:15:47,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 00:15:47,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-22 00:15:47,377 INFO L87 Difference]: Start difference. First operand 199 states and 441 transitions. Second operand has 6 states, 5 states have (on average 4.2) 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) [2022-11-22 00:15:47,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:47,967 INFO L93 Difference]: Finished difference Result 409 states and 860 transitions. [2022-11-22 00:15:47,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 00:15:47,968 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) 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 [2022-11-22 00:15:47,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:47,971 INFO L225 Difference]: With dead ends: 409 [2022-11-22 00:15:47,971 INFO L226 Difference]: Without dead ends: 409 [2022-11-22 00:15:47,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-22 00:15:47,972 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 38 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:47,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 10 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 00:15:47,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-11-22 00:15:47,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 199. [2022-11-22 00:15:47,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 197 states have (on average 2.238578680203046) internal successors, (441), 198 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:15:47,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 441 transitions. [2022-11-22 00:15:47,980 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 441 transitions. Word has length 21 [2022-11-22 00:15:47,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:47,980 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 441 transitions. [2022-11-22 00:15:47,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) 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) [2022-11-22 00:15:47,980 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 441 transitions. [2022-11-22 00:15:47,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-22 00:15:47,981 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:47,981 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:47,995 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-22 00:15:48,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 00:15:48,194 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-22 00:15:48,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:48,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1695418949, now seen corresponding path program 4 times [2022-11-22 00:15:48,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 00:15:48,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [193831801] [2022-11-22 00:15:48,196 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 00:15:48,196 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 00:15:48,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 00:15:48,197 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 00:15:48,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-22 00:15:48,468 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 00:15:48,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 00:15:48,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-22 00:15:48,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:15:48,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 00:15:48,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-22 00:15:49,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-22 00:15:49,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:15:49,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:15:49,218 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:15:49,218 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 00:15:49,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [193831801] [2022-11-22 00:15:49,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [193831801] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:15:49,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:15:49,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 00:15:49,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63314561] [2022-11-22 00:15:49,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:15:49,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 00:15:49,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 00:15:49,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 00:15:49,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:15:49,220 INFO L87 Difference]: Start difference. First operand 199 states and 441 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 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) [2022-11-22 00:15:49,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:15:49,899 INFO L93 Difference]: Finished difference Result 377 states and 806 transitions. [2022-11-22 00:15:49,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 00:15:49,900 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 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 [2022-11-22 00:15:49,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:15:49,901 INFO L225 Difference]: With dead ends: 377 [2022-11-22 00:15:49,901 INFO L226 Difference]: Without dead ends: 377 [2022-11-22 00:15:49,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-22 00:15:49,902 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 41 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 00:15:49,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 12 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 00:15:49,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-11-22 00:15:49,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 178. [2022-11-22 00:15:49,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 176 states have (on average 2.221590909090909) internal successors, (391), 177 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:15:49,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 391 transitions. [2022-11-22 00:15:49,909 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 391 transitions. Word has length 21 [2022-11-22 00:15:49,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:15:49,909 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 391 transitions. [2022-11-22 00:15:49,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 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) [2022-11-22 00:15:49,910 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 391 transitions. [2022-11-22 00:15:49,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-22 00:15:49,910 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:15:49,911 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:49,931 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-22 00:15:50,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 00:15:50,125 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-22 00:15:50,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:15:50,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1664575123, now seen corresponding path program 5 times [2022-11-22 00:15:50,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 00:15:50,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2106329977] [2022-11-22 00:15:50,126 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-22 00:15:50,126 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 00:15:50,126 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 00:15:50,127 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 00:15:50,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-22 00:15:50,466 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-22 00:15:50,466 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-22 00:15:50,466 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-22 00:15:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 00:15:50,726 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2022-11-22 00:15:50,727 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-22 00:15:50,728 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (84 of 85 remaining) [2022-11-22 00:15:50,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 85 remaining) [2022-11-22 00:15:50,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 85 remaining) [2022-11-22 00:15:50,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 85 remaining) [2022-11-22 00:15:50,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 85 remaining) [2022-11-22 00:15:50,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 85 remaining) [2022-11-22 00:15:50,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 85 remaining) [2022-11-22 00:15:50,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 85 remaining) [2022-11-22 00:15:50,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 85 remaining) [2022-11-22 00:15:50,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 85 remaining) [2022-11-22 00:15:50,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 85 remaining) [2022-11-22 00:15:50,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 85 remaining) [2022-11-22 00:15:50,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 85 remaining) [2022-11-22 00:15:50,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 85 remaining) [2022-11-22 00:15:50,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 85 remaining) [2022-11-22 00:15:50,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 85 remaining) [2022-11-22 00:15:50,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 85 remaining) [2022-11-22 00:15:50,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 85 remaining) [2022-11-22 00:15:50,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 85 remaining) [2022-11-22 00:15:50,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 85 remaining) [2022-11-22 00:15:50,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 85 remaining) [2022-11-22 00:15:50,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 85 remaining) [2022-11-22 00:15:50,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 85 remaining) [2022-11-22 00:15:50,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 85 remaining) [2022-11-22 00:15:50,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 85 remaining) [2022-11-22 00:15:50,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 85 remaining) [2022-11-22 00:15:50,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 85 remaining) [2022-11-22 00:15:50,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 85 remaining) [2022-11-22 00:15:50,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 85 remaining) [2022-11-22 00:15:50,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 85 remaining) [2022-11-22 00:15:50,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 85 remaining) [2022-11-22 00:15:50,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 85 remaining) [2022-11-22 00:15:50,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 85 remaining) [2022-11-22 00:15:50,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 85 remaining) [2022-11-22 00:15:50,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 85 remaining) [2022-11-22 00:15:50,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 85 remaining) [2022-11-22 00:15:50,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 85 remaining) [2022-11-22 00:15:50,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 85 remaining) [2022-11-22 00:15:50,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 85 remaining) [2022-11-22 00:15:50,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 85 remaining) [2022-11-22 00:15:50,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 85 remaining) [2022-11-22 00:15:50,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 85 remaining) [2022-11-22 00:15:50,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 85 remaining) [2022-11-22 00:15:50,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 85 remaining) [2022-11-22 00:15:50,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 85 remaining) [2022-11-22 00:15:50,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 85 remaining) [2022-11-22 00:15:50,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 85 remaining) [2022-11-22 00:15:50,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (37 of 85 remaining) [2022-11-22 00:15:50,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 85 remaining) [2022-11-22 00:15:50,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 85 remaining) [2022-11-22 00:15:50,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 85 remaining) [2022-11-22 00:15:50,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 85 remaining) [2022-11-22 00:15:50,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 85 remaining) [2022-11-22 00:15:50,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 85 remaining) [2022-11-22 00:15:50,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 85 remaining) [2022-11-22 00:15:50,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 85 remaining) [2022-11-22 00:15:50,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 85 remaining) [2022-11-22 00:15:50,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 85 remaining) [2022-11-22 00:15:50,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 85 remaining) [2022-11-22 00:15:50,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 85 remaining) [2022-11-22 00:15:50,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 85 remaining) [2022-11-22 00:15:50,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 85 remaining) [2022-11-22 00:15:50,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 85 remaining) [2022-11-22 00:15:50,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 85 remaining) [2022-11-22 00:15:50,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 85 remaining) [2022-11-22 00:15:50,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 85 remaining) [2022-11-22 00:15:50,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 85 remaining) [2022-11-22 00:15:50,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 85 remaining) [2022-11-22 00:15:50,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 85 remaining) [2022-11-22 00:15:50,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 85 remaining) [2022-11-22 00:15:50,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 85 remaining) [2022-11-22 00:15:50,743 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 85 remaining) [2022-11-22 00:15:50,743 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 85 remaining) [2022-11-22 00:15:50,743 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 85 remaining) [2022-11-22 00:15:50,743 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 85 remaining) [2022-11-22 00:15:50,743 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 85 remaining) [2022-11-22 00:15:50,744 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 85 remaining) [2022-11-22 00:15:50,744 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 85 remaining) [2022-11-22 00:15:50,744 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 85 remaining) [2022-11-22 00:15:50,744 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 85 remaining) [2022-11-22 00:15:50,744 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 85 remaining) [2022-11-22 00:15:50,744 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 85 remaining) [2022-11-22 00:15:50,745 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 85 remaining) [2022-11-22 00:15:50,745 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 85 remaining) [2022-11-22 00:15:50,745 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 85 remaining) [2022-11-22 00:15:50,764 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-22 00:15:50,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 00:15:50,961 INFO L444 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:15:50,967 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-22 00:15:50,967 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 00:15:51,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 12:15:51 BasicIcfg [2022-11-22 00:15:51,094 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 00:15:51,095 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 00:15:51,095 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 00:15:51,095 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 00:15:51,096 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:15:03" (3/4) ... [2022-11-22 00:15:51,098 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-22 00:15:51,099 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 00:15:51,099 INFO L158 Benchmark]: Toolchain (without parser) took 50790.24ms. Allocated memory was 69.2MB in the beginning and 820.0MB in the end (delta: 750.8MB). Free memory was 49.1MB in the beginning and 436.6MB in the end (delta: -387.4MB). Peak memory consumption was 361.7MB. Max. memory is 16.1GB. [2022-11-22 00:15:51,099 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 56.6MB. Free memory is still 35.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 00:15:51,100 INFO L158 Benchmark]: CACSL2BoogieTranslator took 744.89ms. Allocated memory is still 69.2MB. Free memory was 48.9MB in the beginning and 40.4MB in the end (delta: 8.5MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2022-11-22 00:15:51,100 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.08ms. Allocated memory is still 69.2MB. Free memory was 40.4MB in the beginning and 37.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-22 00:15:51,100 INFO L158 Benchmark]: Boogie Preprocessor took 88.65ms. Allocated memory is still 69.2MB. Free memory was 37.9MB in the beginning and 35.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 00:15:51,101 INFO L158 Benchmark]: RCFGBuilder took 1819.28ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 35.2MB in the beginning and 41.0MB in the end (delta: -5.8MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2022-11-22 00:15:51,101 INFO L158 Benchmark]: TraceAbstraction took 48032.74ms. Allocated memory was 83.9MB in the beginning and 820.0MB in the end (delta: 736.1MB). Free memory was 40.4MB in the beginning and 437.6MB in the end (delta: -397.2MB). Peak memory consumption was 339.1MB. Max. memory is 16.1GB. [2022-11-22 00:15:51,101 INFO L158 Benchmark]: Witness Printer took 3.93ms. Allocated memory is still 820.0MB. Free memory was 437.6MB in the beginning and 436.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 00:15:51,103 INFO L339 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 56.6MB. Free memory is still 35.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 744.89ms. Allocated memory is still 69.2MB. Free memory was 48.9MB in the beginning and 40.4MB in the end (delta: 8.5MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.08ms. Allocated memory is still 69.2MB. Free memory was 40.4MB in the beginning and 37.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 88.65ms. Allocated memory is still 69.2MB. Free memory was 37.9MB in the beginning and 35.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1819.28ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 35.2MB in the beginning and 41.0MB in the end (delta: -5.8MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * TraceAbstraction took 48032.74ms. Allocated memory was 83.9MB in the beginning and 820.0MB in the end (delta: 736.1MB). Free memory was 40.4MB in the beginning and 437.6MB in the end (delta: -397.2MB). Peak memory consumption was 339.1MB. Max. memory is 16.1GB. * Witness Printer took 3.93ms. Allocated memory is still 820.0MB. Free memory was 437.6MB in the beginning and 436.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 28.5s, 190 PlacesBefore, 85 PlacesAfterwards, 182 TransitionsBefore, 76 TransitionsAfterwards, 7128 CoEnabledTransitionPairs, 8 FixpointIterations, 72 TrivialSequentialCompositions, 99 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 176 TotalNumberOfCompositions, 29286 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12717, independent: 12227, independent conditional: 0, independent unconditional: 12227, dependent: 405, dependent conditional: 0, dependent unconditional: 405, unknown: 85, unknown conditional: 0, unknown unconditional: 85] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4878, independent: 4795, independent conditional: 0, independent unconditional: 4795, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4878, independent: 4195, independent conditional: 0, independent unconditional: 4195, dependent: 683, dependent conditional: 0, dependent unconditional: 683, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 683, independent: 600, independent conditional: 0, independent unconditional: 600, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3648, independent: 2457, independent conditional: 0, independent unconditional: 2457, dependent: 806, dependent conditional: 0, dependent unconditional: 806, unknown: 385, unknown conditional: 0, unknown unconditional: 385] ], Cache Queries: [ total: 12717, independent: 7432, independent conditional: 0, independent unconditional: 7432, dependent: 330, dependent conditional: 0, dependent unconditional: 330, unknown: 4955, unknown conditional: 0, unknown unconditional: 4955] , Statistics on independence cache: Total cache size (in pairs): 766, Positive cache size: 735, Positive conditional cache size: 0, Positive unconditional cache size: 735, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, Unknown cache size: 7, Unknown conditional cache size: 0, Unknown unconditional cache size: 7 - 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: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L718] 0 int __unbuffered_p2_EAX$mem_tmp; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L727] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L728] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L729] 0 int __unbuffered_p2_EAX$w_buff0; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L731] 0 int __unbuffered_p2_EAX$w_buff1; [L732] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2216; [L850] FCALL, FORK 0 pthread_create(&t2216, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2216, ((void *)0), P0, ((void *)0))=-2, t2216={-2147483642:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L851] 0 pthread_t t2217; [L852] FCALL, FORK 0 pthread_create(&t2217, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2217, ((void *)0), P1, ((void *)0))=-1, t2216={-2147483642:0}, t2217={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L853] 0 pthread_t t2218; [L854] FCALL, FORK 0 pthread_create(&t2218, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2218, ((void *)0), P2, ((void *)0))=0, t2216={-2147483642:0}, t2217={6:0}, t2218={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 x$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(x) [L809] 3 x$mem_tmp = x [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] EXPR 3 \read(x) [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L811] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L812] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L813] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L814] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L816] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L818] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L819] EXPR 3 \read(x) [L819] 3 __unbuffered_p2_EAX = x [L820] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L820] EXPR 3 \read(x) [L820] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L820] 3 x = x$flush_delayed ? x$mem_tmp : x [L821] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L761] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] EXPR 1 \read(x) [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L769] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L770] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L771] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L772] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L774] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EBX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=0, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L789] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=0, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] EXPR 2 \read(x) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L793] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L795] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=0, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 \read(x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=0, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 \read(x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2216={-2147483642:0}, t2217={6:0}, t2218={7:0}, weak$$choice0=5, weak$$choice1=0, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L867] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L868] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L871] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=2, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 240 locations, 85 error locations. Started 1 CEGAR loops. OverallTime: 47.7s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.1s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 30.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 281 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 281 mSDsluCounter, 49 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1171 IncrementalHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 22 mSDtfsCounter, 1171 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 171 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51276occurred in iteration=0, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 516 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 193 NumberOfCodeBlocks, 193 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 160 ConstructedInterpolants, 0 QuantifiedInterpolants, 1893 SizeOfPredicates, 51 NumberOfNonLiveVariables, 1932 ConjunctsInSsa, 134 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 [2022-11-22 00:15:51,155 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c46bad1a-83e1-4edc-8442-abff1bd19ebb/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample