./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe009_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe009_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW --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 9047d35108a9c07c04b519cba211a741bb80887623b2a85c45105c17ca835121 --- 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-4e7fbc6 [2022-11-23 15:51:44,220 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 15:51:44,222 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 15:51:44,246 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 15:51:44,252 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 15:51:44,254 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 15:51:44,256 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 15:51:44,261 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 15:51:44,263 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 15:51:44,265 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 15:51:44,266 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 15:51:44,267 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 15:51:44,268 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 15:51:44,268 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 15:51:44,270 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 15:51:44,271 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 15:51:44,272 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 15:51:44,273 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 15:51:44,274 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 15:51:44,277 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 15:51:44,286 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 15:51:44,287 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 15:51:44,288 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 15:51:44,295 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 15:51:44,298 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 15:51:44,298 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 15:51:44,299 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 15:51:44,304 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 15:51:44,305 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 15:51:44,306 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 15:51:44,306 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 15:51:44,307 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 15:51:44,308 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 15:51:44,308 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 15:51:44,311 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 15:51:44,315 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 15:51:44,316 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 15:51:44,316 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 15:51:44,316 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 15:51:44,317 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 15:51:44,318 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 15:51:44,320 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-23 15:51:44,356 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 15:51:44,358 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 15:51:44,359 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 15:51:44,359 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 15:51:44,360 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 15:51:44,360 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 15:51:44,361 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 15:51:44,361 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 15:51:44,361 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 15:51:44,361 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 15:51:44,362 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 15:51:44,363 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 15:51:44,363 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 15:51:44,363 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 15:51:44,363 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 15:51:44,364 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 15:51:44,364 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 15:51:44,364 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 15:51:44,365 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 15:51:44,365 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 15:51:44,366 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 15:51:44,366 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 15:51:44,366 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 15:51:44,366 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 15:51:44,366 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 15:51:44,367 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 15:51:44,367 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 15:51:44,367 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 15:51:44,367 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 15:51:44,368 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 15:51:44,368 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 15:51:44,368 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 15:51:44,368 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 15:51:44,369 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 15:51:44,369 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 15:51:44,369 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 15:51:44,369 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 15:51:44,369 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 15:51:44,370 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 15:51:44,370 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 15:51:44,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 15:51:44,370 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 15:51:44,370 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_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/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_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW 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 -> 9047d35108a9c07c04b519cba211a741bb80887623b2a85c45105c17ca835121 [2022-11-23 15:51:44,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 15:51:44,722 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 15:51:44,724 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 15:51:44,726 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 15:51:44,726 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 15:51:44,728 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/pthread-wmm/safe009_rmo.opt.i [2022-11-23 15:51:47,767 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 15:51:48,076 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 15:51:48,077 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/sv-benchmarks/c/pthread-wmm/safe009_rmo.opt.i [2022-11-23 15:51:48,091 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/data/90ff20748/130ef01263cb46a4a5a5aa481d755fba/FLAGf09022911 [2022-11-23 15:51:48,105 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/data/90ff20748/130ef01263cb46a4a5a5aa481d755fba [2022-11-23 15:51:48,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 15:51:48,109 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 15:51:48,111 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 15:51:48,111 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 15:51:48,115 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 15:51:48,115 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:51:48" (1/1) ... [2022-11-23 15:51:48,116 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16617bec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:48, skipping insertion in model container [2022-11-23 15:51:48,117 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:51:48" (1/1) ... [2022-11-23 15:51:48,124 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 15:51:48,169 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 15:51:48,334 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_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/sv-benchmarks/c/pthread-wmm/safe009_rmo.opt.i[949,962] [2022-11-23 15:51:48,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 15:51:48,609 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 15:51:48,621 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_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/sv-benchmarks/c/pthread-wmm/safe009_rmo.opt.i[949,962] [2022-11-23 15:51:48,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 15:51:48,699 INFO L208 MainTranslator]: Completed translation [2022-11-23 15:51:48,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:48 WrapperNode [2022-11-23 15:51:48,700 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 15:51:48,701 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 15:51:48,701 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 15:51:48,701 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 15:51:48,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:48" (1/1) ... [2022-11-23 15:51:48,733 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:48" (1/1) ... [2022-11-23 15:51:48,756 INFO L138 Inliner]: procedures = 176, calls = 69, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 135 [2022-11-23 15:51:48,757 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 15:51:48,757 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 15:51:48,757 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 15:51:48,758 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 15:51:48,767 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:48" (1/1) ... [2022-11-23 15:51:48,767 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:48" (1/1) ... [2022-11-23 15:51:48,771 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:48" (1/1) ... [2022-11-23 15:51:48,778 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:48" (1/1) ... [2022-11-23 15:51:48,789 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:48" (1/1) ... [2022-11-23 15:51:48,810 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:48" (1/1) ... [2022-11-23 15:51:48,827 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:48" (1/1) ... [2022-11-23 15:51:48,828 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:48" (1/1) ... [2022-11-23 15:51:48,832 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 15:51:48,833 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 15:51:48,833 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 15:51:48,833 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 15:51:48,834 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:48" (1/1) ... [2022-11-23 15:51:48,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 15:51:48,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:51:48,881 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 15:51:48,900 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 15:51:48,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 15:51:48,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 15:51:48,933 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 15:51:48,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 15:51:48,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 15:51:48,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 15:51:48,934 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 15:51:48,934 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 15:51:48,934 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 15:51:48,934 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 15:51:48,934 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-23 15:51:48,934 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-23 15:51:48,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 15:51:48,935 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 15:51:48,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 15:51:48,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 15:51:48,937 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 15:51:49,182 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 15:51:49,186 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 15:51:49,742 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 15:51:50,392 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 15:51:50,392 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 15:51:50,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:51:50 BoogieIcfgContainer [2022-11-23 15:51:50,395 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 15:51:50,398 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 15:51:50,399 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 15:51:50,402 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 15:51:50,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:51:48" (1/3) ... [2022-11-23 15:51:50,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1806dd60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:51:50, skipping insertion in model container [2022-11-23 15:51:50,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:48" (2/3) ... [2022-11-23 15:51:50,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1806dd60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:51:50, skipping insertion in model container [2022-11-23 15:51:50,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:51:50" (3/3) ... [2022-11-23 15:51:50,409 INFO L112 eAbstractionObserver]: Analyzing ICFG safe009_rmo.opt.i [2022-11-23 15:51:50,429 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 15:51:50,429 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 40 error locations. [2022-11-23 15:51:50,430 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 15:51:50,594 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 15:51:50,640 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 15:51:50,659 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 173 transitions, 361 flow [2022-11-23 15:51:50,664 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 181 places, 173 transitions, 361 flow [2022-11-23 15:51:50,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 181 places, 173 transitions, 361 flow [2022-11-23 15:51:50,758 INFO L130 PetriNetUnfolder]: 2/170 cut-off events. [2022-11-23 15:51:50,758 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 15:51:50,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 170 events. 2/170 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 212 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 110. Up to 2 conditions per place. [2022-11-23 15:51:50,770 INFO L119 LiptonReduction]: Number of co-enabled transitions 6064 [2022-11-23 15:52:06,899 INFO L134 LiptonReduction]: Checked pairs total: 28777 [2022-11-23 15:52:06,899 INFO L136 LiptonReduction]: Total number of compositions: 159 [2022-11-23 15:52:06,912 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 69 transitions, 153 flow [2022-11-23 15:52:08,225 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 28926 states, 23318 states have (on average 4.586885667724505) internal successors, (106957), 28925 states have internal predecessors, (106957), 0 states have call successors, (0), 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-23 15:52:08,252 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 15:52:08,261 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;@fc57c0e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 15:52:08,261 INFO L358 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2022-11-23 15:52:08,314 INFO L276 IsEmpty]: Start isEmpty. Operand has 28926 states, 23318 states have (on average 4.586885667724505) internal successors, (106957), 28925 states have internal predecessors, (106957), 0 states have call successors, (0), 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-23 15:52:08,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-23 15:52:08,319 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:52:08,320 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-23 15:52:08,321 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-23 15:52:08,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:52:08,331 INFO L85 PathProgramCache]: Analyzing trace with hash 959, now seen corresponding path program 1 times [2022-11-23 15:52:08,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:52:08,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190553048] [2022-11-23 15:52:08,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:52:08,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:52:08,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:52:08,498 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-23 15:52:08,499 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:52:08,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190553048] [2022-11-23 15:52:08,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190553048] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:52:08,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:52:08,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-23 15:52:08,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360346277] [2022-11-23 15:52:08,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:52:08,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 15:52:08,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:52:08,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 15:52:08,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 15:52:08,578 INFO L87 Difference]: Start difference. First operand has 28926 states, 23318 states have (on average 4.586885667724505) internal successors, (106957), 28925 states have internal predecessors, (106957), 0 states have call successors, (0), 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-23 15:52:09,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:52:09,085 INFO L93 Difference]: Finished difference Result 14910 states and 53713 transitions. [2022-11-23 15:52:09,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 15:52:09,088 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-23 15:52:09,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:52:09,350 INFO L225 Difference]: With dead ends: 14910 [2022-11-23 15:52:09,351 INFO L226 Difference]: Without dead ends: 14910 [2022-11-23 15:52:09,352 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-23 15:52:09,355 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5 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-23 15:52:09,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:52:09,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14910 states. [2022-11-23 15:52:10,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14910 to 14910. [2022-11-23 15:52:10,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14910 states, 12706 states have (on average 4.22737289469542) internal successors, (53713), 14909 states have internal predecessors, (53713), 0 states have call successors, (0), 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-23 15:52:10,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14910 states to 14910 states and 53713 transitions. [2022-11-23 15:52:10,366 INFO L78 Accepts]: Start accepts. Automaton has 14910 states and 53713 transitions. Word has length 1 [2022-11-23 15:52:10,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:52:10,367 INFO L495 AbstractCegarLoop]: Abstraction has 14910 states and 53713 transitions. [2022-11-23 15:52:10,371 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-23 15:52:10,373 INFO L276 IsEmpty]: Start isEmpty. Operand 14910 states and 53713 transitions. [2022-11-23 15:52:10,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-23 15:52:10,373 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:52:10,374 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-23 15:52:10,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 15:52:10,374 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-23 15:52:10,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:52:10,377 INFO L85 PathProgramCache]: Analyzing trace with hash 29302511, now seen corresponding path program 1 times [2022-11-23 15:52:10,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:52:10,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637976580] [2022-11-23 15:52:10,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:52:10,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:52:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:52:10,786 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-23 15:52:10,786 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:52:10,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637976580] [2022-11-23 15:52:10,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637976580] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:52:10,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:52:10,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 15:52:10,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577982108] [2022-11-23 15:52:10,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:52:10,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:52:10,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:52:10,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:52:10,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:52:10,790 INFO L87 Difference]: Start difference. First operand 14910 states and 53713 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-23 15:52:11,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:52:11,278 INFO L93 Difference]: Finished difference Result 7538 states and 26259 transitions. [2022-11-23 15:52:11,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:52:11,279 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-23 15:52:11,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:52:11,353 INFO L225 Difference]: With dead ends: 7538 [2022-11-23 15:52:11,353 INFO L226 Difference]: Without dead ends: 7538 [2022-11-23 15:52:11,354 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-23 15:52:11,355 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 30 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:52:11,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:52:11,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7538 states. [2022-11-23 15:52:11,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7538 to 7538. [2022-11-23 15:52:11,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7538 states, 6809 states have (on average 3.856513438096637) internal successors, (26259), 7537 states have internal predecessors, (26259), 0 states have call successors, (0), 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-23 15:52:11,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7538 states to 7538 states and 26259 transitions. [2022-11-23 15:52:11,769 INFO L78 Accepts]: Start accepts. Automaton has 7538 states and 26259 transitions. Word has length 4 [2022-11-23 15:52:11,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:52:11,770 INFO L495 AbstractCegarLoop]: Abstraction has 7538 states and 26259 transitions. [2022-11-23 15:52:11,770 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-23 15:52:11,771 INFO L276 IsEmpty]: Start isEmpty. Operand 7538 states and 26259 transitions. [2022-11-23 15:52:11,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-23 15:52:11,772 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:52:11,774 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-23 15:52:11,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 15:52:11,775 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-23 15:52:11,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:52:11,778 INFO L85 PathProgramCache]: Analyzing trace with hash 29302512, now seen corresponding path program 1 times [2022-11-23 15:52:11,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:52:11,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868996965] [2022-11-23 15:52:11,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:52:11,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:52:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:52:11,925 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-23 15:52:11,925 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:52:11,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868996965] [2022-11-23 15:52:11,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868996965] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:52:11,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:52:11,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 15:52:11,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594378964] [2022-11-23 15:52:11,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:52:11,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:52:11,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:52:11,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:52:11,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:52:11,927 INFO L87 Difference]: Start difference. First operand 7538 states and 26259 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-23 15:52:12,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:52:12,051 INFO L93 Difference]: Finished difference Result 2320 states and 7657 transitions. [2022-11-23 15:52:12,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:52:12,052 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-23 15:52:12,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:52:12,062 INFO L225 Difference]: With dead ends: 2320 [2022-11-23 15:52:12,062 INFO L226 Difference]: Without dead ends: 2320 [2022-11-23 15:52:12,063 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-23 15:52:12,064 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:52:12,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:52:12,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2320 states. [2022-11-23 15:52:12,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2320 to 2320. [2022-11-23 15:52:12,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2320 states, 2222 states have (on average 3.445994599459946) internal successors, (7657), 2319 states have internal predecessors, (7657), 0 states have call successors, (0), 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-23 15:52:12,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2320 states to 2320 states and 7657 transitions. [2022-11-23 15:52:12,133 INFO L78 Accepts]: Start accepts. Automaton has 2320 states and 7657 transitions. Word has length 4 [2022-11-23 15:52:12,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:52:12,134 INFO L495 AbstractCegarLoop]: Abstraction has 2320 states and 7657 transitions. [2022-11-23 15:52:12,134 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-23 15:52:12,134 INFO L276 IsEmpty]: Start isEmpty. Operand 2320 states and 7657 transitions. [2022-11-23 15:52:12,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-23 15:52:12,136 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:52:12,136 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:52:12,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 15:52:12,136 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-23 15:52:12,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:52:12,137 INFO L85 PathProgramCache]: Analyzing trace with hash -96091917, now seen corresponding path program 1 times [2022-11-23 15:52:12,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:52:12,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198973460] [2022-11-23 15:52:12,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:52:12,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:52:12,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:52:12,357 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-23 15:52:12,357 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:52:12,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198973460] [2022-11-23 15:52:12,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198973460] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:52:12,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:52:12,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 15:52:12,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604738726] [2022-11-23 15:52:12,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:52:12,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:52:12,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:52:12,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:52:12,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:52:12,361 INFO L87 Difference]: Start difference. First operand 2320 states and 7657 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-23 15:52:12,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:52:12,586 INFO L93 Difference]: Finished difference Result 2280 states and 7515 transitions. [2022-11-23 15:52:12,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:52:12,587 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-23 15:52:12,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:52:12,598 INFO L225 Difference]: With dead ends: 2280 [2022-11-23 15:52:12,598 INFO L226 Difference]: Without dead ends: 2280 [2022-11-23 15:52:12,598 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-23 15:52:12,617 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:52:12,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 7 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:52:12,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2280 states. [2022-11-23 15:52:12,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2280 to 2280. [2022-11-23 15:52:12,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2280 states, 2182 states have (on average 3.444087992667278) internal successors, (7515), 2279 states have internal predecessors, (7515), 0 states have call successors, (0), 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-23 15:52:12,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 7515 transitions. [2022-11-23 15:52:12,710 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 7515 transitions. Word has length 10 [2022-11-23 15:52:12,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:52:12,712 INFO L495 AbstractCegarLoop]: Abstraction has 2280 states and 7515 transitions. [2022-11-23 15:52:12,712 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-23 15:52:12,713 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 7515 transitions. [2022-11-23 15:52:12,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-23 15:52:12,716 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:52:12,716 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:52:12,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 15:52:12,716 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-23 15:52:12,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:52:12,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1310380079, now seen corresponding path program 1 times [2022-11-23 15:52:12,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:52:12,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210189247] [2022-11-23 15:52:12,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:52:12,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:52:12,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:52:13,037 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-23 15:52:13,038 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:52:13,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210189247] [2022-11-23 15:52:13,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210189247] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:52:13,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:52:13,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 15:52:13,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155870576] [2022-11-23 15:52:13,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:52:13,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:52:13,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:52:13,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:52:13,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:52:13,046 INFO L87 Difference]: Start difference. First operand 2280 states and 7515 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-23 15:52:13,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:52:13,301 INFO L93 Difference]: Finished difference Result 3944 states and 12961 transitions. [2022-11-23 15:52:13,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:52:13,301 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-23 15:52:13,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:52:13,320 INFO L225 Difference]: With dead ends: 3944 [2022-11-23 15:52:13,321 INFO L226 Difference]: Without dead ends: 3944 [2022-11-23 15:52:13,321 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-23 15:52:13,322 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 21 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:52:13,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 5 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:52:13,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3944 states. [2022-11-23 15:52:13,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3944 to 2480. [2022-11-23 15:52:13,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2480 states, 2382 states have (on average 3.4529806884970613) internal successors, (8225), 2479 states have internal predecessors, (8225), 0 states have call successors, (0), 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-23 15:52:13,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2480 states to 2480 states and 8225 transitions. [2022-11-23 15:52:13,541 INFO L78 Accepts]: Start accepts. Automaton has 2480 states and 8225 transitions. Word has length 11 [2022-11-23 15:52:13,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:52:13,541 INFO L495 AbstractCegarLoop]: Abstraction has 2480 states and 8225 transitions. [2022-11-23 15:52:13,541 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-23 15:52:13,541 INFO L276 IsEmpty]: Start isEmpty. Operand 2480 states and 8225 transitions. [2022-11-23 15:52:13,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-23 15:52:13,542 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:52:13,543 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:52:13,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 15:52:13,543 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-23 15:52:13,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:52:13,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1310380080, now seen corresponding path program 1 times [2022-11-23 15:52:13,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:52:13,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089358175] [2022-11-23 15:52:13,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:52:13,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:52:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:52:13,991 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-23 15:52:13,992 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:52:13,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089358175] [2022-11-23 15:52:13,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089358175] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:52:13,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:52:13,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 15:52:13,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012909356] [2022-11-23 15:52:13,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:52:13,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:52:13,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:52:13,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:52:13,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:52:13,994 INFO L87 Difference]: Start difference. First operand 2480 states and 8225 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-23 15:52:14,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:52:14,208 INFO L93 Difference]: Finished difference Result 3864 states and 12697 transitions. [2022-11-23 15:52:14,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 15:52:14,208 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-23 15:52:14,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:52:14,230 INFO L225 Difference]: With dead ends: 3864 [2022-11-23 15:52:14,230 INFO L226 Difference]: Without dead ends: 3864 [2022-11-23 15:52:14,230 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-23 15:52:14,231 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 52 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:52:14,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 4 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:52:14,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3864 states. [2022-11-23 15:52:14,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3864 to 2480. [2022-11-23 15:52:14,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2480 states, 2382 states have (on average 3.4193954659949624) internal successors, (8145), 2479 states have internal predecessors, (8145), 0 states have call successors, (0), 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-23 15:52:14,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2480 states to 2480 states and 8145 transitions. [2022-11-23 15:52:14,352 INFO L78 Accepts]: Start accepts. Automaton has 2480 states and 8145 transitions. Word has length 11 [2022-11-23 15:52:14,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:52:14,353 INFO L495 AbstractCegarLoop]: Abstraction has 2480 states and 8145 transitions. [2022-11-23 15:52:14,353 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-23 15:52:14,353 INFO L276 IsEmpty]: Start isEmpty. Operand 2480 states and 8145 transitions. [2022-11-23 15:52:14,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-23 15:52:14,354 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:52:14,355 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:52:14,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 15:52:14,355 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-23 15:52:14,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:52:14,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1316112808, now seen corresponding path program 1 times [2022-11-23 15:52:14,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:52:14,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832084604] [2022-11-23 15:52:14,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:52:14,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:52:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:52:14,611 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-23 15:52:14,611 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:52:14,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832084604] [2022-11-23 15:52:14,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832084604] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:52:14,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:52:14,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 15:52:14,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157306590] [2022-11-23 15:52:14,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:52:14,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:52:14,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:52:14,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:52:14,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:52:14,613 INFO L87 Difference]: Start difference. First operand 2480 states and 8145 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-23 15:52:14,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:52:14,817 INFO L93 Difference]: Finished difference Result 2475 states and 8126 transitions. [2022-11-23 15:52:14,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:52:14,817 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-23 15:52:14,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:52:14,828 INFO L225 Difference]: With dead ends: 2475 [2022-11-23 15:52:14,829 INFO L226 Difference]: Without dead ends: 2475 [2022-11-23 15:52:14,829 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-23 15:52:14,830 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 13 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:52:14,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 6 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:52:14,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2475 states. [2022-11-23 15:52:14,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2475 to 2475. [2022-11-23 15:52:14,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2475 states, 2377 states have (on average 3.418594867480017) internal successors, (8126), 2474 states have internal predecessors, (8126), 0 states have call successors, (0), 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-23 15:52:14,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 8126 transitions. [2022-11-23 15:52:14,898 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 8126 transitions. Word has length 11 [2022-11-23 15:52:14,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:52:14,898 INFO L495 AbstractCegarLoop]: Abstraction has 2475 states and 8126 transitions. [2022-11-23 15:52:14,898 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-23 15:52:14,898 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 8126 transitions. [2022-11-23 15:52:14,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-23 15:52:14,901 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:52:14,901 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:52:14,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 15:52:14,902 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-23 15:52:14,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:52:14,904 INFO L85 PathProgramCache]: Analyzing trace with hash -379663351, now seen corresponding path program 2 times [2022-11-23 15:52:14,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:52:14,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019771329] [2022-11-23 15:52:14,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:52:14,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:52:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:52:15,107 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-23 15:52:15,107 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:52:15,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019771329] [2022-11-23 15:52:15,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019771329] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:52:15,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:52:15,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:52:15,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699820595] [2022-11-23 15:52:15,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:52:15,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:52:15,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:52:15,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:52:15,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:52:15,109 INFO L87 Difference]: Start difference. First operand 2475 states and 8126 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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-23 15:52:15,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:52:15,258 INFO L93 Difference]: Finished difference Result 2395 states and 7862 transitions. [2022-11-23 15:52:15,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:52:15,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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-23 15:52:15,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:52:15,269 INFO L225 Difference]: With dead ends: 2395 [2022-11-23 15:52:15,269 INFO L226 Difference]: Without dead ends: 2395 [2022-11-23 15:52:15,269 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-23 15:52:15,270 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 29 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:52:15,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 5 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:52:15,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2395 states. [2022-11-23 15:52:15,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2395 to 2395. [2022-11-23 15:52:15,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2395 states, 2298 states have (on average 3.421235857267189) internal successors, (7862), 2394 states have internal predecessors, (7862), 0 states have call successors, (0), 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-23 15:52:15,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2395 states to 2395 states and 7862 transitions. [2022-11-23 15:52:15,335 INFO L78 Accepts]: Start accepts. Automaton has 2395 states and 7862 transitions. Word has length 11 [2022-11-23 15:52:15,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:52:15,335 INFO L495 AbstractCegarLoop]: Abstraction has 2395 states and 7862 transitions. [2022-11-23 15:52:15,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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-23 15:52:15,336 INFO L276 IsEmpty]: Start isEmpty. Operand 2395 states and 7862 transitions. [2022-11-23 15:52:15,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-23 15:52:15,336 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:52:15,336 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:52:15,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 15:52:15,337 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-23 15:52:15,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:52:15,337 INFO L85 PathProgramCache]: Analyzing trace with hash -379663350, now seen corresponding path program 2 times [2022-11-23 15:52:15,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:52:15,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092096373] [2022-11-23 15:52:15,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:52:15,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:52:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:52:15,674 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-23 15:52:15,675 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:52:15,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092096373] [2022-11-23 15:52:15,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092096373] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:52:15,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:52:15,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:52:15,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275425907] [2022-11-23 15:52:15,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:52:15,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 15:52:15,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:52:15,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 15:52:15,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:52:15,677 INFO L87 Difference]: Start difference. First operand 2395 states and 7862 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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-23 15:52:15,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:52:15,897 INFO L93 Difference]: Finished difference Result 2315 states and 7598 transitions. [2022-11-23 15:52:15,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 15:52:15,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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-23 15:52:15,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:52:15,908 INFO L225 Difference]: With dead ends: 2315 [2022-11-23 15:52:15,909 INFO L226 Difference]: Without dead ends: 2315 [2022-11-23 15:52:15,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-23 15:52:15,910 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 54 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:52:15,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:52:15,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2315 states. [2022-11-23 15:52:15,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2315 to 2115. [2022-11-23 15:52:15,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2115 states, 2019 states have (on average 3.4512134720158496) internal successors, (6968), 2114 states have internal predecessors, (6968), 0 states have call successors, (0), 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-23 15:52:15,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2115 states to 2115 states and 6968 transitions. [2022-11-23 15:52:15,973 INFO L78 Accepts]: Start accepts. Automaton has 2115 states and 6968 transitions. Word has length 11 [2022-11-23 15:52:15,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:52:15,974 INFO L495 AbstractCegarLoop]: Abstraction has 2115 states and 6968 transitions. [2022-11-23 15:52:15,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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-23 15:52:15,974 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 6968 transitions. [2022-11-23 15:52:15,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-23 15:52:15,975 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:52:15,975 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:52:15,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 15:52:15,975 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-23 15:52:15,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:52:15,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1967071724, now seen corresponding path program 1 times [2022-11-23 15:52:15,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:52:15,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082802617] [2022-11-23 15:52:15,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:52:15,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:52:16,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:52:16,194 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-23 15:52:16,194 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:52:16,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082802617] [2022-11-23 15:52:16,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082802617] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:52:16,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:52:16,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 15:52:16,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541012972] [2022-11-23 15:52:16,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:52:16,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:52:16,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:52:16,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:52:16,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:52:16,196 INFO L87 Difference]: Start difference. First operand 2115 states and 6968 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 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-23 15:52:16,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:52:16,308 INFO L93 Difference]: Finished difference Result 2096 states and 6901 transitions. [2022-11-23 15:52:16,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:52:16,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 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-23 15:52:16,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:52:16,318 INFO L225 Difference]: With dead ends: 2096 [2022-11-23 15:52:16,318 INFO L226 Difference]: Without dead ends: 2096 [2022-11-23 15:52:16,319 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-23 15:52:16,319 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 16 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 8 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-23 15:52:16,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 8 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:52:16,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2096 states. [2022-11-23 15:52:16,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2096 to 2096. [2022-11-23 15:52:16,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2096 states, 2000 states have (on average 3.4505) internal successors, (6901), 2095 states have internal predecessors, (6901), 0 states have call successors, (0), 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-23 15:52:16,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2096 states to 2096 states and 6901 transitions. [2022-11-23 15:52:16,378 INFO L78 Accepts]: Start accepts. Automaton has 2096 states and 6901 transitions. Word has length 12 [2022-11-23 15:52:16,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:52:16,378 INFO L495 AbstractCegarLoop]: Abstraction has 2096 states and 6901 transitions. [2022-11-23 15:52:16,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 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-23 15:52:16,379 INFO L276 IsEmpty]: Start isEmpty. Operand 2096 states and 6901 transitions. [2022-11-23 15:52:16,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 15:52:16,380 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:52:16,380 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:52:16,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 15:52:16,380 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-23 15:52:16,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:52:16,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1610194799, now seen corresponding path program 1 times [2022-11-23 15:52:16,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:52:16,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185992013] [2022-11-23 15:52:16,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:52:16,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:52:16,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:52:16,592 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-23 15:52:16,592 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:52:16,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185992013] [2022-11-23 15:52:16,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185992013] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:52:16,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:52:16,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 15:52:16,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78222471] [2022-11-23 15:52:16,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:52:16,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:52:16,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:52:16,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:52:16,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:52:16,594 INFO L87 Difference]: Start difference. First operand 2096 states and 6901 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 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-23 15:52:16,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:52:16,704 INFO L93 Difference]: Finished difference Result 2092 states and 6886 transitions. [2022-11-23 15:52:16,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:52:16,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 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-23 15:52:16,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:52:16,715 INFO L225 Difference]: With dead ends: 2092 [2022-11-23 15:52:16,715 INFO L226 Difference]: Without dead ends: 2092 [2022-11-23 15:52:16,715 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-23 15:52:16,716 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 12 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:52:16,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 6 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:52:16,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2092 states. [2022-11-23 15:52:16,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2092 to 2092. [2022-11-23 15:52:16,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2092 states, 1996 states have (on average 3.4498997995991982) internal successors, (6886), 2091 states have internal predecessors, (6886), 0 states have call successors, (0), 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-23 15:52:16,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2092 states to 2092 states and 6886 transitions. [2022-11-23 15:52:16,778 INFO L78 Accepts]: Start accepts. Automaton has 2092 states and 6886 transitions. Word has length 13 [2022-11-23 15:52:16,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:52:16,779 INFO L495 AbstractCegarLoop]: Abstraction has 2092 states and 6886 transitions. [2022-11-23 15:52:16,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 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-23 15:52:16,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2092 states and 6886 transitions. [2022-11-23 15:52:16,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 15:52:16,780 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:52:16,780 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:52:16,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 15:52:16,781 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-23 15:52:16,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:52:16,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1787911940, now seen corresponding path program 1 times [2022-11-23 15:52:16,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:52:16,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283770918] [2022-11-23 15:52:16,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:52:16,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:52:16,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:52:17,076 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-23 15:52:17,077 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:52:17,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283770918] [2022-11-23 15:52:17,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283770918] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:52:17,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:52:17,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 15:52:17,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220604632] [2022-11-23 15:52:17,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:52:17,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:52:17,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:52:17,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:52:17,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:52:17,080 INFO L87 Difference]: Start difference. First operand 2092 states and 6886 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) 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-23 15:52:17,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:52:17,252 INFO L93 Difference]: Finished difference Result 2420 states and 8004 transitions. [2022-11-23 15:52:17,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 15:52:17,252 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) 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-23 15:52:17,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:52:17,265 INFO L225 Difference]: With dead ends: 2420 [2022-11-23 15:52:17,265 INFO L226 Difference]: Without dead ends: 2420 [2022-11-23 15:52:17,266 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-23 15:52:17,266 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 50 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:52:17,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 11 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:52:17,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2420 states. [2022-11-23 15:52:17,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2420 to 2128. [2022-11-23 15:52:17,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2128 states, 2032 states have (on average 3.4493110236220472) internal successors, (7009), 2127 states have internal predecessors, (7009), 0 states have call successors, (0), 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-23 15:52:17,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2128 states to 2128 states and 7009 transitions. [2022-11-23 15:52:17,346 INFO L78 Accepts]: Start accepts. Automaton has 2128 states and 7009 transitions. Word has length 13 [2022-11-23 15:52:17,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:52:17,346 INFO L495 AbstractCegarLoop]: Abstraction has 2128 states and 7009 transitions. [2022-11-23 15:52:17,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) 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-23 15:52:17,347 INFO L276 IsEmpty]: Start isEmpty. Operand 2128 states and 7009 transitions. [2022-11-23 15:52:17,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 15:52:17,348 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:52:17,348 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:52:17,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-23 15:52:17,349 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-23 15:52:17,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:52:17,349 INFO L85 PathProgramCache]: Analyzing trace with hash 2064049971, now seen corresponding path program 1 times [2022-11-23 15:52:17,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:52:17,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531569750] [2022-11-23 15:52:17,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:52:17,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:52:17,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:52:17,543 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-23 15:52:17,543 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:52:17,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531569750] [2022-11-23 15:52:17,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531569750] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:52:17,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:52:17,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:52:17,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550226076] [2022-11-23 15:52:17,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:52:17,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 15:52:17,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:52:17,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 15:52:17,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:52:17,546 INFO L87 Difference]: Start difference. First operand 2128 states and 7009 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-23 15:52:17,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:52:17,687 INFO L93 Difference]: Finished difference Result 1844 states and 5968 transitions. [2022-11-23 15:52:17,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:52:17,688 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-23 15:52:17,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:52:17,697 INFO L225 Difference]: With dead ends: 1844 [2022-11-23 15:52:17,697 INFO L226 Difference]: Without dead ends: 1844 [2022-11-23 15:52:17,698 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-23 15:52:17,698 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 53 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:52:17,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:52:17,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2022-11-23 15:52:17,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1844. [2022-11-23 15:52:17,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1844 states, 1748 states have (on average 3.414187643020595) internal successors, (5968), 1843 states have internal predecessors, (5968), 0 states have call successors, (0), 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-23 15:52:17,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1844 states and 5968 transitions. [2022-11-23 15:52:17,766 INFO L78 Accepts]: Start accepts. Automaton has 1844 states and 5968 transitions. Word has length 13 [2022-11-23 15:52:17,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:52:17,767 INFO L495 AbstractCegarLoop]: Abstraction has 1844 states and 5968 transitions. [2022-11-23 15:52:17,767 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-23 15:52:17,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 5968 transitions. [2022-11-23 15:52:17,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 15:52:17,769 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:52:17,769 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:52:17,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-23 15:52:17,769 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-23 15:52:17,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:52:17,770 INFO L85 PathProgramCache]: Analyzing trace with hash 2063944530, now seen corresponding path program 2 times [2022-11-23 15:52:17,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:52:17,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960319632] [2022-11-23 15:52:17,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:52:17,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:52:17,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:52:18,015 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-23 15:52:18,016 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:52:18,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960319632] [2022-11-23 15:52:18,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960319632] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:52:18,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:52:18,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 15:52:18,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249904909] [2022-11-23 15:52:18,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:52:18,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:52:18,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:52:18,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:52:18,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:52:18,018 INFO L87 Difference]: Start difference. First operand 1844 states and 5968 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 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-23 15:52:18,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:52:18,136 INFO L93 Difference]: Finished difference Result 1832 states and 5927 transitions. [2022-11-23 15:52:18,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:52:18,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 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-23 15:52:18,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:52:18,146 INFO L225 Difference]: With dead ends: 1832 [2022-11-23 15:52:18,147 INFO L226 Difference]: Without dead ends: 1832 [2022-11-23 15:52:18,147 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-23 15:52:18,148 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:52:18,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 7 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:52:18,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832 states. [2022-11-23 15:52:18,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832 to 1796. [2022-11-23 15:52:18,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1796 states, 1700 states have (on average 3.4141176470588235) internal successors, (5804), 1795 states have internal predecessors, (5804), 0 states have call successors, (0), 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-23 15:52:18,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1796 states and 5804 transitions. [2022-11-23 15:52:18,214 INFO L78 Accepts]: Start accepts. Automaton has 1796 states and 5804 transitions. Word has length 13 [2022-11-23 15:52:18,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:52:18,215 INFO L495 AbstractCegarLoop]: Abstraction has 1796 states and 5804 transitions. [2022-11-23 15:52:18,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 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-23 15:52:18,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 5804 transitions. [2022-11-23 15:52:18,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-23 15:52:18,217 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:52:18,217 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:52:18,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-23 15:52:18,217 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-23 15:52:18,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:52:18,218 INFO L85 PathProgramCache]: Analyzing trace with hash 375121679, now seen corresponding path program 1 times [2022-11-23 15:52:18,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:52:18,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296676747] [2022-11-23 15:52:18,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:52:18,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:52:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:52:18,467 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-23 15:52:18,468 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:52:18,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296676747] [2022-11-23 15:52:18,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296676747] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:52:18,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:52:18,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 15:52:18,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071417830] [2022-11-23 15:52:18,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:52:18,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:52:18,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:52:18,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:52:18,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:52:18,470 INFO L87 Difference]: Start difference. First operand 1796 states and 5804 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 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-23 15:52:18,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:52:18,620 INFO L93 Difference]: Finished difference Result 2637 states and 8396 transitions. [2022-11-23 15:52:18,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:52:18,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 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-23 15:52:18,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:52:18,635 INFO L225 Difference]: With dead ends: 2637 [2022-11-23 15:52:18,635 INFO L226 Difference]: Without dead ends: 2637 [2022-11-23 15:52:18,635 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-23 15:52:18,636 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:52:18,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 9 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:52:18,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2637 states. [2022-11-23 15:52:18,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2637 to 1919. [2022-11-23 15:52:18,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1919 states, 1823 states have (on average 3.3933077345035656) internal successors, (6186), 1918 states have internal predecessors, (6186), 0 states have call successors, (0), 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-23 15:52:18,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1919 states to 1919 states and 6186 transitions. [2022-11-23 15:52:18,719 INFO L78 Accepts]: Start accepts. Automaton has 1919 states and 6186 transitions. Word has length 14 [2022-11-23 15:52:18,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:52:18,719 INFO L495 AbstractCegarLoop]: Abstraction has 1919 states and 6186 transitions. [2022-11-23 15:52:18,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 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-23 15:52:18,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1919 states and 6186 transitions. [2022-11-23 15:52:18,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-23 15:52:18,721 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:52:18,722 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:52:18,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-23 15:52:18,722 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-23 15:52:18,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:52:18,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1623571302, now seen corresponding path program 1 times [2022-11-23 15:52:18,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:52:18,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667092382] [2022-11-23 15:52:18,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:52:18,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:52:18,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:52:18,978 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-23 15:52:18,978 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:52:18,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667092382] [2022-11-23 15:52:18,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667092382] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:52:18,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:52:18,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 15:52:18,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526821018] [2022-11-23 15:52:18,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:52:18,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:52:18,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:52:18,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:52:18,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:52:18,981 INFO L87 Difference]: Start difference. First operand 1919 states and 6186 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-23 15:52:19,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:52:19,169 INFO L93 Difference]: Finished difference Result 3360 states and 10780 transitions. [2022-11-23 15:52:19,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 15:52:19,170 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-23 15:52:19,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:52:19,187 INFO L225 Difference]: With dead ends: 3360 [2022-11-23 15:52:19,187 INFO L226 Difference]: Without dead ends: 3360 [2022-11-23 15:52:19,187 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-23 15:52:19,188 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 57 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:52:19,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 9 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:52:19,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3360 states. [2022-11-23 15:52:19,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3360 to 2063. [2022-11-23 15:52:19,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2063 states, 1967 states have (on average 3.376715810879512) internal successors, (6642), 2062 states have internal predecessors, (6642), 0 states have call successors, (0), 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-23 15:52:19,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2063 states to 2063 states and 6642 transitions. [2022-11-23 15:52:19,279 INFO L78 Accepts]: Start accepts. Automaton has 2063 states and 6642 transitions. Word has length 14 [2022-11-23 15:52:19,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:52:19,280 INFO L495 AbstractCegarLoop]: Abstraction has 2063 states and 6642 transitions. [2022-11-23 15:52:19,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-23 15:52:19,280 INFO L276 IsEmpty]: Start isEmpty. Operand 2063 states and 6642 transitions. [2022-11-23 15:52:19,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-23 15:52:19,282 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:52:19,282 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:52:19,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-23 15:52:19,283 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-23 15:52:19,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:52:19,285 INFO L85 PathProgramCache]: Analyzing trace with hash 570237590, now seen corresponding path program 2 times [2022-11-23 15:52:19,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:52:19,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116969855] [2022-11-23 15:52:19,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:52:19,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:52:19,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:52:21,012 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-23 15:52:21,012 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:52:21,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116969855] [2022-11-23 15:52:21,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116969855] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:52:21,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:52:21,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 15:52:21,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126408049] [2022-11-23 15:52:21,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:52:21,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 15:52:21,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:52:21,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 15:52:21,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-23 15:52:21,015 INFO L87 Difference]: Start difference. First operand 2063 states and 6642 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-23 15:52:21,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:52:21,562 INFO L93 Difference]: Finished difference Result 2191 states and 6975 transitions. [2022-11-23 15:52:21,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-23 15:52:21,563 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-23 15:52:21,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:52:21,573 INFO L225 Difference]: With dead ends: 2191 [2022-11-23 15:52:21,573 INFO L226 Difference]: Without dead ends: 2191 [2022-11-23 15:52:21,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-11-23 15:52:21,574 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 71 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 15:52:21,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 10 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 15:52:21,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2191 states. [2022-11-23 15:52:21,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2191 to 2047. [2022-11-23 15:52:21,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2047 states, 1951 states have (on average 3.3659661711942594) internal successors, (6567), 2046 states have internal predecessors, (6567), 0 states have call successors, (0), 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-23 15:52:21,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2047 states to 2047 states and 6567 transitions. [2022-11-23 15:52:21,631 INFO L78 Accepts]: Start accepts. Automaton has 2047 states and 6567 transitions. Word has length 14 [2022-11-23 15:52:21,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:52:21,632 INFO L495 AbstractCegarLoop]: Abstraction has 2047 states and 6567 transitions. [2022-11-23 15:52:21,632 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-23 15:52:21,632 INFO L276 IsEmpty]: Start isEmpty. Operand 2047 states and 6567 transitions. [2022-11-23 15:52:21,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-23 15:52:21,634 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:52:21,634 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:52:21,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-23 15:52:21,634 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-23 15:52:21,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:52:21,635 INFO L85 PathProgramCache]: Analyzing trace with hash -438958228, now seen corresponding path program 1 times [2022-11-23 15:52:21,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:52:21,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842162049] [2022-11-23 15:52:21,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:52:21,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:52:21,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:52:22,256 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-23 15:52:22,256 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:52:22,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842162049] [2022-11-23 15:52:22,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842162049] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:52:22,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:52:22,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-23 15:52:22,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820303544] [2022-11-23 15:52:22,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:52:22,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 15:52:22,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:52:22,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 15:52:22,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-23 15:52:22,258 INFO L87 Difference]: Start difference. First operand 2047 states and 6567 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 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-23 15:52:22,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:52:22,939 INFO L93 Difference]: Finished difference Result 2942 states and 9461 transitions. [2022-11-23 15:52:22,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 15:52:22,939 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 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-23 15:52:22,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:52:22,953 INFO L225 Difference]: With dead ends: 2942 [2022-11-23 15:52:22,953 INFO L226 Difference]: Without dead ends: 2894 [2022-11-23 15:52:22,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-23 15:52:22,954 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 87 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-23 15:52:22,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 22 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-23 15:52:22,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2894 states. [2022-11-23 15:52:23,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2894 to 2850. [2022-11-23 15:52:23,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2850 states, 2766 states have (on average 3.3174258857556036) internal successors, (9176), 2849 states have internal predecessors, (9176), 0 states have call successors, (0), 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-23 15:52:23,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2850 states to 2850 states and 9176 transitions. [2022-11-23 15:52:23,031 INFO L78 Accepts]: Start accepts. Automaton has 2850 states and 9176 transitions. Word has length 14 [2022-11-23 15:52:23,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:52:23,031 INFO L495 AbstractCegarLoop]: Abstraction has 2850 states and 9176 transitions. [2022-11-23 15:52:23,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 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-23 15:52:23,031 INFO L276 IsEmpty]: Start isEmpty. Operand 2850 states and 9176 transitions. [2022-11-23 15:52:23,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-23 15:52:23,034 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:52:23,034 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:52:23,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-23 15:52:23,034 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-23 15:52:23,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:52:23,035 INFO L85 PathProgramCache]: Analyzing trace with hash -438958291, now seen corresponding path program 1 times [2022-11-23 15:52:23,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:52:23,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88721196] [2022-11-23 15:52:23,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:52:23,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:52:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:52:23,314 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-23 15:52:23,314 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:52:23,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88721196] [2022-11-23 15:52:23,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88721196] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:52:23,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:52:23,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 15:52:23,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235911173] [2022-11-23 15:52:23,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:52:23,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 15:52:23,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:52:23,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 15:52:23,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-23 15:52:23,317 INFO L87 Difference]: Start difference. First operand 2850 states and 9176 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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-23 15:52:23,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:52:23,493 INFO L93 Difference]: Finished difference Result 2382 states and 7279 transitions. [2022-11-23 15:52:23,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 15:52:23,493 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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-23 15:52:23,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:52:23,502 INFO L225 Difference]: With dead ends: 2382 [2022-11-23 15:52:23,503 INFO L226 Difference]: Without dead ends: 2382 [2022-11-23 15:52:23,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-23 15:52:23,504 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 65 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:52:23,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 6 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:52:23,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2382 states. [2022-11-23 15:52:23,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2382 to 2382. [2022-11-23 15:52:23,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2382 states, 2298 states have (on average 3.167536988685814) internal successors, (7279), 2381 states have internal predecessors, (7279), 0 states have call successors, (0), 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-23 15:52:23,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2382 states to 2382 states and 7279 transitions. [2022-11-23 15:52:23,563 INFO L78 Accepts]: Start accepts. Automaton has 2382 states and 7279 transitions. Word has length 14 [2022-11-23 15:52:23,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:52:23,563 INFO L495 AbstractCegarLoop]: Abstraction has 2382 states and 7279 transitions. [2022-11-23 15:52:23,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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-23 15:52:23,564 INFO L276 IsEmpty]: Start isEmpty. Operand 2382 states and 7279 transitions. [2022-11-23 15:52:23,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-23 15:52:23,567 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:52:23,567 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:52:23,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-23 15:52:23,567 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-23 15:52:23,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:52:23,568 INFO L85 PathProgramCache]: Analyzing trace with hash 497491727, now seen corresponding path program 1 times [2022-11-23 15:52:23,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:52:23,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108192489] [2022-11-23 15:52:23,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:52:23,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:52:23,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:52:23,743 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-23 15:52:23,743 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:52:23,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108192489] [2022-11-23 15:52:23,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108192489] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:52:23,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:52:23,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 15:52:23,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401881066] [2022-11-23 15:52:23,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:52:23,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:52:23,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:52:23,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:52:23,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:52:23,746 INFO L87 Difference]: Start difference. First operand 2382 states and 7279 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-23 15:52:23,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:52:23,839 INFO L93 Difference]: Finished difference Result 1409 states and 3630 transitions. [2022-11-23 15:52:23,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:52:23,842 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-23 15:52:23,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:52:23,847 INFO L225 Difference]: With dead ends: 1409 [2022-11-23 15:52:23,847 INFO L226 Difference]: Without dead ends: 1409 [2022-11-23 15:52:23,847 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-23 15:52:23,848 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 7 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 8 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-23 15:52:23,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 8 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:52:23,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2022-11-23 15:52:23,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1409. [2022-11-23 15:52:23,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1409 states, 1355 states have (on average 2.678966789667897) internal successors, (3630), 1408 states have internal predecessors, (3630), 0 states have call successors, (0), 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-23 15:52:23,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1409 states to 1409 states and 3630 transitions. [2022-11-23 15:52:23,889 INFO L78 Accepts]: Start accepts. Automaton has 1409 states and 3630 transitions. Word has length 15 [2022-11-23 15:52:23,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:52:23,889 INFO L495 AbstractCegarLoop]: Abstraction has 1409 states and 3630 transitions. [2022-11-23 15:52:23,890 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-23 15:52:23,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1409 states and 3630 transitions. [2022-11-23 15:52:23,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-23 15:52:23,892 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:52:23,892 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:52:23,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-23 15:52:23,894 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-23 15:52:23,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:52:23,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1589867944, now seen corresponding path program 1 times [2022-11-23 15:52:23,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:52:23,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518371031] [2022-11-23 15:52:23,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:52:23,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:52:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:52:26,521 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-23 15:52:26,521 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:52:26,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518371031] [2022-11-23 15:52:26,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518371031] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:52:26,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:52:26,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-23 15:52:26,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968666188] [2022-11-23 15:52:26,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:52:26,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 15:52:26,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:52:26,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 15:52:26,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-23 15:52:26,523 INFO L87 Difference]: Start difference. First operand 1409 states and 3630 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-23 15:52:27,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:52:27,499 INFO L93 Difference]: Finished difference Result 1470 states and 3763 transitions. [2022-11-23 15:52:27,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 15:52:27,499 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-23 15:52:27,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:52:27,504 INFO L225 Difference]: With dead ends: 1470 [2022-11-23 15:52:27,504 INFO L226 Difference]: Without dead ends: 1470 [2022-11-23 15:52:27,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2022-11-23 15:52:27,504 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 103 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 15:52:27,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 11 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 15:52:27,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1470 states. [2022-11-23 15:52:27,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1470 to 1430. [2022-11-23 15:52:27,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1430 states, 1378 states have (on average 2.6683599419448476) internal successors, (3677), 1429 states have internal predecessors, (3677), 0 states have call successors, (0), 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-23 15:52:27,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 3677 transitions. [2022-11-23 15:52:27,535 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 3677 transitions. Word has length 16 [2022-11-23 15:52:27,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:52:27,536 INFO L495 AbstractCegarLoop]: Abstraction has 1430 states and 3677 transitions. [2022-11-23 15:52:27,536 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-23 15:52:27,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 3677 transitions. [2022-11-23 15:52:27,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-23 15:52:27,538 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:52:27,538 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:52:27,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-23 15:52:27,539 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-23 15:52:27,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:52:27,539 INFO L85 PathProgramCache]: Analyzing trace with hash 792589689, now seen corresponding path program 1 times [2022-11-23 15:52:27,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:52:27,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192206133] [2022-11-23 15:52:27,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:52:27,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:52:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:52:27,774 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-23 15:52:27,775 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:52:27,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192206133] [2022-11-23 15:52:27,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192206133] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:52:27,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:52:27,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:52:27,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244793456] [2022-11-23 15:52:27,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:52:27,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:52:27,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:52:27,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:52:27,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:52:27,778 INFO L87 Difference]: Start difference. First operand 1430 states and 3677 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-23 15:52:27,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:52:27,909 INFO L93 Difference]: Finished difference Result 697 states and 1559 transitions. [2022-11-23 15:52:27,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 15:52:27,909 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-23 15:52:27,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:52:27,911 INFO L225 Difference]: With dead ends: 697 [2022-11-23 15:52:27,911 INFO L226 Difference]: Without dead ends: 697 [2022-11-23 15:52:27,912 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-23 15:52:27,912 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 29 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:52:27,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 11 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:52:27,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2022-11-23 15:52:27,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 697. [2022-11-23 15:52:27,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 680 states have (on average 2.2926470588235293) internal successors, (1559), 696 states have internal predecessors, (1559), 0 states have call successors, (0), 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-23 15:52:27,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1559 transitions. [2022-11-23 15:52:27,926 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1559 transitions. Word has length 17 [2022-11-23 15:52:27,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:52:27,926 INFO L495 AbstractCegarLoop]: Abstraction has 697 states and 1559 transitions. [2022-11-23 15:52:27,926 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-23 15:52:27,926 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1559 transitions. [2022-11-23 15:52:27,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-23 15:52:27,928 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:52:27,928 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-23 15:52:27,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-23 15:52:27,928 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-23 15:52:27,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:52:27,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1334003467, now seen corresponding path program 1 times [2022-11-23 15:52:27,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:52:27,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472067175] [2022-11-23 15:52:27,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:52:27,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:52:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:52:28,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-23 15:52:28,217 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:52:28,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472067175] [2022-11-23 15:52:28,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472067175] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:52:28,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:52:28,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 15:52:28,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178023142] [2022-11-23 15:52:28,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:52:28,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 15:52:28,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:52:28,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 15:52:28,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:52:28,220 INFO L87 Difference]: Start difference. First operand 697 states and 1559 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-23 15:52:28,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:52:28,325 INFO L93 Difference]: Finished difference Result 525 states and 1216 transitions. [2022-11-23 15:52:28,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 15:52:28,325 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-23 15:52:28,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:52:28,327 INFO L225 Difference]: With dead ends: 525 [2022-11-23 15:52:28,327 INFO L226 Difference]: Without dead ends: 374 [2022-11-23 15:52:28,327 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-23 15:52:28,327 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 68 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:52:28,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 8 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:52:28,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-11-23 15:52:28,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 362. [2022-11-23 15:52:28,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 360 states have (on average 2.272222222222222) internal successors, (818), 361 states have internal predecessors, (818), 0 states have call successors, (0), 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-23 15:52:28,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 818 transitions. [2022-11-23 15:52:28,334 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 818 transitions. Word has length 19 [2022-11-23 15:52:28,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:52:28,335 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 818 transitions. [2022-11-23 15:52:28,335 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-23 15:52:28,335 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 818 transitions. [2022-11-23 15:52:28,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-23 15:52:28,336 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:52:28,336 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:52:28,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-23 15:52:28,337 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-23 15:52:28,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:52:28,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1110903817, now seen corresponding path program 1 times [2022-11-23 15:52:28,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:52:28,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217945529] [2022-11-23 15:52:28,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:52:28,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:52:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:52:28,606 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-23 15:52:28,606 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:52:28,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217945529] [2022-11-23 15:52:28,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217945529] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:52:28,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:52:28,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:52:28,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630275613] [2022-11-23 15:52:28,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:52:28,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:52:28,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:52:28,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:52:28,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:52:28,611 INFO L87 Difference]: Start difference. First operand 362 states and 818 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:52:28,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:52:28,795 INFO L93 Difference]: Finished difference Result 526 states and 1138 transitions. [2022-11-23 15:52:28,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 15:52:28,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-23 15:52:28,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:52:28,797 INFO L225 Difference]: With dead ends: 526 [2022-11-23 15:52:28,797 INFO L226 Difference]: Without dead ends: 452 [2022-11-23 15:52:28,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-23 15:52:28,798 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 22 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:52:28,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 12 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:52:28,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2022-11-23 15:52:28,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 278. [2022-11-23 15:52:28,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 276 states have (on average 2.1956521739130435) internal successors, (606), 277 states have internal predecessors, (606), 0 states have call successors, (0), 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-23 15:52:28,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 606 transitions. [2022-11-23 15:52:28,806 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 606 transitions. Word has length 22 [2022-11-23 15:52:28,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:52:28,807 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 606 transitions. [2022-11-23 15:52:28,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:52:28,807 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 606 transitions. [2022-11-23 15:52:28,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-23 15:52:28,808 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:52:28,808 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:52:28,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-23 15:52:28,809 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-23 15:52:28,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:52:28,811 INFO L85 PathProgramCache]: Analyzing trace with hash 354901051, now seen corresponding path program 2 times [2022-11-23 15:52:28,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:52:28,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353531547] [2022-11-23 15:52:28,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:52:28,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:52:28,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 15:52:28,921 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 15:52:29,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 15:52:29,056 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-23 15:52:29,056 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 15:52:29,057 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (68 of 69 remaining) [2022-11-23 15:52:29,059 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 69 remaining) [2022-11-23 15:52:29,059 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 69 remaining) [2022-11-23 15:52:29,060 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 69 remaining) [2022-11-23 15:52:29,060 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 69 remaining) [2022-11-23 15:52:29,060 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 69 remaining) [2022-11-23 15:52:29,060 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 69 remaining) [2022-11-23 15:52:29,061 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 69 remaining) [2022-11-23 15:52:29,061 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 69 remaining) [2022-11-23 15:52:29,061 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 69 remaining) [2022-11-23 15:52:29,061 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 69 remaining) [2022-11-23 15:52:29,061 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 69 remaining) [2022-11-23 15:52:29,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 69 remaining) [2022-11-23 15:52:29,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 69 remaining) [2022-11-23 15:52:29,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 69 remaining) [2022-11-23 15:52:29,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 69 remaining) [2022-11-23 15:52:29,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 69 remaining) [2022-11-23 15:52:29,063 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 69 remaining) [2022-11-23 15:52:29,063 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 69 remaining) [2022-11-23 15:52:29,063 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 69 remaining) [2022-11-23 15:52:29,063 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 69 remaining) [2022-11-23 15:52:29,063 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 69 remaining) [2022-11-23 15:52:29,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 69 remaining) [2022-11-23 15:52:29,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 69 remaining) [2022-11-23 15:52:29,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 69 remaining) [2022-11-23 15:52:29,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 69 remaining) [2022-11-23 15:52:29,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 69 remaining) [2022-11-23 15:52:29,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 69 remaining) [2022-11-23 15:52:29,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 69 remaining) [2022-11-23 15:52:29,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 69 remaining) [2022-11-23 15:52:29,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 69 remaining) [2022-11-23 15:52:29,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 69 remaining) [2022-11-23 15:52:29,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 69 remaining) [2022-11-23 15:52:29,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 69 remaining) [2022-11-23 15:52:29,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 69 remaining) [2022-11-23 15:52:29,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 69 remaining) [2022-11-23 15:52:29,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 69 remaining) [2022-11-23 15:52:29,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 69 remaining) [2022-11-23 15:52:29,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 69 remaining) [2022-11-23 15:52:29,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (29 of 69 remaining) [2022-11-23 15:52:29,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 69 remaining) [2022-11-23 15:52:29,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 69 remaining) [2022-11-23 15:52:29,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 69 remaining) [2022-11-23 15:52:29,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 69 remaining) [2022-11-23 15:52:29,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 69 remaining) [2022-11-23 15:52:29,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 69 remaining) [2022-11-23 15:52:29,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 69 remaining) [2022-11-23 15:52:29,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 69 remaining) [2022-11-23 15:52:29,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 69 remaining) [2022-11-23 15:52:29,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 69 remaining) [2022-11-23 15:52:29,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 69 remaining) [2022-11-23 15:52:29,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 69 remaining) [2022-11-23 15:52:29,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 69 remaining) [2022-11-23 15:52:29,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 69 remaining) [2022-11-23 15:52:29,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 69 remaining) [2022-11-23 15:52:29,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 69 remaining) [2022-11-23 15:52:29,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 69 remaining) [2022-11-23 15:52:29,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 69 remaining) [2022-11-23 15:52:29,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 69 remaining) [2022-11-23 15:52:29,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 69 remaining) [2022-11-23 15:52:29,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 69 remaining) [2022-11-23 15:52:29,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 69 remaining) [2022-11-23 15:52:29,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 69 remaining) [2022-11-23 15:52:29,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 69 remaining) [2022-11-23 15:52:29,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 69 remaining) [2022-11-23 15:52:29,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 69 remaining) [2022-11-23 15:52:29,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 69 remaining) [2022-11-23 15:52:29,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 69 remaining) [2022-11-23 15:52:29,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 69 remaining) [2022-11-23 15:52:29,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-23 15:52:29,075 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:52:29,082 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 15:52:29,082 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 15:52:29,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:52:29 BasicIcfg [2022-11-23 15:52:29,163 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 15:52:29,163 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 15:52:29,164 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 15:52:29,164 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 15:52:29,164 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:51:50" (3/4) ... [2022-11-23 15:52:29,167 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-23 15:52:29,175 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 15:52:29,175 INFO L158 Benchmark]: Toolchain (without parser) took 41066.17ms. Allocated memory was 161.5MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 119.6MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 578.5MB. Max. memory is 16.1GB. [2022-11-23 15:52:29,176 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 119.5MB. Free memory is still 87.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 15:52:29,176 INFO L158 Benchmark]: CACSL2BoogieTranslator took 589.62ms. Allocated memory is still 161.5MB. Free memory was 119.6MB in the beginning and 95.9MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-23 15:52:29,176 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.74ms. Allocated memory is still 161.5MB. Free memory was 95.9MB in the beginning and 93.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 15:52:29,177 INFO L158 Benchmark]: Boogie Preprocessor took 75.15ms. Allocated memory is still 161.5MB. Free memory was 93.1MB in the beginning and 91.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 15:52:29,177 INFO L158 Benchmark]: RCFGBuilder took 1561.98ms. Allocated memory is still 161.5MB. Free memory was 91.0MB in the beginning and 73.2MB in the end (delta: 17.8MB). Peak memory consumption was 56.7MB. Max. memory is 16.1GB. [2022-11-23 15:52:29,178 INFO L158 Benchmark]: TraceAbstraction took 38764.54ms. Allocated memory was 161.5MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 72.4MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 530.2MB. Max. memory is 16.1GB. [2022-11-23 15:52:29,178 INFO L158 Benchmark]: Witness Printer took 11.42ms. Allocated memory is still 1.9GB. Free memory is still 1.3GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 15:52:29,179 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.33ms. Allocated memory is still 119.5MB. Free memory is still 87.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 589.62ms. Allocated memory is still 161.5MB. Free memory was 119.6MB in the beginning and 95.9MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.74ms. Allocated memory is still 161.5MB. Free memory was 95.9MB in the beginning and 93.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.15ms. Allocated memory is still 161.5MB. Free memory was 93.1MB in the beginning and 91.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1561.98ms. Allocated memory is still 161.5MB. Free memory was 91.0MB in the beginning and 73.2MB in the end (delta: 17.8MB). Peak memory consumption was 56.7MB. Max. memory is 16.1GB. * TraceAbstraction took 38764.54ms. Allocated memory was 161.5MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 72.4MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 530.2MB. Max. memory is 16.1GB. * Witness Printer took 11.42ms. Allocated memory is still 1.9GB. Free memory is still 1.3GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 16.2s, 181 PlacesBefore, 78 PlacesAfterwards, 173 TransitionsBefore, 69 TransitionsAfterwards, 6064 CoEnabledTransitionPairs, 8 FixpointIterations, 72 TrivialSequentialCompositions, 81 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 159 TotalNumberOfCompositions, 28777 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9111, independent: 8579, independent conditional: 0, independent unconditional: 8579, dependent: 471, dependent conditional: 0, dependent unconditional: 471, unknown: 61, unknown conditional: 0, unknown unconditional: 61] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3596, independent: 3505, independent conditional: 0, independent unconditional: 3505, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3596, independent: 3280, independent conditional: 0, independent unconditional: 3280, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 316, independent: 225, independent conditional: 0, independent unconditional: 225, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1321, independent: 794, independent conditional: 0, independent unconditional: 794, dependent: 386, dependent conditional: 0, dependent unconditional: 386, unknown: 141, unknown conditional: 0, unknown unconditional: 141] ], Cache Queries: [ total: 9111, independent: 5074, independent conditional: 0, independent unconditional: 5074, dependent: 387, dependent conditional: 0, dependent unconditional: 387, unknown: 3650, unknown conditional: 0, unknown unconditional: 3650] , Statistics on independence cache: Total cache size (in pairs): 516, Positive cache size: 478, Positive conditional cache size: 0, Positive unconditional cache size: 478, Negative cache size: 38, Negative conditional cache size: 0, Negative unconditional cache size: 38, 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L714] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L715] 0 int __unbuffered_p1_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L722] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L723] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L724] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L725] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L726] 0 int __unbuffered_p1_EAX$w_buff0; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L728] 0 int __unbuffered_p1_EAX$w_buff1; [L729] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L730] 0 _Bool main$tmp_guard0; [L731] 0 _Bool main$tmp_guard1; [L733] 0 int x = 0; [L734] 0 _Bool x$flush_delayed; [L735] 0 int x$mem_tmp; [L736] 0 _Bool x$r_buff0_thd0; [L737] 0 _Bool x$r_buff0_thd1; [L738] 0 _Bool x$r_buff0_thd2; [L739] 0 _Bool x$r_buff0_thd3; [L740] 0 _Bool x$r_buff1_thd0; [L741] 0 _Bool x$r_buff1_thd1; [L742] 0 _Bool x$r_buff1_thd2; [L743] 0 _Bool x$r_buff1_thd3; [L744] 0 _Bool x$read_delayed; [L745] 0 int *x$read_delayed_var; [L746] 0 int x$w_buff0; [L747] 0 _Bool x$w_buff0_used; [L748] 0 int x$w_buff1; [L749] 0 _Bool x$w_buff1_used; [L751] 0 int y = 0; [L752] 0 _Bool weak$$choice0; [L753] 0 _Bool weak$$choice1; [L754] 0 _Bool weak$$choice2; [L838] 0 pthread_t t2000; [L839] FCALL, FORK 0 pthread_create(&t2000, ((void *)0), P0, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2000, ((void *)0), P0, ((void *)0))=-2, t2000={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] [L840] 0 pthread_t t2001; [L841] FCALL, FORK 0 pthread_create(&t2001, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2001, ((void *)0), P1, ((void *)0))=-1, t2000={7:0}, t2001={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] [L842] 0 pthread_t t2002; [L778] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L779] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L780] 2 x$flush_delayed = weak$$choice2 [L781] EXPR 2 \read(x) [L781] 2 x$mem_tmp = x [L782] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L782] EXPR 2 \read(x) [L782] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L782] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L783] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L784] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L785] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L786] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L787] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L788] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L789] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L790] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L791] EXPR 2 \read(x) [L791] 2 __unbuffered_p1_EAX = x [L792] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L792] EXPR 2 \read(x) [L792] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L792] 2 x = x$flush_delayed ? x$mem_tmp : x [L793] 2 x$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, 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] [L796] 2 y = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, 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] [L843] FCALL, FORK 0 pthread_create(&t2002, ((void *)0), P2, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2002, ((void *)0), P2, ((void *)0))=0, t2000={7:0}, t2001={5:0}, t2002={6:0}, weak$$choice0=49, 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] [L813] 3 y = 2 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, 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=2] [L758] 1 __unbuffered_p0_EAX = y VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, 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=2] [L761] 1 x = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, 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=2] [L764] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L764] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L764] EXPR 1 \read(x) [L764] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L764] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L764] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L765] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L766] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L767] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L768] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, 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=2] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L816] 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) [L816] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L816] EXPR 3 \read(x) [L816] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L816] 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) [L816] 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) [L817] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L818] 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 [L819] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L820] 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 [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, 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=2] [L823] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L825] 3 return 0; [L799] 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) [L799] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L799] EXPR 2 \read(x) [L799] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L799] 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) [L799] 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) [L800] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L801] 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 [L802] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L803] 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 [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, 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=2] [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 2 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L847] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L847] RET 0 assume_abort_if_not(main$tmp_guard0) [L849] 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) [L849] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L849] EXPR 0 \read(x) [L849] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L849] 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) [L849] 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) [L850] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L851] 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 [L852] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L853] 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 [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2000={7:0}, t2001={5:0}, t2002={6:0}, weak$$choice0=49, 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=2] [L856] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L857] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L857] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L857] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L857] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L857] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L857] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L858] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1) [L860] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=0, weak$$choice0=49, weak$$choice1=255, 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=2] - 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: 836]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 839]: 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: 843]: 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: 841]: 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, 224 locations, 69 error locations. Started 1 CEGAR loops. OverallTime: 38.4s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 17.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 927 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 927 mSDsluCounter, 182 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 97 mSDsCounter, 173 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2613 IncrementalHoareTripleChecker+Invalid, 2786 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 173 mSolverCounterUnsat, 85 mSDtfsCounter, 2613 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28926occurred 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: 2.9s AutomataMinimizationTime, 24 MinimizatonAttempts, 5805 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 319 NumberOfCodeBlocks, 319 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 273 ConstructedInterpolants, 0 QuantifiedInterpolants, 2755 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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-23 15:52:29,231 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe009_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW --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 9047d35108a9c07c04b519cba211a741bb80887623b2a85c45105c17ca835121 --- 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-4e7fbc6 [2022-11-23 15:52:31,780 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 15:52:31,782 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 15:52:31,801 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 15:52:31,806 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 15:52:31,808 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 15:52:31,812 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 15:52:31,817 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 15:52:31,819 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 15:52:31,821 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 15:52:31,822 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 15:52:31,825 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 15:52:31,827 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 15:52:31,831 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 15:52:31,833 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 15:52:31,836 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 15:52:31,838 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 15:52:31,843 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 15:52:31,845 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 15:52:31,848 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 15:52:31,853 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 15:52:31,859 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 15:52:31,862 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 15:52:31,866 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 15:52:31,869 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 15:52:31,874 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 15:52:31,875 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 15:52:31,876 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 15:52:31,878 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 15:52:31,881 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 15:52:31,882 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 15:52:31,883 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 15:52:31,885 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 15:52:31,886 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 15:52:31,900 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 15:52:31,900 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 15:52:31,901 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 15:52:31,902 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 15:52:31,902 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 15:52:31,903 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 15:52:31,904 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 15:52:31,905 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-23 15:52:31,956 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 15:52:31,957 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 15:52:31,957 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 15:52:31,958 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 15:52:31,959 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 15:52:31,959 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 15:52:31,959 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 15:52:31,960 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 15:52:31,960 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 15:52:31,960 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 15:52:31,962 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 15:52:31,962 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 15:52:31,963 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 15:52:31,963 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 15:52:31,964 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 15:52:31,964 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 15:52:31,964 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 15:52:31,964 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 15:52:31,965 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 15:52:31,965 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 15:52:31,965 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 15:52:31,966 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 15:52:31,966 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 15:52:31,966 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 15:52:31,967 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 15:52:31,967 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-23 15:52:31,967 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-23 15:52:31,968 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 15:52:31,968 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 15:52:31,968 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 15:52:31,969 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 15:52:31,969 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 15:52:31,969 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 15:52:31,970 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 15:52:31,970 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 15:52:31,970 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-23 15:52:31,970 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-23 15:52:31,971 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 15:52:31,971 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 15:52:31,971 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_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/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_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW 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 -> 9047d35108a9c07c04b519cba211a741bb80887623b2a85c45105c17ca835121 [2022-11-23 15:52:32,390 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 15:52:32,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 15:52:32,416 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 15:52:32,417 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 15:52:32,418 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 15:52:32,420 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/pthread-wmm/safe009_rmo.opt.i [2022-11-23 15:52:35,627 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 15:52:35,871 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 15:52:35,871 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/sv-benchmarks/c/pthread-wmm/safe009_rmo.opt.i [2022-11-23 15:52:35,884 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/data/9bf3aed99/5899286a0d24434084e96254f81a0e3c/FLAG04f29262a [2022-11-23 15:52:35,903 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/data/9bf3aed99/5899286a0d24434084e96254f81a0e3c [2022-11-23 15:52:35,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 15:52:35,908 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 15:52:35,912 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 15:52:35,913 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 15:52:35,917 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 15:52:35,918 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:52:35" (1/1) ... [2022-11-23 15:52:35,919 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@502191d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:52:35, skipping insertion in model container [2022-11-23 15:52:35,919 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:52:35" (1/1) ... [2022-11-23 15:52:35,926 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 15:52:35,972 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 15:52:36,164 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_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/sv-benchmarks/c/pthread-wmm/safe009_rmo.opt.i[949,962] [2022-11-23 15:52:36,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 15:52:36,442 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 15:52:36,466 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_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/sv-benchmarks/c/pthread-wmm/safe009_rmo.opt.i[949,962] [2022-11-23 15:52:36,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 15:52:36,573 INFO L208 MainTranslator]: Completed translation [2022-11-23 15:52:36,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:52:36 WrapperNode [2022-11-23 15:52:36,573 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 15:52:36,575 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 15:52:36,575 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 15:52:36,575 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 15:52:36,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:52:36" (1/1) ... [2022-11-23 15:52:36,611 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:52:36" (1/1) ... [2022-11-23 15:52:36,635 INFO L138 Inliner]: procedures = 180, calls = 69, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 136 [2022-11-23 15:52:36,636 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 15:52:36,637 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 15:52:36,637 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 15:52:36,637 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 15:52:36,647 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:52:36" (1/1) ... [2022-11-23 15:52:36,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:52:36" (1/1) ... [2022-11-23 15:52:36,651 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:52:36" (1/1) ... [2022-11-23 15:52:36,651 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:52:36" (1/1) ... [2022-11-23 15:52:36,663 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:52:36" (1/1) ... [2022-11-23 15:52:36,665 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:52:36" (1/1) ... [2022-11-23 15:52:36,669 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:52:36" (1/1) ... [2022-11-23 15:52:36,671 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:52:36" (1/1) ... [2022-11-23 15:52:36,675 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 15:52:36,676 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 15:52:36,676 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 15:52:36,676 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 15:52:36,677 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:52:36" (1/1) ... [2022-11-23 15:52:36,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 15:52:36,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:52:36,712 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 15:52:36,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 15:52:36,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-23 15:52:36,772 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 15:52:36,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 15:52:36,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 15:52:36,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 15:52:36,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-23 15:52:36,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-23 15:52:36,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-23 15:52:36,774 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 15:52:36,774 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 15:52:36,774 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 15:52:36,775 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 15:52:36,775 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-23 15:52:36,775 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-23 15:52:36,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 15:52:36,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 15:52:36,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 15:52:36,778 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 15:52:37,044 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 15:52:37,060 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 15:52:37,755 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 15:52:38,338 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 15:52:38,338 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 15:52:38,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:52:38 BoogieIcfgContainer [2022-11-23 15:52:38,341 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 15:52:38,344 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 15:52:38,345 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 15:52:38,348 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 15:52:38,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:52:35" (1/3) ... [2022-11-23 15:52:38,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56cf36fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:52:38, skipping insertion in model container [2022-11-23 15:52:38,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:52:36" (2/3) ... [2022-11-23 15:52:38,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56cf36fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:52:38, skipping insertion in model container [2022-11-23 15:52:38,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:52:38" (3/3) ... [2022-11-23 15:52:38,353 INFO L112 eAbstractionObserver]: Analyzing ICFG safe009_rmo.opt.i [2022-11-23 15:52:38,372 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 15:52:38,373 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 40 error locations. [2022-11-23 15:52:38,374 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 15:52:38,533 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 15:52:38,582 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 15:52:38,615 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 174 transitions, 363 flow [2022-11-23 15:52:38,620 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 182 places, 174 transitions, 363 flow [2022-11-23 15:52:38,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 174 transitions, 363 flow [2022-11-23 15:52:38,759 INFO L130 PetriNetUnfolder]: 2/171 cut-off events. [2022-11-23 15:52:38,760 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 15:52:38,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 171 events. 2/171 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 212 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 110. Up to 2 conditions per place. [2022-11-23 15:52:38,772 INFO L119 LiptonReduction]: Number of co-enabled transitions 6064 [2022-11-23 15:53:08,767 INFO L134 LiptonReduction]: Checked pairs total: 28615 [2022-11-23 15:53:08,768 INFO L136 LiptonReduction]: Total number of compositions: 154 [2022-11-23 15:53:08,776 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 69 transitions, 153 flow [2022-11-23 15:53:10,097 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 28926 states, 23318 states have (on average 4.586885667724505) internal successors, (106957), 28925 states have internal predecessors, (106957), 0 states have call successors, (0), 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-23 15:53:10,130 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 15:53:10,164 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;@665e9c79, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 15:53:10,164 INFO L358 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2022-11-23 15:53:10,228 INFO L276 IsEmpty]: Start isEmpty. Operand has 28926 states, 23318 states have (on average 4.586885667724505) internal successors, (106957), 28925 states have internal predecessors, (106957), 0 states have call successors, (0), 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-23 15:53:10,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-23 15:53:10,233 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:53:10,234 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-23 15:53:10,235 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-23 15:53:10,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:53:10,244 INFO L85 PathProgramCache]: Analyzing trace with hash 955, now seen corresponding path program 1 times [2022-11-23 15:53:10,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:53:10,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [545555666] [2022-11-23 15:53:10,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:53:10,279 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-23 15:53:10,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:53:10,310 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/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-23 15:53:10,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/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-23 15:53:10,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:53:10,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-23 15:53:10,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:53:10,511 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-23 15:53:10,511 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:53:10,512 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:53:10,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [545555666] [2022-11-23 15:53:10,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [545555666] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:53:10,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:53:10,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-23 15:53:10,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233097614] [2022-11-23 15:53:10,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:53:10,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 15:53:10,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:53:10,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 15:53:10,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 15:53:10,594 INFO L87 Difference]: Start difference. First operand has 28926 states, 23318 states have (on average 4.586885667724505) internal successors, (106957), 28925 states have internal predecessors, (106957), 0 states have call successors, (0), 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-23 15:53:11,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:53:11,415 INFO L93 Difference]: Finished difference Result 14910 states and 53713 transitions. [2022-11-23 15:53:11,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 15:53:11,424 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-23 15:53:11,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:53:11,803 INFO L225 Difference]: With dead ends: 14910 [2022-11-23 15:53:11,803 INFO L226 Difference]: Without dead ends: 14910 [2022-11-23 15:53:11,804 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-23 15:53:11,807 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5 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.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:53:11,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:53:11,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14910 states. [2022-11-23 15:53:12,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14910 to 14910. [2022-11-23 15:53:12,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14910 states, 12706 states have (on average 4.22737289469542) internal successors, (53713), 14909 states have internal predecessors, (53713), 0 states have call successors, (0), 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-23 15:53:12,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14910 states to 14910 states and 53713 transitions. [2022-11-23 15:53:12,950 INFO L78 Accepts]: Start accepts. Automaton has 14910 states and 53713 transitions. Word has length 1 [2022-11-23 15:53:12,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:53:12,950 INFO L495 AbstractCegarLoop]: Abstraction has 14910 states and 53713 transitions. [2022-11-23 15:53:12,951 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-23 15:53:12,951 INFO L276 IsEmpty]: Start isEmpty. Operand 14910 states and 53713 transitions. [2022-11-23 15:53:12,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-23 15:53:12,952 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:53:12,952 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-23 15:53:12,975 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/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-23 15:53:13,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/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-23 15:53:13,175 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-23 15:53:13,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:53:13,176 INFO L85 PathProgramCache]: Analyzing trace with hash 29185333, now seen corresponding path program 1 times [2022-11-23 15:53:13,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:53:13,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1595372664] [2022-11-23 15:53:13,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:53:13,178 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-23 15:53:13,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:53:13,179 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/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-23 15:53:13,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/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-23 15:53:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:53:13,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 15:53:13,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:53:13,546 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-23 15:53:13,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-23 15:53:13,604 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-23 15:53:13,604 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:53:13,604 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:53:13,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1595372664] [2022-11-23 15:53:13,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1595372664] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:53:13,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:53:13,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 15:53:13,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864030236] [2022-11-23 15:53:13,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:53:13,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:53:13,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:53:13,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:53:13,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:53:13,609 INFO L87 Difference]: Start difference. First operand 14910 states and 53713 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-23 15:53:14,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:53:14,144 INFO L93 Difference]: Finished difference Result 7538 states and 26259 transitions. [2022-11-23 15:53:14,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:53:14,145 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-23 15:53:14,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:53:14,194 INFO L225 Difference]: With dead ends: 7538 [2022-11-23 15:53:14,194 INFO L226 Difference]: Without dead ends: 7538 [2022-11-23 15:53:14,195 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-23 15:53:14,196 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 30 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 15:53:14,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 15:53:14,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7538 states. [2022-11-23 15:53:14,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7538 to 7538. [2022-11-23 15:53:14,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7538 states, 6809 states have (on average 3.856513438096637) internal successors, (26259), 7537 states have internal predecessors, (26259), 0 states have call successors, (0), 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-23 15:53:14,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7538 states to 7538 states and 26259 transitions. [2022-11-23 15:53:14,621 INFO L78 Accepts]: Start accepts. Automaton has 7538 states and 26259 transitions. Word has length 4 [2022-11-23 15:53:14,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:53:14,622 INFO L495 AbstractCegarLoop]: Abstraction has 7538 states and 26259 transitions. [2022-11-23 15:53:14,622 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-23 15:53:14,625 INFO L276 IsEmpty]: Start isEmpty. Operand 7538 states and 26259 transitions. [2022-11-23 15:53:14,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-23 15:53:14,626 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:53:14,626 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-23 15:53:14,643 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/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-23 15:53:14,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/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-23 15:53:14,835 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-23 15:53:14,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:53:14,835 INFO L85 PathProgramCache]: Analyzing trace with hash 29185334, now seen corresponding path program 1 times [2022-11-23 15:53:14,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:53:14,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2001005388] [2022-11-23 15:53:14,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:53:14,836 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-23 15:53:14,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:53:14,838 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/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-23 15:53:14,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/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-23 15:53:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:53:14,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 15:53:14,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:53:15,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:53:15,013 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-23 15:53:15,065 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-23 15:53:15,066 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:53:15,067 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:53:15,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2001005388] [2022-11-23 15:53:15,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2001005388] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:53:15,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:53:15,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 15:53:15,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696787887] [2022-11-23 15:53:15,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:53:15,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:53:15,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:53:15,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:53:15,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:53:15,072 INFO L87 Difference]: Start difference. First operand 7538 states and 26259 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-23 15:53:15,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:53:15,283 INFO L93 Difference]: Finished difference Result 2320 states and 7657 transitions. [2022-11-23 15:53:15,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:53:15,284 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-23 15:53:15,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:53:15,299 INFO L225 Difference]: With dead ends: 2320 [2022-11-23 15:53:15,300 INFO L226 Difference]: Without dead ends: 2320 [2022-11-23 15:53:15,300 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-23 15:53:15,306 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:53:15,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:53:15,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2320 states. [2022-11-23 15:53:15,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2320 to 2320. [2022-11-23 15:53:15,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2320 states, 2222 states have (on average 3.445994599459946) internal successors, (7657), 2319 states have internal predecessors, (7657), 0 states have call successors, (0), 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-23 15:53:15,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2320 states to 2320 states and 7657 transitions. [2022-11-23 15:53:15,377 INFO L78 Accepts]: Start accepts. Automaton has 2320 states and 7657 transitions. Word has length 4 [2022-11-23 15:53:15,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:53:15,378 INFO L495 AbstractCegarLoop]: Abstraction has 2320 states and 7657 transitions. [2022-11-23 15:53:15,378 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-23 15:53:15,378 INFO L276 IsEmpty]: Start isEmpty. Operand 2320 states and 7657 transitions. [2022-11-23 15:53:15,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-23 15:53:15,380 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:53:15,380 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:53:15,397 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/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-23 15:53:15,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/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-23 15:53:15,593 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-23 15:53:15,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:53:15,593 INFO L85 PathProgramCache]: Analyzing trace with hash -631828845, now seen corresponding path program 1 times [2022-11-23 15:53:15,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:53:15,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1063309381] [2022-11-23 15:53:15,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:53:15,594 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-23 15:53:15,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:53:15,595 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/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-23 15:53:15,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/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-23 15:53:15,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:53:15,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 15:53:15,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:53:15,785 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-23 15:53:15,785 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:53:15,785 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:53:15,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1063309381] [2022-11-23 15:53:15,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1063309381] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:53:15,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:53:15,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 15:53:15,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980968180] [2022-11-23 15:53:15,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:53:15,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:53:15,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:53:15,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:53:15,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:53:15,788 INFO L87 Difference]: Start difference. First operand 2320 states and 7657 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-23 15:53:15,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:53:15,986 INFO L93 Difference]: Finished difference Result 1053 states and 2789 transitions. [2022-11-23 15:53:15,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:53:15,987 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-23 15:53:15,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:53:15,991 INFO L225 Difference]: With dead ends: 1053 [2022-11-23 15:53:15,991 INFO L226 Difference]: Without dead ends: 1053 [2022-11-23 15:53:15,992 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-23 15:53:15,992 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:53:15,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 8 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:53:15,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2022-11-23 15:53:16,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1053. [2022-11-23 15:53:16,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1053 states, 991 states have (on average 2.8143289606458124) internal successors, (2789), 1052 states have internal predecessors, (2789), 0 states have call successors, (0), 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-23 15:53:16,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 2789 transitions. [2022-11-23 15:53:16,101 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 2789 transitions. Word has length 10 [2022-11-23 15:53:16,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:53:16,102 INFO L495 AbstractCegarLoop]: Abstraction has 1053 states and 2789 transitions. [2022-11-23 15:53:16,102 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-23 15:53:16,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 2789 transitions. [2022-11-23 15:53:16,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 15:53:16,105 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:53:16,106 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:53:16,122 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/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)] Ended with exit code 0 [2022-11-23 15:53:16,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/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-23 15:53:16,318 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-23 15:53:16,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:53:16,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1908899450, now seen corresponding path program 1 times [2022-11-23 15:53:16,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:53:16,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1742939697] [2022-11-23 15:53:16,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:53:16,319 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-23 15:53:16,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:53:16,321 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/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-23 15:53:16,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/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-23 15:53:16,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:53:16,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 15:53:16,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:53:16,552 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-23 15:53:16,552 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:53:16,552 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:53:16,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1742939697] [2022-11-23 15:53:16,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1742939697] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:53:16,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:53:16,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:53:16,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036203474] [2022-11-23 15:53:16,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:53:16,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:53:16,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:53:16,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:53:16,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:53:16,554 INFO L87 Difference]: Start difference. First operand 1053 states and 2789 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-23 15:53:16,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:53:16,803 INFO L93 Difference]: Finished difference Result 340 states and 735 transitions. [2022-11-23 15:53:16,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 15:53:16,803 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-23 15:53:16,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:53:16,804 INFO L225 Difference]: With dead ends: 340 [2022-11-23 15:53:16,804 INFO L226 Difference]: Without dead ends: 340 [2022-11-23 15:53:16,805 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-23 15:53:16,805 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 20 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:53:16,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 15 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:53:16,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2022-11-23 15:53:16,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2022-11-23 15:53:16,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 320 states have (on average 2.296875) internal successors, (735), 339 states have internal predecessors, (735), 0 states have call successors, (0), 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-23 15:53:16,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 735 transitions. [2022-11-23 15:53:16,810 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 735 transitions. Word has length 13 [2022-11-23 15:53:16,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:53:16,810 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 735 transitions. [2022-11-23 15:53:16,811 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-23 15:53:16,811 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 735 transitions. [2022-11-23 15:53:16,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-23 15:53:16,812 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:53:16,812 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:53:16,831 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/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-23 15:53:17,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/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-23 15:53:17,013 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-23 15:53:17,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:53:17,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1449847243, now seen corresponding path program 1 times [2022-11-23 15:53:17,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:53:17,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1309928432] [2022-11-23 15:53:17,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:53:17,014 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 15:53:17,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:53:17,015 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/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-23 15:53:17,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/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-23 15:53:17,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:53:17,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 15:53:17,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:53:17,241 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-23 15:53:17,241 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:53:17,242 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:53:17,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1309928432] [2022-11-23 15:53:17,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1309928432] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:53:17,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:53:17,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 15:53:17,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562761708] [2022-11-23 15:53:17,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:53:17,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 15:53:17,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:53:17,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 15:53:17,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:53:17,244 INFO L87 Difference]: Start difference. First operand 340 states and 735 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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-23 15:53:17,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:53:17,574 INFO L93 Difference]: Finished difference Result 201 states and 468 transitions. [2022-11-23 15:53:17,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 15:53:17,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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-23 15:53:17,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:53:17,576 INFO L225 Difference]: With dead ends: 201 [2022-11-23 15:53:17,576 INFO L226 Difference]: Without dead ends: 201 [2022-11-23 15:53:17,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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-23 15:53:17,577 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 28 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 15:53:17,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 24 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 15:53:17,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-11-23 15:53:17,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2022-11-23 15:53:17,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 197 states have (on average 2.3756345177664975) internal successors, (468), 200 states have internal predecessors, (468), 0 states have call successors, (0), 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-23 15:53:17,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 468 transitions. [2022-11-23 15:53:17,583 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 468 transitions. Word has length 17 [2022-11-23 15:53:17,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:53:17,583 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 468 transitions. [2022-11-23 15:53:17,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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-23 15:53:17,584 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 468 transitions. [2022-11-23 15:53:17,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-23 15:53:17,585 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:53:17,585 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-23 15:53:17,603 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/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-23 15:53:17,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/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-23 15:53:17,799 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-23 15:53:17,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:53:17,800 INFO L85 PathProgramCache]: Analyzing trace with hash 2100753362, now seen corresponding path program 1 times [2022-11-23 15:53:17,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:53:17,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [762107065] [2022-11-23 15:53:17,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:53:17,803 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-23 15:53:17,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:53:17,804 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/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-23 15:53:17,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/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-23 15:53:18,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:53:18,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 15:53:18,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:53:18,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 5 [2022-11-23 15:53:18,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-23 15:53:18,214 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:53:18,214 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:53:18,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [762107065] [2022-11-23 15:53:18,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [762107065] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:53:18,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:53:18,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:53:18,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729238722] [2022-11-23 15:53:18,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:53:18,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 15:53:18,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:53:18,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 15:53:18,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:53:18,217 INFO L87 Difference]: Start difference. First operand 201 states and 468 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 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-23 15:53:18,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:53:18,422 INFO L93 Difference]: Finished difference Result 200 states and 467 transitions. [2022-11-23 15:53:18,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 15:53:18,423 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 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-23 15:53:18,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:53:18,424 INFO L225 Difference]: With dead ends: 200 [2022-11-23 15:53:18,424 INFO L226 Difference]: Without dead ends: 200 [2022-11-23 15:53:18,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-23 15:53:18,425 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 44 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:53:18,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 4 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:53:18,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-11-23 15:53:18,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2022-11-23 15:53:18,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 197 states have (on average 2.3705583756345177) internal successors, (467), 199 states have internal predecessors, (467), 0 states have call successors, (0), 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-23 15:53:18,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 467 transitions. [2022-11-23 15:53:18,431 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 467 transitions. Word has length 21 [2022-11-23 15:53:18,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:53:18,432 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 467 transitions. [2022-11-23 15:53:18,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 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-23 15:53:18,432 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 467 transitions. [2022-11-23 15:53:18,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-23 15:53:18,433 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:53:18,434 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-23 15:53:18,455 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/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-23 15:53:18,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/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-23 15:53:18,651 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-23 15:53:18,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:53:18,652 INFO L85 PathProgramCache]: Analyzing trace with hash 2100753363, now seen corresponding path program 1 times [2022-11-23 15:53:18,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:53:18,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1393902263] [2022-11-23 15:53:18,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:53:18,653 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-23 15:53:18,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:53:18,654 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/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-23 15:53:18,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/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-23 15:53:18,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:53:18,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 15:53:18,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:53:19,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 5 [2022-11-23 15:53:19,176 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-23 15:53:19,176 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:53:19,176 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:53:19,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1393902263] [2022-11-23 15:53:19,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1393902263] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:53:19,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:53:19,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:53:19,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962386445] [2022-11-23 15:53:19,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:53:19,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 15:53:19,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:53:19,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 15:53:19,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:53:19,178 INFO L87 Difference]: Start difference. First operand 200 states and 467 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 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-23 15:53:19,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:53:19,386 INFO L93 Difference]: Finished difference Result 199 states and 466 transitions. [2022-11-23 15:53:19,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 15:53:19,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 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-23 15:53:19,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:53:19,387 INFO L225 Difference]: With dead ends: 199 [2022-11-23 15:53:19,387 INFO L226 Difference]: Without dead ends: 199 [2022-11-23 15:53:19,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-23 15:53:19,388 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 44 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:53:19,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 3 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:53:19,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-11-23 15:53:19,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2022-11-23 15:53:19,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 197 states have (on average 2.3654822335025383) internal successors, (466), 198 states have internal predecessors, (466), 0 states have call successors, (0), 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-23 15:53:19,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 466 transitions. [2022-11-23 15:53:19,393 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 466 transitions. Word has length 21 [2022-11-23 15:53:19,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:53:19,393 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 466 transitions. [2022-11-23 15:53:19,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 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-23 15:53:19,393 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 466 transitions. [2022-11-23 15:53:19,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-23 15:53:19,394 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:53:19,394 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:53:19,411 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/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-23 15:53:19,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/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-23 15:53:19,607 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-23 15:53:19,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:53:19,607 INFO L85 PathProgramCache]: Analyzing trace with hash 698839689, now seen corresponding path program 1 times [2022-11-23 15:53:19,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:53:19,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [317133820] [2022-11-23 15:53:19,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:53:19,607 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-23 15:53:19,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:53:19,608 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/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-23 15:53:19,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/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-23 15:53:19,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:53:19,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 15:53:19,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:53:19,859 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-23 15:53:19,860 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:53:19,860 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:53:19,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [317133820] [2022-11-23 15:53:19,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [317133820] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:53:19,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:53:19,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 15:53:19,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063729689] [2022-11-23 15:53:19,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:53:19,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:53:19,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:53:19,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:53:19,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:53:19,863 INFO L87 Difference]: Start difference. First operand 199 states and 466 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:53:20,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:53:20,043 INFO L93 Difference]: Finished difference Result 313 states and 721 transitions. [2022-11-23 15:53:20,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 15:53:20,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-23 15:53:20,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:53:20,044 INFO L225 Difference]: With dead ends: 313 [2022-11-23 15:53:20,044 INFO L226 Difference]: Without dead ends: 313 [2022-11-23 15:53:20,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-23 15:53:20,045 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:53:20,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 6 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:53:20,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-11-23 15:53:20,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 309. [2022-11-23 15:53:20,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 307 states have (on average 2.3387622149837135) internal successors, (718), 308 states have internal predecessors, (718), 0 states have call successors, (0), 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-23 15:53:20,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 718 transitions. [2022-11-23 15:53:20,054 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 718 transitions. Word has length 22 [2022-11-23 15:53:20,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:53:20,055 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 718 transitions. [2022-11-23 15:53:20,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:53:20,055 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 718 transitions. [2022-11-23 15:53:20,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-23 15:53:20,056 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:53:20,056 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:53:20,069 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/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-23 15:53:20,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/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-23 15:53:20,269 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-23 15:53:20,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:53:20,270 INFO L85 PathProgramCache]: Analyzing trace with hash 516439789, now seen corresponding path program 2 times [2022-11-23 15:53:20,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:53:20,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [848347354] [2022-11-23 15:53:20,271 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 15:53:20,271 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-23 15:53:20,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:53:20,272 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/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-23 15:53:20,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/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-23 15:53:20,465 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-23 15:53:20,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 15:53:20,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 15:53:20,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:53:20,516 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-23 15:53:20,516 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:53:20,516 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:53:20,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [848347354] [2022-11-23 15:53:20,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [848347354] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:53:20,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:53:20,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:53:20,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711664908] [2022-11-23 15:53:20,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:53:20,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:53:20,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:53:20,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:53:20,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:53:20,519 INFO L87 Difference]: Start difference. First operand 309 states and 718 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:53:20,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:53:20,836 INFO L93 Difference]: Finished difference Result 482 states and 1060 transitions. [2022-11-23 15:53:20,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 15:53:20,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-23 15:53:20,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:53:20,838 INFO L225 Difference]: With dead ends: 482 [2022-11-23 15:53:20,839 INFO L226 Difference]: Without dead ends: 482 [2022-11-23 15:53:20,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 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-23 15:53:20,839 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 24 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 15:53:20,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 12 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 15:53:20,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-11-23 15:53:20,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 246. [2022-11-23 15:53:20,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 244 states have (on average 2.3155737704918034) internal successors, (565), 245 states have internal predecessors, (565), 0 states have call successors, (0), 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-23 15:53:20,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 565 transitions. [2022-11-23 15:53:20,847 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 565 transitions. Word has length 22 [2022-11-23 15:53:20,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:53:20,847 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 565 transitions. [2022-11-23 15:53:20,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:53:20,847 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 565 transitions. [2022-11-23 15:53:20,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-23 15:53:20,848 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:53:20,848 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:53:20,868 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/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-23 15:53:21,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/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-23 15:53:21,049 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-23 15:53:21,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:53:21,049 INFO L85 PathProgramCache]: Analyzing trace with hash 876426891, now seen corresponding path program 3 times [2022-11-23 15:53:21,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:53:21,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1074579965] [2022-11-23 15:53:21,050 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 15:53:21,050 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-23 15:53:21,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:53:21,051 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/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-23 15:53:21,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/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-23 15:53:21,338 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-23 15:53:21,338 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-23 15:53:21,339 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 15:53:21,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 15:53:21,565 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2022-11-23 15:53:21,565 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 15:53:21,567 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (68 of 69 remaining) [2022-11-23 15:53:21,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 69 remaining) [2022-11-23 15:53:21,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 69 remaining) [2022-11-23 15:53:21,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 69 remaining) [2022-11-23 15:53:21,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 69 remaining) [2022-11-23 15:53:21,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 69 remaining) [2022-11-23 15:53:21,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 69 remaining) [2022-11-23 15:53:21,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 69 remaining) [2022-11-23 15:53:21,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 69 remaining) [2022-11-23 15:53:21,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 69 remaining) [2022-11-23 15:53:21,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 69 remaining) [2022-11-23 15:53:21,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 69 remaining) [2022-11-23 15:53:21,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 69 remaining) [2022-11-23 15:53:21,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 69 remaining) [2022-11-23 15:53:21,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 69 remaining) [2022-11-23 15:53:21,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 69 remaining) [2022-11-23 15:53:21,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 69 remaining) [2022-11-23 15:53:21,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 69 remaining) [2022-11-23 15:53:21,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 69 remaining) [2022-11-23 15:53:21,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 69 remaining) [2022-11-23 15:53:21,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 69 remaining) [2022-11-23 15:53:21,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 69 remaining) [2022-11-23 15:53:21,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 69 remaining) [2022-11-23 15:53:21,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 69 remaining) [2022-11-23 15:53:21,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 69 remaining) [2022-11-23 15:53:21,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 69 remaining) [2022-11-23 15:53:21,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 69 remaining) [2022-11-23 15:53:21,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 69 remaining) [2022-11-23 15:53:21,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 69 remaining) [2022-11-23 15:53:21,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 69 remaining) [2022-11-23 15:53:21,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 69 remaining) [2022-11-23 15:53:21,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 69 remaining) [2022-11-23 15:53:21,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 69 remaining) [2022-11-23 15:53:21,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 69 remaining) [2022-11-23 15:53:21,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 69 remaining) [2022-11-23 15:53:21,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 69 remaining) [2022-11-23 15:53:21,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 69 remaining) [2022-11-23 15:53:21,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 69 remaining) [2022-11-23 15:53:21,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 69 remaining) [2022-11-23 15:53:21,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (29 of 69 remaining) [2022-11-23 15:53:21,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 69 remaining) [2022-11-23 15:53:21,578 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 69 remaining) [2022-11-23 15:53:21,578 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 69 remaining) [2022-11-23 15:53:21,578 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 69 remaining) [2022-11-23 15:53:21,578 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 69 remaining) [2022-11-23 15:53:21,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 69 remaining) [2022-11-23 15:53:21,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 69 remaining) [2022-11-23 15:53:21,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 69 remaining) [2022-11-23 15:53:21,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 69 remaining) [2022-11-23 15:53:21,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 69 remaining) [2022-11-23 15:53:21,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 69 remaining) [2022-11-23 15:53:21,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 69 remaining) [2022-11-23 15:53:21,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 69 remaining) [2022-11-23 15:53:21,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 69 remaining) [2022-11-23 15:53:21,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 69 remaining) [2022-11-23 15:53:21,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 69 remaining) [2022-11-23 15:53:21,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 69 remaining) [2022-11-23 15:53:21,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 69 remaining) [2022-11-23 15:53:21,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 69 remaining) [2022-11-23 15:53:21,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 69 remaining) [2022-11-23 15:53:21,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 69 remaining) [2022-11-23 15:53:21,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 69 remaining) [2022-11-23 15:53:21,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 69 remaining) [2022-11-23 15:53:21,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 69 remaining) [2022-11-23 15:53:21,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 69 remaining) [2022-11-23 15:53:21,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 69 remaining) [2022-11-23 15:53:21,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 69 remaining) [2022-11-23 15:53:21,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 69 remaining) [2022-11-23 15:53:21,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 69 remaining) [2022-11-23 15:53:21,607 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/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-23 15:53:21,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/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-23 15:53:21,800 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:53:21,806 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 15:53:21,806 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 15:53:21,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:53:21 BasicIcfg [2022-11-23 15:53:21,944 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 15:53:21,945 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 15:53:21,945 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 15:53:21,946 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 15:53:21,946 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:52:38" (3/4) ... [2022-11-23 15:53:21,949 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-23 15:53:21,949 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 15:53:21,950 INFO L158 Benchmark]: Toolchain (without parser) took 46041.51ms. Allocated memory was 62.9MB in the beginning and 815.8MB in the end (delta: 752.9MB). Free memory was 32.4MB in the beginning and 355.8MB in the end (delta: -323.4MB). Peak memory consumption was 429.8MB. Max. memory is 16.1GB. [2022-11-23 15:53:21,950 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 62.9MB. Free memory was 41.4MB in the beginning and 41.4MB in the end (delta: 50.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 15:53:21,950 INFO L158 Benchmark]: CACSL2BoogieTranslator took 662.32ms. Allocated memory was 62.9MB in the beginning and 86.0MB in the end (delta: 23.1MB). Free memory was 32.3MB in the beginning and 48.3MB in the end (delta: -16.0MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. [2022-11-23 15:53:21,951 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.24ms. Allocated memory is still 86.0MB. Free memory was 48.3MB in the beginning and 45.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 15:53:21,951 INFO L158 Benchmark]: Boogie Preprocessor took 38.83ms. Allocated memory is still 86.0MB. Free memory was 45.6MB in the beginning and 43.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 15:53:21,951 INFO L158 Benchmark]: RCFGBuilder took 1664.73ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 43.2MB in the beginning and 62.4MB in the end (delta: -19.2MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2022-11-23 15:53:21,952 INFO L158 Benchmark]: TraceAbstraction took 43600.32ms. Allocated memory was 104.9MB in the beginning and 815.8MB in the end (delta: 710.9MB). Free memory was 62.4MB in the beginning and 355.8MB in the end (delta: -293.4MB). Peak memory consumption was 417.3MB. Max. memory is 16.1GB. [2022-11-23 15:53:21,952 INFO L158 Benchmark]: Witness Printer took 3.94ms. Allocated memory is still 815.8MB. Free memory is still 355.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 15:53:21,954 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.31ms. Allocated memory is still 62.9MB. Free memory was 41.4MB in the beginning and 41.4MB in the end (delta: 50.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 662.32ms. Allocated memory was 62.9MB in the beginning and 86.0MB in the end (delta: 23.1MB). Free memory was 32.3MB in the beginning and 48.3MB in the end (delta: -16.0MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.24ms. Allocated memory is still 86.0MB. Free memory was 48.3MB in the beginning and 45.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.83ms. Allocated memory is still 86.0MB. Free memory was 45.6MB in the beginning and 43.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1664.73ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 43.2MB in the beginning and 62.4MB in the end (delta: -19.2MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. * TraceAbstraction took 43600.32ms. Allocated memory was 104.9MB in the beginning and 815.8MB in the end (delta: 710.9MB). Free memory was 62.4MB in the beginning and 355.8MB in the end (delta: -293.4MB). Peak memory consumption was 417.3MB. Max. memory is 16.1GB. * Witness Printer took 3.94ms. Allocated memory is still 815.8MB. Free memory is still 355.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 30.1s, 182 PlacesBefore, 78 PlacesAfterwards, 174 TransitionsBefore, 69 TransitionsAfterwards, 6064 CoEnabledTransitionPairs, 8 FixpointIterations, 69 TrivialSequentialCompositions, 79 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 154 TotalNumberOfCompositions, 28615 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8719, independent: 8189, independent conditional: 0, independent unconditional: 8189, dependent: 490, dependent conditional: 0, dependent unconditional: 490, unknown: 40, unknown conditional: 0, unknown unconditional: 40] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3544, independent: 3454, independent conditional: 0, independent unconditional: 3454, dependent: 86, dependent conditional: 0, dependent unconditional: 86, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3544, independent: 3236, independent conditional: 0, independent unconditional: 3236, dependent: 308, dependent conditional: 0, dependent unconditional: 308, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 308, independent: 218, independent conditional: 0, independent unconditional: 218, dependent: 86, dependent conditional: 0, dependent unconditional: 86, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2007, independent: 998, independent conditional: 0, independent unconditional: 998, dependent: 794, dependent conditional: 0, dependent unconditional: 794, unknown: 215, unknown conditional: 0, unknown unconditional: 215] ], Cache Queries: [ total: 8719, independent: 4735, independent conditional: 0, independent unconditional: 4735, dependent: 404, dependent conditional: 0, dependent unconditional: 404, unknown: 3580, unknown conditional: 0, unknown unconditional: 3580] , Statistics on independence cache: Total cache size (in pairs): 471, Positive cache size: 430, Positive conditional cache size: 0, Positive unconditional cache size: 430, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41, Unknown cache size: 4, Unknown conditional cache size: 0, Unknown unconditional cache size: 4 - 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L714] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L715] 0 int __unbuffered_p1_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L722] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L723] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L724] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L725] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L726] 0 int __unbuffered_p1_EAX$w_buff0; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L728] 0 int __unbuffered_p1_EAX$w_buff1; [L729] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L730] 0 _Bool main$tmp_guard0; [L731] 0 _Bool main$tmp_guard1; [L733] 0 int x = 0; [L734] 0 _Bool x$flush_delayed; [L735] 0 int x$mem_tmp; [L736] 0 _Bool x$r_buff0_thd0; [L737] 0 _Bool x$r_buff0_thd1; [L738] 0 _Bool x$r_buff0_thd2; [L739] 0 _Bool x$r_buff0_thd3; [L740] 0 _Bool x$r_buff1_thd0; [L741] 0 _Bool x$r_buff1_thd1; [L742] 0 _Bool x$r_buff1_thd2; [L743] 0 _Bool x$r_buff1_thd3; [L744] 0 _Bool x$read_delayed; [L745] 0 int *x$read_delayed_var; [L746] 0 int x$w_buff0; [L747] 0 _Bool x$w_buff0_used; [L748] 0 int x$w_buff1; [L749] 0 _Bool x$w_buff1_used; [L751] 0 int y = 0; [L752] 0 _Bool weak$$choice0; [L753] 0 _Bool weak$$choice1; [L754] 0 _Bool weak$$choice2; [L838] 0 pthread_t t2000; [L839] FCALL, FORK 0 pthread_create(&t2000, ((void *)0), P0, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2000, ((void *)0), P0, ((void *)0))=0, t2000={15: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] [L840] 0 pthread_t t2001; [L841] FCALL, FORK 0 pthread_create(&t2001, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2001, ((void *)0), P1, ((void *)0))=1, t2000={15:0}, t2001={31: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] [L778] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L779] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L780] 2 x$flush_delayed = weak$$choice2 [L781] EXPR 2 \read(x) [L781] 2 x$mem_tmp = x [L782] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L782] EXPR 2 \read(x) [L782] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L782] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L783] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L784] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L785] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L786] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L787] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L788] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L789] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L790] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L791] EXPR 2 \read(x) [L791] 2 __unbuffered_p1_EAX = x [L792] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L792] EXPR 2 \read(x) [L792] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L792] 2 x = x$flush_delayed ? x$mem_tmp : x [L793] 2 x$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=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] [L842] 0 pthread_t t2002; [L796] 2 y = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=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] [L799] 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) [L799] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L799] EXPR 2 \read(x) [L799] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L799] 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) [L799] 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) [L800] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L801] 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 [L802] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L803] 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 [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=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] [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 2 return 0; [L843] FCALL, FORK 0 pthread_create(&t2002, ((void *)0), P2, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2002, ((void *)0), P2, ((void *)0))=2, t2000={15:0}, t2001={31:0}, t2002={7: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] [L813] 3 y = 2 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=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=2] [L758] 1 __unbuffered_p0_EAX = y VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=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=2] [L761] 1 x = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=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=2] [L764] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L764] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L764] EXPR 1 \read(x) [L764] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L764] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L764] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L765] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L766] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L767] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L768] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=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=2] [L816] 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) [L816] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L816] EXPR 3 \read(x) [L816] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L816] 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) [L816] 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) [L817] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L818] 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 [L819] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L820] 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 [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=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=2] [L823] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L825] 3 return 0; [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L847] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L847] RET 0 assume_abort_if_not(main$tmp_guard0) [L849] 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) [L849] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L849] EXPR 0 \read(x) [L849] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L849] 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) [L849] 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) [L850] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L851] 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 [L852] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L853] 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 [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2000={15:0}, t2001={31:0}, t2002={7: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=2] [L856] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L857] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L857] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L857] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L857] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L857] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L857] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L858] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1) [L860] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=0, weak$$choice0=6, weak$$choice1=2, 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=2] - 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: 836]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 841]: 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: 839]: 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: 843]: 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, 225 locations, 69 error locations. Started 1 CEGAR loops. OverallTime: 43.2s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 31.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 246 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 246 mSDsluCounter, 81 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 825 IncrementalHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 40 mSDtfsCounter, 825 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28926occurred in iteration=0, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 10 MinimizatonAttempts, 240 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 157 NumberOfCodeBlocks, 157 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 125 ConstructedInterpolants, 0 QuantifiedInterpolants, 623 SizeOfPredicates, 35 NumberOfNonLiveVariables, 1424 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-23 15:53:21,995 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a00fc1b-9261-4e8d-bf74-6efb4b442bb9/bin/utaipan-Q6hlc19bkW/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