./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-properties/alternating_list-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-properties/alternating_list-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS --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 941f3dd0e4566f414ae914eed10af26405f8e9f2f3d427c146090b07336d2fc2 --- 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-8393723 [2022-11-19 08:28:30,954 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 08:28:30,957 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 08:28:31,008 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 08:28:31,010 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 08:28:31,015 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 08:28:31,017 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 08:28:31,022 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 08:28:31,026 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 08:28:31,033 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 08:28:31,035 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 08:28:31,037 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 08:28:31,039 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 08:28:31,044 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 08:28:31,046 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 08:28:31,047 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 08:28:31,050 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 08:28:31,052 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 08:28:31,054 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 08:28:31,061 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 08:28:31,067 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 08:28:31,069 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 08:28:31,070 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 08:28:31,071 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 08:28:31,076 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 08:28:31,083 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 08:28:31,084 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 08:28:31,085 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 08:28:31,086 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 08:28:31,087 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 08:28:31,088 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 08:28:31,090 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 08:28:31,092 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 08:28:31,094 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 08:28:31,097 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 08:28:31,098 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 08:28:31,099 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 08:28:31,099 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 08:28:31,100 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 08:28:31,101 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 08:28:31,101 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 08:28:31,102 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-19 08:28:31,146 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 08:28:31,146 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 08:28:31,147 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 08:28:31,147 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 08:28:31,148 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 08:28:31,149 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 08:28:31,149 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 08:28:31,149 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 08:28:31,149 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 08:28:31,150 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 08:28:31,151 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 08:28:31,151 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 08:28:31,151 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 08:28:31,152 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 08:28:31,152 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 08:28:31,152 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 08:28:31,152 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 08:28:31,153 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 08:28:31,154 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-19 08:28:31,154 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-19 08:28:31,156 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 08:28:31,156 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 08:28:31,156 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 08:28:31,156 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 08:28:31,157 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 08:28:31,157 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 08:28:31,157 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-19 08:28:31,157 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-19 08:28:31,158 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-19 08:28:31,158 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 08:28:31,158 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-19 08:28:31,159 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 08:28:31,159 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 08:28:31,159 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 08:28:31,160 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 08:28:31,160 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:28:31,161 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 08:28:31,161 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 08:28:31,161 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 08:28:31,162 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 08:28:31,162 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 08:28:31,162 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 08:28:31,162 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_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/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_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS 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 -> 941f3dd0e4566f414ae914eed10af26405f8e9f2f3d427c146090b07336d2fc2 [2022-11-19 08:28:31,519 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 08:28:31,547 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 08:28:31,550 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 08:28:31,552 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 08:28:31,553 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 08:28:31,554 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/list-properties/alternating_list-1.i [2022-11-19 08:28:31,630 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/data/6cde19dfa/a9f3c85d33d14cb4bd97f86fbb03caf5/FLAG3ac5290aa [2022-11-19 08:28:32,342 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 08:28:32,342 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/sv-benchmarks/c/list-properties/alternating_list-1.i [2022-11-19 08:28:32,356 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/data/6cde19dfa/a9f3c85d33d14cb4bd97f86fbb03caf5/FLAG3ac5290aa [2022-11-19 08:28:32,594 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/data/6cde19dfa/a9f3c85d33d14cb4bd97f86fbb03caf5 [2022-11-19 08:28:32,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 08:28:32,599 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 08:28:32,607 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 08:28:32,608 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 08:28:32,612 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 08:28:32,613 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:28:32" (1/1) ... [2022-11-19 08:28:32,615 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e5e51f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:28:32, skipping insertion in model container [2022-11-19 08:28:32,615 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:28:32" (1/1) ... [2022-11-19 08:28:32,625 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 08:28:32,668 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 08:28:33,110 WARN L234 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_91e33424-323c-4f73-96c5-6133fc96236b/sv-benchmarks/c/list-properties/alternating_list-1.i[23574,23587] [2022-11-19 08:28:33,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:28:33,130 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 08:28:33,195 WARN L234 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_91e33424-323c-4f73-96c5-6133fc96236b/sv-benchmarks/c/list-properties/alternating_list-1.i[23574,23587] [2022-11-19 08:28:33,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:28:33,230 INFO L208 MainTranslator]: Completed translation [2022-11-19 08:28:33,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:28:33 WrapperNode [2022-11-19 08:28:33,232 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 08:28:33,233 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 08:28:33,233 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 08:28:33,234 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 08:28:33,243 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:28:33" (1/1) ... [2022-11-19 08:28:33,292 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:28:33" (1/1) ... [2022-11-19 08:28:33,324 INFO L138 Inliner]: procedures = 124, calls = 23, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 91 [2022-11-19 08:28:33,325 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 08:28:33,326 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 08:28:33,327 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 08:28:33,328 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 08:28:33,338 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:28:33" (1/1) ... [2022-11-19 08:28:33,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:28:33" (1/1) ... [2022-11-19 08:28:33,351 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:28:33" (1/1) ... [2022-11-19 08:28:33,351 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:28:33" (1/1) ... [2022-11-19 08:28:33,362 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:28:33" (1/1) ... [2022-11-19 08:28:33,371 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:28:33" (1/1) ... [2022-11-19 08:28:33,375 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:28:33" (1/1) ... [2022-11-19 08:28:33,376 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:28:33" (1/1) ... [2022-11-19 08:28:33,377 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 08:28:33,378 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 08:28:33,378 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 08:28:33,378 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 08:28:33,379 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:28:33" (1/1) ... [2022-11-19 08:28:33,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:28:33,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:28:33,412 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 08:28:33,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 08:28:33,463 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-19 08:28:33,463 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-19 08:28:33,463 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-19 08:28:33,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-19 08:28:33,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-19 08:28:33,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 08:28:33,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-19 08:28:33,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-19 08:28:33,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 08:28:33,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 08:28:33,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 08:28:33,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 08:28:33,634 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 08:28:33,636 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 08:28:33,682 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-19 08:28:34,149 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 08:28:34,216 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 08:28:34,225 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-19 08:28:34,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:28:34 BoogieIcfgContainer [2022-11-19 08:28:34,230 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 08:28:34,234 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 08:28:34,235 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 08:28:34,239 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 08:28:34,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:28:32" (1/3) ... [2022-11-19 08:28:34,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62803bef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:28:34, skipping insertion in model container [2022-11-19 08:28:34,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:28:33" (2/3) ... [2022-11-19 08:28:34,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62803bef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:28:34, skipping insertion in model container [2022-11-19 08:28:34,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:28:34" (3/3) ... [2022-11-19 08:28:34,244 INFO L112 eAbstractionObserver]: Analyzing ICFG alternating_list-1.i [2022-11-19 08:28:34,268 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 08:28:34,269 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-11-19 08:28:34,357 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 08:28:34,368 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;@18eeff41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 08:28:34,370 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2022-11-19 08:28:34,386 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 35 states have (on average 2.2) internal successors, (77), 66 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:28:34,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-19 08:28:34,397 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:28:34,398 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-19 08:28:34,399 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-19 08:28:34,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:28:34,408 INFO L85 PathProgramCache]: Analyzing trace with hash 167560794, now seen corresponding path program 1 times [2022-11-19 08:28:34,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:28:34,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879992240] [2022-11-19 08:28:34,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:28:34,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:28:34,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:28:34,654 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-19 08:28:34,655 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:28:34,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879992240] [2022-11-19 08:28:34,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879992240] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:28:34,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:28:34,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:28:34,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778738769] [2022-11-19 08:28:34,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:28:34,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-19 08:28:34,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:28:34,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-19 08:28:34,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 08:28:34,734 INFO L87 Difference]: Start difference. First operand has 68 states, 35 states have (on average 2.2) internal successors, (77), 66 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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-19 08:28:34,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:28:34,790 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2022-11-19 08:28:34,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-19 08:28:34,797 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-11-19 08:28:34,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:28:34,806 INFO L225 Difference]: With dead ends: 68 [2022-11-19 08:28:34,807 INFO L226 Difference]: Without dead ends: 63 [2022-11-19 08:28:34,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-19 08:28:34,814 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 08:28:34,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 08:28:34,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-19 08:28:34,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-19 08:28:34,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 62 states have internal predecessors, (68), 0 states have call successors, (0), 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-19 08:28:34,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2022-11-19 08:28:34,867 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 5 [2022-11-19 08:28:34,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:28:34,868 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2022-11-19 08:28:34,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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-19 08:28:34,870 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2022-11-19 08:28:34,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-19 08:28:34,870 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:28:34,871 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-19 08:28:34,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 08:28:34,872 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-19 08:28:34,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:28:34,873 INFO L85 PathProgramCache]: Analyzing trace with hash 899381665, now seen corresponding path program 1 times [2022-11-19 08:28:34,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:28:34,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704000183] [2022-11-19 08:28:34,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:28:34,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:28:34,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:28:35,051 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-19 08:28:35,052 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:28:35,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704000183] [2022-11-19 08:28:35,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704000183] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:28:35,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:28:35,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:28:35,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423586467] [2022-11-19 08:28:35,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:28:35,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:28:35,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:28:35,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:28:35,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:28:35,056 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:28:35,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:28:35,206 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2022-11-19 08:28:35,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 08:28:35,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-19 08:28:35,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:28:35,209 INFO L225 Difference]: With dead ends: 83 [2022-11-19 08:28:35,210 INFO L226 Difference]: Without dead ends: 83 [2022-11-19 08:28:35,210 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-19 08:28:35,212 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 111 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:28:35,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 41 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:28:35,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-19 08:28:35,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 64. [2022-11-19 08:28:35,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 41 states have (on average 1.853658536585366) internal successors, (76), 63 states have internal predecessors, (76), 0 states have call successors, (0), 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-19 08:28:35,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2022-11-19 08:28:35,222 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 6 [2022-11-19 08:28:35,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:28:35,223 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2022-11-19 08:28:35,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:28:35,224 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2022-11-19 08:28:35,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-19 08:28:35,224 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:28:35,224 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-19 08:28:35,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 08:28:35,225 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-19 08:28:35,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:28:35,226 INFO L85 PathProgramCache]: Analyzing trace with hash 899381666, now seen corresponding path program 1 times [2022-11-19 08:28:35,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:28:35,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092723992] [2022-11-19 08:28:35,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:28:35,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:28:35,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:28:35,439 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-19 08:28:35,439 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:28:35,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092723992] [2022-11-19 08:28:35,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092723992] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:28:35,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:28:35,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:28:35,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843763421] [2022-11-19 08:28:35,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:28:35,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:28:35,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:28:35,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:28:35,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:28:35,443 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:28:35,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:28:35,667 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2022-11-19 08:28:35,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:28:35,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-19 08:28:35,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:28:35,672 INFO L225 Difference]: With dead ends: 86 [2022-11-19 08:28:35,673 INFO L226 Difference]: Without dead ends: 86 [2022-11-19 08:28:35,674 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-19 08:28:35,683 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 119 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:28:35,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 52 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 08:28:35,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-19 08:28:35,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 78. [2022-11-19 08:28:35,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.6363636363636365) internal successors, (90), 77 states have internal predecessors, (90), 0 states have call successors, (0), 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-19 08:28:35,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 90 transitions. [2022-11-19 08:28:35,703 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 90 transitions. Word has length 6 [2022-11-19 08:28:35,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:28:35,703 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 90 transitions. [2022-11-19 08:28:35,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:28:35,704 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 90 transitions. [2022-11-19 08:28:35,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-19 08:28:35,705 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:28:35,705 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:28:35,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 08:28:35,706 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-19 08:28:35,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:28:35,707 INFO L85 PathProgramCache]: Analyzing trace with hash 412646002, now seen corresponding path program 1 times [2022-11-19 08:28:35,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:28:35,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443538928] [2022-11-19 08:28:35,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:28:35,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:28:35,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:28:35,775 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-19 08:28:35,775 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:28:35,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443538928] [2022-11-19 08:28:35,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443538928] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:28:35,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:28:35,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:28:35,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858010629] [2022-11-19 08:28:35,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:28:35,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:28:35,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:28:35,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:28:35,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:28:35,779 INFO L87 Difference]: Start difference. First operand 78 states and 90 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:28:35,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:28:35,818 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2022-11-19 08:28:35,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:28:35,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-19 08:28:35,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:28:35,820 INFO L225 Difference]: With dead ends: 123 [2022-11-19 08:28:35,821 INFO L226 Difference]: Without dead ends: 123 [2022-11-19 08:28:35,821 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-19 08:28:35,823 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 46 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 08:28:35,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 106 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 08:28:35,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-19 08:28:35,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 86. [2022-11-19 08:28:35,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 63 states have (on average 1.619047619047619) internal successors, (102), 85 states have internal predecessors, (102), 0 states have call successors, (0), 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-19 08:28:35,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 102 transitions. [2022-11-19 08:28:35,833 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 102 transitions. Word has length 12 [2022-11-19 08:28:35,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:28:35,833 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 102 transitions. [2022-11-19 08:28:35,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:28:35,834 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 102 transitions. [2022-11-19 08:28:35,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-19 08:28:35,835 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:28:35,835 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:28:35,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-19 08:28:35,836 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-19 08:28:35,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:28:35,836 INFO L85 PathProgramCache]: Analyzing trace with hash 412338172, now seen corresponding path program 1 times [2022-11-19 08:28:35,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:28:35,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991672944] [2022-11-19 08:28:35,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:28:35,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:28:35,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:28:36,028 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-19 08:28:36,028 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:28:36,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991672944] [2022-11-19 08:28:36,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991672944] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:28:36,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:28:36,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 08:28:36,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769751646] [2022-11-19 08:28:36,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:28:36,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:28:36,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:28:36,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:28:36,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:28:36,032 INFO L87 Difference]: Start difference. First operand 86 states and 102 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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-19 08:28:36,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:28:36,193 INFO L93 Difference]: Finished difference Result 106 states and 120 transitions. [2022-11-19 08:28:36,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 08:28:36,193 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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-19 08:28:36,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:28:36,195 INFO L225 Difference]: With dead ends: 106 [2022-11-19 08:28:36,196 INFO L226 Difference]: Without dead ends: 106 [2022-11-19 08:28:36,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-19 08:28:36,201 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 42 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:28:36,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 136 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:28:36,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-19 08:28:36,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 88. [2022-11-19 08:28:36,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 65 states have (on average 1.6) internal successors, (104), 87 states have internal predecessors, (104), 0 states have call successors, (0), 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-19 08:28:36,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 104 transitions. [2022-11-19 08:28:36,220 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 104 transitions. Word has length 12 [2022-11-19 08:28:36,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:28:36,220 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 104 transitions. [2022-11-19 08:28:36,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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-19 08:28:36,221 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 104 transitions. [2022-11-19 08:28:36,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-19 08:28:36,222 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:28:36,222 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:28:36,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-19 08:28:36,223 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-19 08:28:36,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:28:36,224 INFO L85 PathProgramCache]: Analyzing trace with hash -133788534, now seen corresponding path program 1 times [2022-11-19 08:28:36,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:28:36,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713163297] [2022-11-19 08:28:36,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:28:36,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:28:36,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:28:36,332 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-19 08:28:36,332 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:28:36,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713163297] [2022-11-19 08:28:36,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713163297] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:28:36,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:28:36,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:28:36,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467835451] [2022-11-19 08:28:36,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:28:36,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:28:36,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:28:36,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:28:36,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:28:36,336 INFO L87 Difference]: Start difference. First operand 88 states and 104 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-19 08:28:36,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:28:36,449 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2022-11-19 08:28:36,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:28:36,449 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-19 08:28:36,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:28:36,450 INFO L225 Difference]: With dead ends: 92 [2022-11-19 08:28:36,451 INFO L226 Difference]: Without dead ends: 92 [2022-11-19 08:28:36,451 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-19 08:28:36,452 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 94 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:28:36,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 62 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:28:36,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-19 08:28:36,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2022-11-19 08:28:36,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 66 states have (on average 1.5909090909090908) internal successors, (105), 88 states have internal predecessors, (105), 0 states have call successors, (0), 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-19 08:28:36,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 105 transitions. [2022-11-19 08:28:36,460 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 105 transitions. Word has length 13 [2022-11-19 08:28:36,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:28:36,461 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 105 transitions. [2022-11-19 08:28:36,461 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-19 08:28:36,461 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 105 transitions. [2022-11-19 08:28:36,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-19 08:28:36,462 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:28:36,462 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:28:36,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-19 08:28:36,463 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-19 08:28:36,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:28:36,464 INFO L85 PathProgramCache]: Analyzing trace with hash -133785972, now seen corresponding path program 1 times [2022-11-19 08:28:36,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:28:36,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177340940] [2022-11-19 08:28:36,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:28:36,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:28:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:28:36,570 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-19 08:28:36,570 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:28:36,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177340940] [2022-11-19 08:28:36,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177340940] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:28:36,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:28:36,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:28:36,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097993790] [2022-11-19 08:28:36,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:28:36,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:28:36,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:28:36,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:28:36,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:28:36,575 INFO L87 Difference]: Start difference. First operand 89 states and 105 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-19 08:28:36,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:28:36,693 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2022-11-19 08:28:36,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 08:28:36,694 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-19 08:28:36,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:28:36,695 INFO L225 Difference]: With dead ends: 96 [2022-11-19 08:28:36,695 INFO L226 Difference]: Without dead ends: 96 [2022-11-19 08:28:36,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-19 08:28:36,697 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 112 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:28:36,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 113 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:28:36,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-19 08:28:36,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2022-11-19 08:28:36,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 67 states have (on average 1.5820895522388059) internal successors, (106), 89 states have internal predecessors, (106), 0 states have call successors, (0), 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-19 08:28:36,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 106 transitions. [2022-11-19 08:28:36,704 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 106 transitions. Word has length 13 [2022-11-19 08:28:36,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:28:36,704 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 106 transitions. [2022-11-19 08:28:36,704 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-19 08:28:36,705 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 106 transitions. [2022-11-19 08:28:36,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 08:28:36,706 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:28:36,706 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:28:36,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-19 08:28:36,706 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-19 08:28:36,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:28:36,707 INFO L85 PathProgramCache]: Analyzing trace with hash 147602317, now seen corresponding path program 1 times [2022-11-19 08:28:36,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:28:36,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342533303] [2022-11-19 08:28:36,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:28:36,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:28:36,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:28:36,850 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-19 08:28:36,850 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:28:36,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342533303] [2022-11-19 08:28:36,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342533303] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:28:36,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:28:36,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-19 08:28:36,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972707779] [2022-11-19 08:28:36,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:28:36,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 08:28:36,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:28:36,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 08:28:36,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-19 08:28:36,859 INFO L87 Difference]: Start difference. First operand 90 states and 106 transitions. Second operand has 7 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-19 08:28:37,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:28:37,146 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2022-11-19 08:28:37,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 08:28:37,147 INFO L78 Accepts]: Start accepts. Automaton has has 7 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-19 08:28:37,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:28:37,148 INFO L225 Difference]: With dead ends: 103 [2022-11-19 08:28:37,148 INFO L226 Difference]: Without dead ends: 103 [2022-11-19 08:28:37,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-19 08:28:37,149 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 47 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:28:37,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 212 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 08:28:37,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-19 08:28:37,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 93. [2022-11-19 08:28:37,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 70 states have (on average 1.5571428571428572) internal successors, (109), 92 states have internal predecessors, (109), 0 states have call successors, (0), 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-19 08:28:37,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 109 transitions. [2022-11-19 08:28:37,155 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 109 transitions. Word has length 14 [2022-11-19 08:28:37,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:28:37,156 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 109 transitions. [2022-11-19 08:28:37,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 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-19 08:28:37,156 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2022-11-19 08:28:37,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 08:28:37,157 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:28:37,157 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:28:37,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-19 08:28:37,158 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-19 08:28:37,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:28:37,158 INFO L85 PathProgramCache]: Analyzing trace with hash -902756227, now seen corresponding path program 1 times [2022-11-19 08:28:37,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:28:37,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772296576] [2022-11-19 08:28:37,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:28:37,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:28:37,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:28:37,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:28:37,300 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:28:37,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772296576] [2022-11-19 08:28:37,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772296576] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:28:37,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:28:37,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:28:37,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106794515] [2022-11-19 08:28:37,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:28:37,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:28:37,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:28:37,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:28:37,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:28:37,305 INFO L87 Difference]: Start difference. First operand 93 states and 109 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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-19 08:28:37,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:28:37,491 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2022-11-19 08:28:37,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 08:28:37,492 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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-19 08:28:37,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:28:37,492 INFO L225 Difference]: With dead ends: 100 [2022-11-19 08:28:37,492 INFO L226 Difference]: Without dead ends: 100 [2022-11-19 08:28:37,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-19 08:28:37,495 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 78 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:28:37,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 88 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:28:37,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-19 08:28:37,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 90. [2022-11-19 08:28:37,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 70 states have (on average 1.5142857142857142) internal successors, (106), 89 states have internal predecessors, (106), 0 states have call successors, (0), 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-19 08:28:37,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 106 transitions. [2022-11-19 08:28:37,509 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 106 transitions. Word has length 14 [2022-11-19 08:28:37,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:28:37,509 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 106 transitions. [2022-11-19 08:28:37,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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-19 08:28:37,510 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 106 transitions. [2022-11-19 08:28:37,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 08:28:37,512 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:28:37,512 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:28:37,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-19 08:28:37,513 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-19 08:28:37,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:28:37,519 INFO L85 PathProgramCache]: Analyzing trace with hash -902756226, now seen corresponding path program 1 times [2022-11-19 08:28:37,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:28:37,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289123561] [2022-11-19 08:28:37,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:28:37,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:28:37,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:28:37,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:28:37,786 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:28:37,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289123561] [2022-11-19 08:28:37,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289123561] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:28:37,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:28:37,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:28:37,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622315650] [2022-11-19 08:28:37,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:28:37,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:28:37,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:28:37,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:28:37,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:28:37,790 INFO L87 Difference]: Start difference. First operand 90 states and 106 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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-19 08:28:37,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:28:37,963 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2022-11-19 08:28:37,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 08:28:37,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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-19 08:28:37,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:28:37,964 INFO L225 Difference]: With dead ends: 93 [2022-11-19 08:28:37,964 INFO L226 Difference]: Without dead ends: 93 [2022-11-19 08:28:37,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-19 08:28:37,965 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 55 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:28:37,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 114 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:28:37,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-19 08:28:37,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 79. [2022-11-19 08:28:37,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 64 states have (on average 1.453125) internal successors, (93), 78 states have internal predecessors, (93), 0 states have call successors, (0), 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-19 08:28:37,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 93 transitions. [2022-11-19 08:28:37,983 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 93 transitions. Word has length 14 [2022-11-19 08:28:37,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:28:37,984 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 93 transitions. [2022-11-19 08:28:37,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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-19 08:28:37,984 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 93 transitions. [2022-11-19 08:28:37,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-19 08:28:37,985 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:28:37,985 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:28:37,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-19 08:28:37,985 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-19 08:28:37,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:28:37,986 INFO L85 PathProgramCache]: Analyzing trace with hash 278242960, now seen corresponding path program 1 times [2022-11-19 08:28:37,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:28:37,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111750212] [2022-11-19 08:28:37,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:28:37,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:28:38,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:28:38,086 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-19 08:28:38,086 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:28:38,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111750212] [2022-11-19 08:28:38,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111750212] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:28:38,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:28:38,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:28:38,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187825186] [2022-11-19 08:28:38,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:28:38,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:28:38,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:28:38,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:28:38,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:28:38,093 INFO L87 Difference]: Start difference. First operand 79 states and 93 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:28:38,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:28:38,218 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2022-11-19 08:28:38,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 08:28:38,219 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-19 08:28:38,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:28:38,219 INFO L225 Difference]: With dead ends: 89 [2022-11-19 08:28:38,219 INFO L226 Difference]: Without dead ends: 79 [2022-11-19 08:28:38,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-19 08:28:38,220 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 15 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:28:38,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 121 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:28:38,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-19 08:28:38,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2022-11-19 08:28:38,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 61 states have (on average 1.459016393442623) internal successors, (89), 75 states have internal predecessors, (89), 0 states have call successors, (0), 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-19 08:28:38,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 89 transitions. [2022-11-19 08:28:38,227 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 89 transitions. Word has length 15 [2022-11-19 08:28:38,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:28:38,227 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 89 transitions. [2022-11-19 08:28:38,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:28:38,228 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 89 transitions. [2022-11-19 08:28:38,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-19 08:28:38,232 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:28:38,233 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:28:38,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-19 08:28:38,233 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-19 08:28:38,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:28:38,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1411498456, now seen corresponding path program 1 times [2022-11-19 08:28:38,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:28:38,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577444921] [2022-11-19 08:28:38,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:28:38,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:28:38,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:28:38,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:28:38,760 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:28:38,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577444921] [2022-11-19 08:28:38,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577444921] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:28:38,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124875174] [2022-11-19 08:28:38,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:28:38,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:28:38,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:28:38,767 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:28:38,769 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-19 08:28:38,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:28:38,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-19 08:28:38,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:28:39,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 08:28:39,127 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-19 08:28:39,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-19 08:28:39,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:39,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 20 [2022-11-19 08:28:39,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:28:39,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-11-19 08:28:39,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 14 treesize of output 16 [2022-11-19 08:28:39,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-19 08:28:39,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:28:39,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:28:39,775 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:28:39,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-11-19 08:28:39,800 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-19 08:28:39,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2022-11-19 08:28:39,809 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 9 treesize of output 7 [2022-11-19 08:28:39,823 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-19 08:28:39,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-19 08:28:39,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:28:39,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124875174] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:28:39,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [154856902] [2022-11-19 08:28:39,921 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2022-11-19 08:28:39,922 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 08:28:39,926 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 08:28:39,932 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 08:28:39,933 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 08:28:40,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:40,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:40,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-19 08:28:40,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 08:28:40,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 08:28:40,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:40,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-19 08:28:40,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:40,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:40,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:40,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:40,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:40,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-19 08:28:40,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:28:40,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:40,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:40,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-19 08:28:40,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:28:40,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:40,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:40,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:40,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:40,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:40,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-19 08:28:40,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:28:40,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:40,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:40,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-19 08:28:40,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:28:40,758 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-19 08:28:40,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 260 treesize of output 242 [2022-11-19 08:28:40,793 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:28:40,838 INFO L321 Elim1Store]: treesize reduction 76, result has 25.5 percent of original size [2022-11-19 08:28:40,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 256 treesize of output 257 [2022-11-19 08:28:40,875 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-19 08:28:40,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 256 treesize of output 238 [2022-11-19 08:28:41,556 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 08:28:46,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [154856902] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:28:46,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:28:46,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [10, 9, 9] total 34 [2022-11-19 08:28:46,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602767101] [2022-11-19 08:28:46,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:28:46,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-19 08:28:46,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:28:46,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-19 08:28:46,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=886, Unknown=4, NotChecked=0, Total=1122 [2022-11-19 08:28:46,396 INFO L87 Difference]: Start difference. First operand 76 states and 89 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 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-19 08:28:47,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:28:47,584 INFO L93 Difference]: Finished difference Result 103 states and 121 transitions. [2022-11-19 08:28:47,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-19 08:28:47,585 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 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 20 [2022-11-19 08:28:47,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:28:47,586 INFO L225 Difference]: With dead ends: 103 [2022-11-19 08:28:47,586 INFO L226 Difference]: Without dead ends: 103 [2022-11-19 08:28:47,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=252, Invalid=1004, Unknown=4, NotChecked=0, Total=1260 [2022-11-19 08:28:47,588 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 33 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-19 08:28:47,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 93 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-19 08:28:47,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-19 08:28:47,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 93. [2022-11-19 08:28:47,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 92 states have internal predecessors, (109), 0 states have call successors, (0), 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-19 08:28:47,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 109 transitions. [2022-11-19 08:28:47,593 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 109 transitions. Word has length 20 [2022-11-19 08:28:47,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:28:47,593 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 109 transitions. [2022-11-19 08:28:47,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 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-19 08:28:47,593 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2022-11-19 08:28:47,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-19 08:28:47,594 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:28:47,594 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:28:47,610 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-19 08:28:47,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:28:47,800 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-19 08:28:47,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:28:47,801 INFO L85 PathProgramCache]: Analyzing trace with hash 2138902324, now seen corresponding path program 1 times [2022-11-19 08:28:47,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:28:47,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210175229] [2022-11-19 08:28:47,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:28:47,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:28:47,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:28:48,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:28:48,300 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:28:48,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210175229] [2022-11-19 08:28:48,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210175229] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:28:48,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432155144] [2022-11-19 08:28:48,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:28:48,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:28:48,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:28:48,303 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:28:48,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-19 08:28:48,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:28:48,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-19 08:28:48,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:28:48,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 08:28:48,619 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-19 08:28:48,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-19 08:28:48,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:48,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 20 [2022-11-19 08:28:48,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:28:48,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-11-19 08:28:48,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 14 treesize of output 16 [2022-11-19 08:28:48,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-19 08:28:48,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:28:48,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:28:49,006 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_191 (Array Int Int))) (< (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) v_ArrVal_191) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) is different from false [2022-11-19 08:28:49,184 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:28:49,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-11-19 08:28:49,204 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-19 08:28:49,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2022-11-19 08:28:49,212 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 9 treesize of output 7 [2022-11-19 08:28:49,226 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-19 08:28:49,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-19 08:28:49,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:28:49,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432155144] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:28:49,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [847244318] [2022-11-19 08:28:49,304 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-19 08:28:49,304 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 08:28:49,304 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 08:28:49,304 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 08:28:49,305 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 08:28:49,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:49,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:49,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-19 08:28:49,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 08:28:49,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:49,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-19 08:28:49,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 08:28:49,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:49,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:49,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:49,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:49,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:49,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-19 08:28:49,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:28:49,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:28:49,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:49,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:49,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-19 08:28:49,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:49,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:49,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:49,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:49,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:49,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-19 08:28:49,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:28:49,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:49,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:49,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-19 08:28:49,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:28:49,806 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-19 08:28:49,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 260 treesize of output 242 [2022-11-19 08:28:49,837 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-19 08:28:49,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 260 treesize of output 242 [2022-11-19 08:28:49,864 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:28:49,909 INFO L321 Elim1Store]: treesize reduction 76, result has 25.5 percent of original size [2022-11-19 08:28:49,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 256 treesize of output 257 [2022-11-19 08:28:50,402 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 08:28:55,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [847244318] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:28:55,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:28:55,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [11, 9, 10] total 39 [2022-11-19 08:28:55,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133536952] [2022-11-19 08:28:55,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:28:55,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-19 08:28:55,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:28:55,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-19 08:28:55,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1192, Unknown=6, NotChecked=72, Total=1482 [2022-11-19 08:28:55,197 INFO L87 Difference]: Start difference. First operand 93 states and 109 transitions. Second operand has 14 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 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-19 08:28:56,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:28:56,099 INFO L93 Difference]: Finished difference Result 101 states and 116 transitions. [2022-11-19 08:28:56,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-19 08:28:56,103 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 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 23 [2022-11-19 08:28:56,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:28:56,104 INFO L225 Difference]: With dead ends: 101 [2022-11-19 08:28:56,104 INFO L226 Difference]: Without dead ends: 94 [2022-11-19 08:28:56,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=222, Invalid=1258, Unknown=6, NotChecked=74, Total=1560 [2022-11-19 08:28:56,106 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 30 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-19 08:28:56,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 95 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-19 08:28:56,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-11-19 08:28:56,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2022-11-19 08:28:56,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 92 states have internal predecessors, (108), 0 states have call successors, (0), 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-19 08:28:56,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 108 transitions. [2022-11-19 08:28:56,110 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 108 transitions. Word has length 23 [2022-11-19 08:28:56,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:28:56,111 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 108 transitions. [2022-11-19 08:28:56,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 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-19 08:28:56,111 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 108 transitions. [2022-11-19 08:28:56,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-19 08:28:56,112 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:28:56,112 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:28:56,123 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-19 08:28:56,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:28:56,319 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-19 08:28:56,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:28:56,320 INFO L85 PathProgramCache]: Analyzing trace with hash 192746989, now seen corresponding path program 1 times [2022-11-19 08:28:56,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:28:56,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252018930] [2022-11-19 08:28:56,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:28:56,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:28:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:28:56,393 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 08:28:56,393 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:28:56,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252018930] [2022-11-19 08:28:56,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252018930] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:28:56,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:28:56,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:28:56,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296305339] [2022-11-19 08:28:56,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:28:56,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:28:56,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:28:56,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:28:56,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:28:56,399 INFO L87 Difference]: Start difference. First operand 93 states and 108 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:28:56,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:28:56,447 INFO L93 Difference]: Finished difference Result 91 states and 106 transitions. [2022-11-19 08:28:56,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:28:56,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-19 08:28:56,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:28:56,451 INFO L225 Difference]: With dead ends: 91 [2022-11-19 08:28:56,451 INFO L226 Difference]: Without dead ends: 91 [2022-11-19 08:28:56,451 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-19 08:28:56,452 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 19 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 08:28:56,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 46 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 08:28:56,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-19 08:28:56,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-11-19 08:28:56,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 78 states have (on average 1.358974358974359) internal successors, (106), 90 states have internal predecessors, (106), 0 states have call successors, (0), 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-19 08:28:56,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 106 transitions. [2022-11-19 08:28:56,456 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 106 transitions. Word has length 24 [2022-11-19 08:28:56,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:28:56,457 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 106 transitions. [2022-11-19 08:28:56,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:28:56,457 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 106 transitions. [2022-11-19 08:28:56,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-19 08:28:56,458 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:28:56,458 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:28:56,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-19 08:28:56,459 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-19 08:28:56,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:28:56,459 INFO L85 PathProgramCache]: Analyzing trace with hash 546263767, now seen corresponding path program 1 times [2022-11-19 08:28:56,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:28:56,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611197785] [2022-11-19 08:28:56,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:28:56,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:28:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:28:57,013 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:28:57,013 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:28:57,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611197785] [2022-11-19 08:28:57,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611197785] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:28:57,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324574930] [2022-11-19 08:28:57,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:28:57,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:28:57,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:28:57,015 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:28:57,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-19 08:28:57,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:28:57,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-19 08:28:57,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:28:57,196 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-19 08:28:57,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-19 08:28:57,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:28:57,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:28:57,302 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:28:57,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 49 [2022-11-19 08:28:57,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 36 [2022-11-19 08:28:57,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-11-19 08:28:57,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-11-19 08:28:57,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 19 treesize of output 11 [2022-11-19 08:28:57,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-19 08:28:57,405 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:28:57,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:28:57,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 57 [2022-11-19 08:28:57,565 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse2)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_264 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_264) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse0)) (forall ((v_ArrVal_263 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_263) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse2)))))) is different from false [2022-11-19 08:28:57,582 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:28:57,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-19 08:28:57,596 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:28:57,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-19 08:28:57,602 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 3 [2022-11-19 08:28:57,629 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-19 08:28:57,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2022-11-19 08:28:57,792 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:28:57,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2022-11-19 08:28:57,941 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:28:57,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324574930] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:28:57,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [706774724] [2022-11-19 08:28:57,945 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-19 08:28:57,945 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 08:28:57,945 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 08:28:57,946 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 08:28:57,946 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 08:28:57,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:57,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:57,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-19 08:28:58,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:58,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-19 08:28:58,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 08:28:58,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 08:28:58,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:58,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:58,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:58,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:58,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:58,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-19 08:28:58,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:58,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:58,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-19 08:28:58,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:28:58,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:28:58,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:58,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:58,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:58,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:58,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:58,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-19 08:28:58,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:28:58,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:28:58,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:58,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:28:58,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-19 08:28:58,425 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-19 08:28:58,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 260 treesize of output 242 [2022-11-19 08:28:58,479 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:28:58,559 INFO L321 Elim1Store]: treesize reduction 76, result has 25.5 percent of original size [2022-11-19 08:28:58,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 256 treesize of output 257 [2022-11-19 08:28:58,594 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-19 08:28:58,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 256 treesize of output 238 [2022-11-19 08:28:59,476 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 08:29:03,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [706774724] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:29:03,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:29:03,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [11, 10, 10] total 32 [2022-11-19 08:29:03,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387243874] [2022-11-19 08:29:03,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:29:03,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-19 08:29:03,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:29:03,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-19 08:29:03,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=780, Unknown=3, NotChecked=60, Total=1056 [2022-11-19 08:29:03,035 INFO L87 Difference]: Start difference. First operand 91 states and 106 transitions. Second operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:29:03,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:29:03,673 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2022-11-19 08:29:03,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-19 08:29:03,674 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-19 08:29:03,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:29:03,675 INFO L225 Difference]: With dead ends: 77 [2022-11-19 08:29:03,675 INFO L226 Difference]: Without dead ends: 77 [2022-11-19 08:29:03,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=228, Invalid=829, Unknown=3, NotChecked=62, Total=1122 [2022-11-19 08:29:03,676 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 58 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 08:29:03,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 53 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 08:29:03,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-19 08:29:03,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2022-11-19 08:29:03,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 62 states have (on average 1.2580645161290323) internal successors, (78), 70 states have internal predecessors, (78), 0 states have call successors, (0), 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-19 08:29:03,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2022-11-19 08:29:03,680 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 26 [2022-11-19 08:29:03,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:29:03,680 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2022-11-19 08:29:03,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:29:03,681 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2022-11-19 08:29:03,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-19 08:29:03,681 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:29:03,682 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:29:03,691 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-19 08:29:03,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-19 08:29:03,888 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-19 08:29:03,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:29:03,889 INFO L85 PathProgramCache]: Analyzing trace with hash -294744398, now seen corresponding path program 1 times [2022-11-19 08:29:03,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:29:03,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787567950] [2022-11-19 08:29:03,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:29:03,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:29:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:29:03,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-19 08:29:03,964 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:29:03,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787567950] [2022-11-19 08:29:03,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787567950] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:29:03,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:29:03,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:29:03,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523882146] [2022-11-19 08:29:03,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:29:03,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:29:03,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:29:03,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:29:03,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:29:03,967 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:29:04,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:29:04,055 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2022-11-19 08:29:04,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 08:29:04,056 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-19 08:29:04,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:29:04,056 INFO L225 Difference]: With dead ends: 80 [2022-11-19 08:29:04,056 INFO L226 Difference]: Without dead ends: 80 [2022-11-19 08:29:04,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-19 08:29:04,057 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 62 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 54 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.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:29:04,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 54 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:29:04,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-19 08:29:04,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 72. [2022-11-19 08:29:04,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 63 states have (on average 1.253968253968254) internal successors, (79), 71 states have internal predecessors, (79), 0 states have call successors, (0), 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-19 08:29:04,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2022-11-19 08:29:04,062 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 28 [2022-11-19 08:29:04,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:29:04,062 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2022-11-19 08:29:04,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:29:04,062 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2022-11-19 08:29:04,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-19 08:29:04,066 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:29:04,066 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:29:04,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-19 08:29:04,066 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-19 08:29:04,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:29:04,067 INFO L85 PathProgramCache]: Analyzing trace with hash -549603317, now seen corresponding path program 1 times [2022-11-19 08:29:04,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:29:04,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355733859] [2022-11-19 08:29:04,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:29:04,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:29:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:29:04,242 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 08:29:04,242 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:29:04,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355733859] [2022-11-19 08:29:04,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355733859] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:29:04,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130062641] [2022-11-19 08:29:04,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:29:04,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:29:04,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:29:04,245 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:29:04,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-19 08:29:04,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:29:04,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-19 08:29:04,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:29:04,495 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:29:04,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-19 08:29:04,548 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 08:29:04,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:29:04,697 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-19 08:29:04,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 16 [2022-11-19 08:29:04,733 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 08:29:04,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130062641] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:29:04,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [19706710] [2022-11-19 08:29:04,736 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2022-11-19 08:29:04,736 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 08:29:04,737 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 08:29:04,737 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 08:29:04,737 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 08:29:04,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:04,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:04,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-19 08:29:04,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:04,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-19 08:29:04,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 08:29:04,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 08:29:04,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:04,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:04,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:04,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:04,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:04,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-19 08:29:04,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:04,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:04,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-19 08:29:04,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:29:04,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:29:04,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:29:04,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:29:04,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:04,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:04,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-19 08:29:05,153 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-19 08:29:05,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 260 treesize of output 242 [2022-11-19 08:29:05,184 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:29:05,243 INFO L321 Elim1Store]: treesize reduction 76, result has 25.5 percent of original size [2022-11-19 08:29:05,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 256 treesize of output 257 [2022-11-19 08:29:05,281 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-19 08:29:05,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 256 treesize of output 238 [2022-11-19 08:29:05,712 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 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-19 08:29:05,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:05,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-19 08:29:05,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 08:29:05,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 08:29:05,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:05,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:05,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:05,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:05,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:05,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-19 08:29:05,890 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 08:29:10,575 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3679#(and (or (and (= |ULTIMATE.start_main_~flag~0#1| 1) (= |#NULL.base| 0)) (and (= |ULTIMATE.start_main_~t~0#1.offset| 0) (= |#NULL.base| 0))) (< |ULTIMATE.start_main_~p~0#1.base| |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~flag~0#1| 1) (not (= |ULTIMATE.start_main_old_#valid#1| |#valid|)) (<= 0 |ULTIMATE.start_main_~flag~0#1|) (<= |#NULL.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 0) (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_main_#res#1| 0))' at error location [2022-11-19 08:29:10,575 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 08:29:10,576 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:29:10,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2022-11-19 08:29:10,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571085626] [2022-11-19 08:29:10,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:29:10,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-19 08:29:10,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:29:10,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-19 08:29:10,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1102, Unknown=0, NotChecked=0, Total=1332 [2022-11-19 08:29:10,578 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 19 states have internal predecessors, (61), 0 states have call successors, (0), 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-19 08:29:11,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:29:11,158 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2022-11-19 08:29:11,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-19 08:29:11,158 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 19 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-19 08:29:11,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:29:11,159 INFO L225 Difference]: With dead ends: 92 [2022-11-19 08:29:11,159 INFO L226 Difference]: Without dead ends: 92 [2022-11-19 08:29:11,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=394, Invalid=1768, Unknown=0, NotChecked=0, Total=2162 [2022-11-19 08:29:11,161 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 206 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 08:29:11,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 243 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 08:29:11,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-19 08:29:11,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 72. [2022-11-19 08:29:11,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 71 states have internal predecessors, (78), 0 states have call successors, (0), 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-19 08:29:11,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2022-11-19 08:29:11,163 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 29 [2022-11-19 08:29:11,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:29:11,164 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2022-11-19 08:29:11,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 19 states have internal predecessors, (61), 0 states have call successors, (0), 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-19 08:29:11,164 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2022-11-19 08:29:11,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-19 08:29:11,165 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:29:11,165 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:29:11,183 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-19 08:29:11,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-19 08:29:11,365 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-19 08:29:11,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:29:11,366 INFO L85 PathProgramCache]: Analyzing trace with hash -547141591, now seen corresponding path program 1 times [2022-11-19 08:29:11,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:29:11,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414453341] [2022-11-19 08:29:11,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:29:11,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:29:11,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:29:11,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 08:29:11,470 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:29:11,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414453341] [2022-11-19 08:29:11,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414453341] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:29:11,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187819213] [2022-11-19 08:29:11,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:29:11,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:29:11,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:29:11,473 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:29:11,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-19 08:29:11,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:29:11,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-19 08:29:11,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:29:11,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 08:29:11,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:29:11,685 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-19 08:29:11,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2022-11-19 08:29:11,700 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 08:29:11,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187819213] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:29:11,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1519463726] [2022-11-19 08:29:11,704 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2022-11-19 08:29:11,704 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 08:29:11,704 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 08:29:11,705 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 08:29:11,705 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 08:29:11,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:11,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:11,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-19 08:29:11,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 08:29:11,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 08:29:11,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:11,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-19 08:29:11,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:11,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:11,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:11,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:11,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:11,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-19 08:29:11,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:11,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:11,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-19 08:29:11,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:29:11,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:29:11,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:29:11,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:11,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:11,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-19 08:29:11,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:29:12,116 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-19 08:29:12,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 260 treesize of output 242 [2022-11-19 08:29:12,160 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:29:12,212 INFO L321 Elim1Store]: treesize reduction 76, result has 25.5 percent of original size [2022-11-19 08:29:12,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 256 treesize of output 257 [2022-11-19 08:29:12,256 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-19 08:29:12,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 256 treesize of output 238 [2022-11-19 08:29:13,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 08:29:13,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:13,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-19 08:29:13,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 08:29:13,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:13,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:13,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:13,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:13,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:13,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-19 08:29:13,091 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 08:29:16,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1519463726] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:29:16,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:29:16,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [6, 5, 5] total 23 [2022-11-19 08:29:16,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397132052] [2022-11-19 08:29:16,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:29:16,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-19 08:29:16,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:29:16,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-19 08:29:16,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2022-11-19 08:29:16,698 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:29:17,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:29:17,633 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2022-11-19 08:29:17,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-19 08:29:17,634 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-19 08:29:17,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:29:17,634 INFO L225 Difference]: With dead ends: 77 [2022-11-19 08:29:17,634 INFO L226 Difference]: Without dead ends: 77 [2022-11-19 08:29:17,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 64 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2022-11-19 08:29:17,635 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 84 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-19 08:29:17,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 66 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-19 08:29:17,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-19 08:29:17,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2022-11-19 08:29:17,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 64 states have (on average 1.234375) internal successors, (79), 72 states have internal predecessors, (79), 0 states have call successors, (0), 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-19 08:29:17,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2022-11-19 08:29:17,638 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 29 [2022-11-19 08:29:17,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:29:17,639 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2022-11-19 08:29:17,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:29:17,639 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2022-11-19 08:29:17,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-19 08:29:17,640 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:29:17,640 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:29:17,647 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-19 08:29:17,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-19 08:29:17,845 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-19 08:29:17,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:29:17,846 INFO L85 PathProgramCache]: Analyzing trace with hash 218480003, now seen corresponding path program 1 times [2022-11-19 08:29:17,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:29:17,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775078091] [2022-11-19 08:29:17,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:29:17,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:29:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:29:18,530 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:29:18,530 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:29:18,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775078091] [2022-11-19 08:29:18,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775078091] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:29:18,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982162910] [2022-11-19 08:29:18,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:29:18,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:29:18,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:29:18,534 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:29:18,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-19 08:29:18,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:29:18,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-19 08:29:18,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:29:18,784 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 08:29:18,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-19 08:29:18,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:29:18,950 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:29:18,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-19 08:29:19,200 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:29:19,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2022-11-19 08:29:19,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-11-19 08:29:19,249 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 08:29:19,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:29:19,937 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:29:19,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-11-19 08:29:19,951 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:29:19,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2022-11-19 08:29:19,959 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 22 treesize of output 18 [2022-11-19 08:29:20,016 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:29:20,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-11-19 08:29:20,021 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:29:20,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:20,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:20,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-19 08:29:20,294 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:29:20,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 129 [2022-11-19 08:29:20,600 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 08:29:20,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982162910] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:29:20,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [173586822] [2022-11-19 08:29:20,603 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2022-11-19 08:29:20,603 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 08:29:20,603 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 08:29:20,604 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 08:29:20,604 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 08:29:20,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:20,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:20,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-19 08:29:20,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 08:29:20,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:20,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-19 08:29:20,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 08:29:20,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:20,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:20,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:20,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:20,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:20,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-19 08:29:20,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:29:20,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:29:20,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:20,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:20,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-19 08:29:20,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:20,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:20,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-19 08:29:20,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:29:20,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:29:20,962 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-19 08:29:20,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 260 treesize of output 242 [2022-11-19 08:29:20,996 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-19 08:29:20,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 260 treesize of output 242 [2022-11-19 08:29:21,017 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:29:21,078 INFO L321 Elim1Store]: treesize reduction 76, result has 25.5 percent of original size [2022-11-19 08:29:21,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 256 treesize of output 257 [2022-11-19 08:29:21,409 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 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-19 08:29:21,503 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-11-19 08:29:21,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-11-19 08:29:21,654 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-11-19 08:29:21,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-11-19 08:29:21,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 08:29:21,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 08:29:21,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:21,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-19 08:29:21,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:21,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:21,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:21,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:21,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:21,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-19 08:29:21,835 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 08:29:26,149 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4438#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= |ULTIMATE.start_main_~flag~0#1| 1) (<= 0 |ULTIMATE.start_main_~flag~0#1|) (not (= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-19 08:29:26,149 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 08:29:26,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:29:26,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 32 [2022-11-19 08:29:26,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059928696] [2022-11-19 08:29:26,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:29:26,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-19 08:29:26,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:29:26,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-19 08:29:26,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=2330, Unknown=4, NotChecked=0, Total=2756 [2022-11-19 08:29:26,153 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 34 states, 33 states have (on average 2.4545454545454546) internal successors, (81), 33 states have internal predecessors, (81), 0 states have call successors, (0), 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-19 08:29:26,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:29:26,983 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2022-11-19 08:29:26,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-19 08:29:26,984 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.4545454545454546) internal successors, (81), 33 states have internal predecessors, (81), 0 states have call successors, (0), 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 30 [2022-11-19 08:29:26,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:29:26,984 INFO L225 Difference]: With dead ends: 125 [2022-11-19 08:29:26,985 INFO L226 Difference]: Without dead ends: 125 [2022-11-19 08:29:26,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1655 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=588, Invalid=3068, Unknown=4, NotChecked=0, Total=3660 [2022-11-19 08:29:26,986 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 141 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 174 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 08:29:26,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 375 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 496 Invalid, 0 Unknown, 174 Unchecked, 0.4s Time] [2022-11-19 08:29:26,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-19 08:29:26,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 97. [2022-11-19 08:29:26,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 88 states have (on average 1.1931818181818181) internal successors, (105), 96 states have internal predecessors, (105), 0 states have call successors, (0), 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-19 08:29:26,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2022-11-19 08:29:26,993 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 30 [2022-11-19 08:29:26,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:29:26,993 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2022-11-19 08:29:26,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.4545454545454546) internal successors, (81), 33 states have internal predecessors, (81), 0 states have call successors, (0), 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-19 08:29:26,994 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2022-11-19 08:29:26,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-19 08:29:26,995 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:29:26,996 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:29:27,003 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-19 08:29:27,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:29:27,201 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-19 08:29:27,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:29:27,202 INFO L85 PathProgramCache]: Analyzing trace with hash 218480004, now seen corresponding path program 1 times [2022-11-19 08:29:27,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:29:27,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737586275] [2022-11-19 08:29:27,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:29:27,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:29:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:29:27,896 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:29:27,896 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:29:27,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737586275] [2022-11-19 08:29:27,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737586275] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:29:27,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477548566] [2022-11-19 08:29:27,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:29:27,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:29:27,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:29:27,897 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:29:27,900 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-19 08:29:28,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:29:28,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-19 08:29:28,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:29:28,048 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-19 08:29:28,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-19 08:29:28,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 08:29:28,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:29:28,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:29:28,214 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:29:28,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-19 08:29:28,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 20 [2022-11-19 08:29:28,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-19 08:29:28,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2022-11-19 08:29:28,392 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 08:29:28,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:29:28,680 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_481 (Array Int Int)) (v_ArrVal_480 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_480) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_481) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))) (forall ((v_ArrVal_480 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_480) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))) is different from false [2022-11-19 08:29:28,690 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:29:28,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-19 08:29:28,701 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:29:28,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-19 08:29:28,707 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 3 [2022-11-19 08:29:28,733 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:29:28,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2022-11-19 08:29:28,742 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:29:28,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-11-19 08:29:28,746 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:29:28,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:28,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2022-11-19 08:29:28,754 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:29:28,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:28,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-19 08:29:28,903 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:29:28,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2022-11-19 08:29:29,139 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 08:29:29,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477548566] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:29:29,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [962386107] [2022-11-19 08:29:29,142 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2022-11-19 08:29:29,143 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 08:29:29,143 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 08:29:29,143 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 08:29:29,143 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 08:29:29,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:29,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:29,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-19 08:29:29,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:29,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-19 08:29:29,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 08:29:29,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 08:29:29,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:29,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:29,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:29,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:29,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:29,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-19 08:29:29,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:29:29,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:29,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:29,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-19 08:29:29,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:29:29,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:29:29,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:29,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:29,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-19 08:29:29,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:29:29,475 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-19 08:29:29,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 260 treesize of output 242 [2022-11-19 08:29:29,497 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:29:29,557 INFO L321 Elim1Store]: treesize reduction 76, result has 25.5 percent of original size [2022-11-19 08:29:29,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 256 treesize of output 257 [2022-11-19 08:29:29,601 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-19 08:29:29,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 256 treesize of output 238 [2022-11-19 08:29:30,233 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 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-19 08:29:30,310 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-11-19 08:29:30,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-11-19 08:29:30,427 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-11-19 08:29:30,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-11-19 08:29:30,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:30,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-19 08:29:30,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 08:29:30,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 08:29:30,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:30,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:30,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:30,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:30,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:30,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-19 08:29:30,616 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 08:29:34,739 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4899#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= |ULTIMATE.start_main_~flag~0#1| 1) (<= 0 |ULTIMATE.start_main_~flag~0#1|) (or (not (<= 0 |ULTIMATE.start_main_~p~0#1.offset|)) (not (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-19 08:29:34,740 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 08:29:34,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:29:34,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 26 [2022-11-19 08:29:34,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428944715] [2022-11-19 08:29:34,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:29:34,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-19 08:29:34,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:29:34,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-19 08:29:34,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=1575, Unknown=7, NotChecked=84, Total=1980 [2022-11-19 08:29:34,742 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 27 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 27 states have internal predecessors, (81), 0 states have call successors, (0), 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-19 08:29:36,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:29:36,321 INFO L93 Difference]: Finished difference Result 203 states and 214 transitions. [2022-11-19 08:29:36,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-19 08:29:36,321 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 27 states have internal predecessors, (81), 0 states have call successors, (0), 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 30 [2022-11-19 08:29:36,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:29:36,322 INFO L225 Difference]: With dead ends: 203 [2022-11-19 08:29:36,322 INFO L226 Difference]: Without dead ends: 203 [2022-11-19 08:29:36,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 51 SyntacticMatches, 6 SemanticMatches, 65 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1693 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=701, Invalid=3586, Unknown=7, NotChecked=128, Total=4422 [2022-11-19 08:29:36,324 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 306 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 222 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-19 08:29:36,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 383 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 481 Invalid, 0 Unknown, 222 Unchecked, 0.5s Time] [2022-11-19 08:29:36,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-11-19 08:29:36,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 100. [2022-11-19 08:29:36,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 91 states have (on average 1.1868131868131868) internal successors, (108), 99 states have internal predecessors, (108), 0 states have call successors, (0), 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-19 08:29:36,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2022-11-19 08:29:36,328 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 30 [2022-11-19 08:29:36,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:29:36,328 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2022-11-19 08:29:36,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 27 states have internal predecessors, (81), 0 states have call successors, (0), 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-19 08:29:36,329 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2022-11-19 08:29:36,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-19 08:29:36,329 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:29:36,329 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:29:36,343 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-19 08:29:36,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:29:36,535 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-19 08:29:36,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:29:36,536 INFO L85 PathProgramCache]: Analyzing trace with hash 487758996, now seen corresponding path program 1 times [2022-11-19 08:29:36,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:29:36,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480857949] [2022-11-19 08:29:36,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:29:36,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:29:36,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:29:37,115 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:29:37,115 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:29:37,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480857949] [2022-11-19 08:29:37,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480857949] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:29:37,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076155577] [2022-11-19 08:29:37,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:29:37,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:29:37,116 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:29:37,117 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:29:37,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-19 08:29:37,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:29:37,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-19 08:29:37,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:29:37,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 08:29:37,410 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-19 08:29:37,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-19 08:29:37,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:29:37,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:37,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 20 [2022-11-19 08:29:37,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-11-19 08:29:37,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 14 treesize of output 16 [2022-11-19 08:29:37,641 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-19 08:29:37,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-19 08:29:37,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:29:37,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-19 08:29:37,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 20 treesize of output 8 [2022-11-19 08:29:37,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 14 treesize of output 16 [2022-11-19 08:29:37,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-19 08:29:37,844 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:29:37,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:29:40,378 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-19 08:29:40,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-19 08:29:40,631 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:29:40,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2022-11-19 08:29:40,650 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-19 08:29:40,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 117 [2022-11-19 08:29:40,658 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 106 treesize of output 102 [2022-11-19 08:29:40,666 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 102 treesize of output 94 [2022-11-19 08:29:40,681 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-19 08:29:40,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-19 08:29:40,789 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:29:40,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076155577] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:29:40,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [914043826] [2022-11-19 08:29:40,794 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2022-11-19 08:29:40,795 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 08:29:40,795 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 08:29:40,795 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 08:29:40,796 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 08:29:40,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:40,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:40,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-19 08:29:40,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 08:29:40,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 08:29:40,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:40,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-19 08:29:40,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:40,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:40,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:40,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:40,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:40,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-19 08:29:40,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:40,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:40,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-19 08:29:40,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:29:40,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:29:41,057 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-19 08:29:41,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 34 treesize of output 16 [2022-11-19 08:29:41,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:41,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2022-11-19 08:29:41,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:41,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:41,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:41,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-19 08:29:41,252 INFO L321 Elim1Store]: treesize reduction 138, result has 17.9 percent of original size [2022-11-19 08:29:41,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 286 treesize of output 294 [2022-11-19 08:29:41,483 INFO L321 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-11-19 08:29:41,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 371 treesize of output 320 [2022-11-19 08:29:41,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:41,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:41,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:41,506 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:29:41,517 INFO L321 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2022-11-19 08:29:41,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 317 treesize of output 298 [2022-11-19 08:29:41,567 INFO L321 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-11-19 08:29:41,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 311 treesize of output 308 [2022-11-19 08:29:41,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:41,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:41,999 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-19 08:29:42,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 46 [2022-11-19 08:29:42,042 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-19 08:29:42,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 34 treesize of output 16 [2022-11-19 08:29:42,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:42,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2022-11-19 08:29:42,115 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:29:42,166 INFO L321 Elim1Store]: treesize reduction 94, result has 21.0 percent of original size [2022-11-19 08:29:42,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 245 treesize of output 149 [2022-11-19 08:29:42,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:42,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:42,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:42,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:42,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:42,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:42,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2022-11-19 08:29:42,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:42,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:42,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:42,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 78 [2022-11-19 08:29:42,271 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 9 [2022-11-19 08:29:42,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 08:29:42,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-19 08:29:42,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:29:42,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:29:42,399 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-19 08:29:42,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 16 [2022-11-19 08:29:42,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:42,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 16 [2022-11-19 08:29:42,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 08:29:42,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 08:29:42,477 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-19 08:29:42,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 16 [2022-11-19 08:29:42,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:42,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 16 [2022-11-19 08:29:42,519 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 9 [2022-11-19 08:29:42,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 08:29:42,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:29:42,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:29:42,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-19 08:29:42,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 08:29:42,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 08:29:42,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 08:29:42,824 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-19 08:29:42,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 21 [2022-11-19 08:29:42,915 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 08:29:45,845 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5482#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (< |ULTIMATE.start_main_~p~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_old_#valid#1| |#valid|)) (= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) 0) (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |#NULL.offset| 0) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (= |ULTIMATE.start_main_~flag~0#1| 1) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_main_#res#1| 0) (= |#NULL.base| 0))' at error location [2022-11-19 08:29:45,845 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 08:29:45,845 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:29:45,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 14] total 37 [2022-11-19 08:29:45,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946041622] [2022-11-19 08:29:45,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:29:45,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-19 08:29:45,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:29:45,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-19 08:29:45,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=2366, Unknown=25, NotChecked=0, Total=2652 [2022-11-19 08:29:45,847 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand has 37 states, 37 states have (on average 2.2432432432432434) internal successors, (83), 37 states have internal predecessors, (83), 0 states have call successors, (0), 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-19 08:29:46,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:29:46,588 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2022-11-19 08:29:46,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-19 08:29:46,589 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.2432432432432434) internal successors, (83), 37 states have internal predecessors, (83), 0 states have call successors, (0), 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 31 [2022-11-19 08:29:46,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:29:46,589 INFO L225 Difference]: With dead ends: 95 [2022-11-19 08:29:46,590 INFO L226 Difference]: Without dead ends: 95 [2022-11-19 08:29:46,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1044 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=404, Invalid=3111, Unknown=25, NotChecked=0, Total=3540 [2022-11-19 08:29:46,592 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 101 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 183 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 08:29:46,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 323 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 272 Invalid, 0 Unknown, 183 Unchecked, 0.3s Time] [2022-11-19 08:29:46,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-19 08:29:46,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 84. [2022-11-19 08:29:46,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 75 states have (on average 1.1866666666666668) internal successors, (89), 83 states have internal predecessors, (89), 0 states have call successors, (0), 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-19 08:29:46,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2022-11-19 08:29:46,595 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 31 [2022-11-19 08:29:46,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:29:46,596 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2022-11-19 08:29:46,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.2432432432432434) internal successors, (83), 37 states have internal predecessors, (83), 0 states have call successors, (0), 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-19 08:29:46,596 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2022-11-19 08:29:46,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-19 08:29:46,596 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:29:46,597 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:29:46,609 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-19 08:29:46,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-19 08:29:46,797 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-19 08:29:46,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:29:46,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1862398896, now seen corresponding path program 1 times [2022-11-19 08:29:46,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:29:46,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421135296] [2022-11-19 08:29:46,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:29:46,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:29:46,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:29:47,433 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:29:47,433 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:29:47,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421135296] [2022-11-19 08:29:47,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421135296] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:29:47,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324298338] [2022-11-19 08:29:47,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:29:47,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:29:47,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:29:47,435 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:29:47,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-19 08:29:47,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:29:47,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-19 08:29:47,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:29:47,676 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-19 08:29:47,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-19 08:29:47,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:29:47,817 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:29:47,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-19 08:29:47,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-19 08:29:47,993 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 08:29:47,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:29:48,191 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:29:48,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-19 08:29:48,204 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:29:48,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-19 08:29:48,222 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 3 [2022-11-19 08:29:48,323 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:29:48,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2022-11-19 08:29:48,532 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 08:29:48,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324298338] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:29:48,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1566711623] [2022-11-19 08:29:48,536 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2022-11-19 08:29:48,537 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 08:29:48,537 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 08:29:48,537 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 08:29:48,537 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 08:29:48,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:48,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:48,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-19 08:29:48,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:48,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-19 08:29:48,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 08:29:48,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 08:29:48,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:48,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:48,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:48,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:48,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:48,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-19 08:29:48,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:29:48,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:48,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:48,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-19 08:29:48,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:29:48,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:48,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:48,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-19 08:29:48,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:29:48,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:29:48,936 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-19 08:29:48,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 260 treesize of output 242 [2022-11-19 08:29:48,958 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:29:49,013 INFO L321 Elim1Store]: treesize reduction 76, result has 25.5 percent of original size [2022-11-19 08:29:49,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 256 treesize of output 257 [2022-11-19 08:29:49,051 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-19 08:29:49,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 256 treesize of output 238 [2022-11-19 08:29:49,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2022-11-19 08:29:49,761 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-11-19 08:29:49,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-11-19 08:29:49,877 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-11-19 08:29:49,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-11-19 08:29:49,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 08:29:50,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 08:29:50,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:50,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-19 08:29:50,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:50,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:50,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:50,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:50,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:50,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-19 08:29:50,039 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 08:29:54,662 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5911#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= |ULTIMATE.start_main_~flag~0#1| 1) (<= 0 |ULTIMATE.start_main_~flag~0#1|) (not (< |ULTIMATE.start_main_~p~0#1.base| |#StackHeapBarrier|)) (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |#NULL.offset| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-19 08:29:54,662 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 08:29:54,663 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:29:54,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 22 [2022-11-19 08:29:54,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190039066] [2022-11-19 08:29:54,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:29:54,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-19 08:29:54,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:29:54,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-19 08:29:54,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=1511, Unknown=7, NotChecked=0, Total=1806 [2022-11-19 08:29:54,665 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 23 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 23 states have internal predecessors, (73), 0 states have call successors, (0), 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-19 08:29:55,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:29:55,421 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2022-11-19 08:29:55,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-19 08:29:55,424 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 23 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-19 08:29:55,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:29:55,425 INFO L225 Difference]: With dead ends: 129 [2022-11-19 08:29:55,425 INFO L226 Difference]: Without dead ends: 129 [2022-11-19 08:29:55,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 61 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=437, Invalid=2207, Unknown=8, NotChecked=0, Total=2652 [2022-11-19 08:29:55,427 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 290 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 176 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 08:29:55,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 254 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 311 Invalid, 0 Unknown, 176 Unchecked, 0.4s Time] [2022-11-19 08:29:55,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-19 08:29:55,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 85. [2022-11-19 08:29:55,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 76 states have (on average 1.1842105263157894) internal successors, (90), 84 states have internal predecessors, (90), 0 states have call successors, (0), 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-19 08:29:55,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2022-11-19 08:29:55,431 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 33 [2022-11-19 08:29:55,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:29:55,431 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2022-11-19 08:29:55,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 23 states have internal predecessors, (73), 0 states have call successors, (0), 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-19 08:29:55,432 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2022-11-19 08:29:55,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-19 08:29:55,432 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:29:55,432 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:29:55,445 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-19 08:29:55,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:29:55,645 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-19 08:29:55,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:29:55,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1862401458, now seen corresponding path program 1 times [2022-11-19 08:29:55,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:29:55,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491800558] [2022-11-19 08:29:55,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:29:55,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:29:55,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:29:56,230 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:29:56,230 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:29:56,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491800558] [2022-11-19 08:29:56,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491800558] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:29:56,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997315334] [2022-11-19 08:29:56,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:29:56,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:29:56,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:29:56,232 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:29:56,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-19 08:29:56,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:29:56,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-19 08:29:56,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:29:56,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 08:29:56,520 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-19 08:29:56,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-19 08:29:56,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:29:56,716 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:29:56,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-19 08:29:56,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-19 08:29:56,967 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 13 treesize of output 9 [2022-11-19 08:29:56,983 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 08:29:56,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:29:57,280 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:29:57,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-11-19 08:29:57,293 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:29:57,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2022-11-19 08:29:57,297 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 9 treesize of output 5 [2022-11-19 08:29:57,430 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 18 treesize of output 16 [2022-11-19 08:29:57,523 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:29:57,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2022-11-19 08:29:57,634 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 08:29:57,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997315334] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:29:57,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1599485341] [2022-11-19 08:29:57,638 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2022-11-19 08:29:57,638 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 08:29:57,638 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 08:29:57,639 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 08:29:57,639 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 08:29:57,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:57,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:57,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-19 08:29:57,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:57,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-19 08:29:57,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 08:29:57,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 08:29:57,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:57,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:57,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:57,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:57,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:57,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-19 08:29:57,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:29:57,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:57,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:57,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-19 08:29:57,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:29:57,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:29:57,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:57,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:57,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-19 08:29:57,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:29:57,989 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:29:58,046 INFO L321 Elim1Store]: treesize reduction 76, result has 25.5 percent of original size [2022-11-19 08:29:58,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 256 treesize of output 257 [2022-11-19 08:29:58,090 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-19 08:29:58,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 256 treesize of output 238 [2022-11-19 08:29:58,131 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-19 08:29:58,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 256 treesize of output 238 [2022-11-19 08:29:58,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2022-11-19 08:29:58,724 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-11-19 08:29:58,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-11-19 08:29:58,829 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-11-19 08:29:58,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-11-19 08:29:58,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:58,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-19 08:29:58,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 08:29:58,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 08:29:58,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:58,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:58,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:59,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:59,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:29:59,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-19 08:29:59,010 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 08:30:03,569 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6390#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= |ULTIMATE.start_main_~flag~0#1| 1) (<= 0 |ULTIMATE.start_main_~flag~0#1|) (exists ((|v_ULTIMATE.start_main_~p~0#1.offset_178| Int) (|v_ULTIMATE.start_main_~p~0#1.base_198| Int)) (and (= (select |#valid| |v_ULTIMATE.start_main_~p~0#1.base_198|) 1) (<= (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_178|) (select |#length| |v_ULTIMATE.start_main_~p~0#1.base_198|)) (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_178|) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~p~0#1.base_198|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_178|)) |ULTIMATE.start_main_~p~0#1.offset|) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~p~0#1.base_198|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_178|)) |ULTIMATE.start_main_~p~0#1.base|))) (<= 0 |ULTIMATE.start_main_~tmp~0#1.offset|) (= |#NULL.offset| 0) (not (= |ULTIMATE.start_main_~tmp~0#1.offset| 0)) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-19 08:30:03,569 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 08:30:03,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:30:03,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2022-11-19 08:30:03,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823446801] [2022-11-19 08:30:03,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:30:03,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-19 08:30:03,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:30:03,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-19 08:30:03,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=401, Invalid=2145, Unknown=4, NotChecked=0, Total=2550 [2022-11-19 08:30:03,572 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand has 33 states, 32 states have (on average 2.8125) internal successors, (90), 32 states have internal predecessors, (90), 0 states have call successors, (0), 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-19 08:30:04,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:30:04,895 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2022-11-19 08:30:04,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-19 08:30:04,896 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.8125) internal successors, (90), 32 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-19 08:30:04,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:30:04,897 INFO L225 Difference]: With dead ends: 130 [2022-11-19 08:30:04,897 INFO L226 Difference]: Without dead ends: 130 [2022-11-19 08:30:04,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 55 SyntacticMatches, 7 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1808 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=722, Invalid=3830, Unknown=4, NotChecked=0, Total=4556 [2022-11-19 08:30:04,899 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 381 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 226 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-19 08:30:04,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 470 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 559 Invalid, 0 Unknown, 226 Unchecked, 0.5s Time] [2022-11-19 08:30:04,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-19 08:30:04,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 86. [2022-11-19 08:30:04,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 77 states have (on average 1.1818181818181819) internal successors, (91), 85 states have internal predecessors, (91), 0 states have call successors, (0), 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-19 08:30:04,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2022-11-19 08:30:04,902 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 33 [2022-11-19 08:30:04,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:30:04,903 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2022-11-19 08:30:04,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.8125) internal successors, (90), 32 states have internal predecessors, (90), 0 states have call successors, (0), 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-19 08:30:04,903 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2022-11-19 08:30:04,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-19 08:30:04,904 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:30:04,904 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:30:04,920 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-19 08:30:05,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-19 08:30:05,123 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-19 08:30:05,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:30:05,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1899870503, now seen corresponding path program 1 times [2022-11-19 08:30:05,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:30:05,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818398634] [2022-11-19 08:30:05,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:30:05,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:30:05,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:30:05,922 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:30:05,922 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:30:05,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818398634] [2022-11-19 08:30:05,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818398634] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:30:05,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962049541] [2022-11-19 08:30:05,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:30:05,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:30:05,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:30:05,931 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:30:05,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-19 08:30:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:30:06,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-19 08:30:06,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:30:06,175 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-19 08:30:06,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-19 08:30:06,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:30:06,394 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:30:06,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-19 08:30:06,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-19 08:30:06,775 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:30:06,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:30:07,131 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:30:07,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-19 08:30:07,144 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:30:07,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-19 08:30:07,151 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 3 [2022-11-19 08:30:07,383 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:30:07,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2022-11-19 08:30:07,601 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 08:30:07,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962049541] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:30:07,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1028749631] [2022-11-19 08:30:07,603 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2022-11-19 08:30:07,604 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 08:30:07,604 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 08:30:07,604 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 08:30:07,604 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 08:30:07,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:30:07,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:30:07,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-19 08:30:07,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:30:07,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-19 08:30:07,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 08:30:07,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 08:30:07,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:30:07,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:30:07,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:30:07,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:30:07,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:30:07,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-19 08:30:07,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:30:07,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:30:07,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:30:07,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:30:07,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-19 08:30:07,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:30:07,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:30:07,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-19 08:30:07,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:30:07,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:30:08,013 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-19 08:30:08,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 260 treesize of output 242 [2022-11-19 08:30:08,035 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:30:08,087 INFO L321 Elim1Store]: treesize reduction 76, result has 25.5 percent of original size [2022-11-19 08:30:08,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 256 treesize of output 257 [2022-11-19 08:30:08,133 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-19 08:30:08,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 256 treesize of output 238 [2022-11-19 08:30:08,461 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 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-19 08:30:08,569 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-11-19 08:30:08,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-11-19 08:30:08,713 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-11-19 08:30:08,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-11-19 08:30:08,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 08:30:08,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 08:30:08,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:30:08,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-19 08:30:08,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:30:08,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:30:08,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:30:08,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:30:08,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:30:08,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-19 08:30:08,892 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 08:30:14,283 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6893#(and (or (and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~flag~0#1| 1) (= |#NULL.base| 0)) (and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~t~0#1.offset| 0) (= |#NULL.base| 0))) (not (< |ULTIMATE.start_main_~tmp~0#1.base| |#StackHeapBarrier|)) (<= |ULTIMATE.start_main_~flag~0#1| 1) (= |ULTIMATE.start_main_~tmp~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~flag~0#1|) (<= |#NULL.offset| 0) (exists ((|v_ULTIMATE.start_main_~p~0#1.base_217| Int) (|v_ULTIMATE.start_main_~p~0#1.offset_194| Int)) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~p~0#1.base_217|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_194|)) |ULTIMATE.start_main_~p~0#1.offset|) (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_194|) (= (select |#valid| |v_ULTIMATE.start_main_~p~0#1.base_217|) 1) (<= (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_194|) (select |#length| |v_ULTIMATE.start_main_~p~0#1.base_217|)) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~p~0#1.base_217|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_194|)) |ULTIMATE.start_main_~p~0#1.base|))) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|))' at error location [2022-11-19 08:30:14,283 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 08:30:14,284 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:30:14,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 11] total 34 [2022-11-19 08:30:14,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005718824] [2022-11-19 08:30:14,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:30:14,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-19 08:30:14,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:30:14,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-19 08:30:14,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=371, Invalid=2384, Unknown=1, NotChecked=0, Total=2756 [2022-11-19 08:30:14,286 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand has 35 states, 35 states have (on average 2.6285714285714286) internal successors, (92), 34 states have internal predecessors, (92), 0 states have call successors, (0), 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-19 08:30:15,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:30:15,847 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2022-11-19 08:30:15,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-19 08:30:15,848 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.6285714285714286) internal successors, (92), 34 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-19 08:30:15,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:30:15,849 INFO L225 Difference]: With dead ends: 107 [2022-11-19 08:30:15,849 INFO L226 Difference]: Without dead ends: 107 [2022-11-19 08:30:15,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 59 SyntacticMatches, 8 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=610, Invalid=3945, Unknown=1, NotChecked=0, Total=4556 [2022-11-19 08:30:15,851 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 291 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-19 08:30:15,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 422 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 744 Invalid, 0 Unknown, 129 Unchecked, 0.7s Time] [2022-11-19 08:30:15,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-19 08:30:15,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 84. [2022-11-19 08:30:15,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 75 states have (on average 1.1733333333333333) internal successors, (88), 83 states have internal predecessors, (88), 0 states have call successors, (0), 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-19 08:30:15,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2022-11-19 08:30:15,854 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 34 [2022-11-19 08:30:15,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:30:15,855 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2022-11-19 08:30:15,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.6285714285714286) internal successors, (92), 34 states have internal predecessors, (92), 0 states have call successors, (0), 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-19 08:30:15,855 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2022-11-19 08:30:15,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-19 08:30:15,856 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:30:15,856 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:30:15,868 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-19 08:30:16,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-19 08:30:16,062 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-19 08:30:16,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:30:16,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1236018122, now seen corresponding path program 1 times [2022-11-19 08:30:16,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:30:16,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466415123] [2022-11-19 08:30:16,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:30:16,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:30:16,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:30:16,997 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:30:16,997 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:30:16,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466415123] [2022-11-19 08:30:16,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466415123] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:30:16,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25968637] [2022-11-19 08:30:16,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:30:16,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:30:16,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:30:17,003 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:30:17,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-19 08:30:17,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:30:17,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-19 08:30:17,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:30:17,376 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-19 08:30:17,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 44 [2022-11-19 08:30:17,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:30:17,703 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:30:17,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 46 [2022-11-19 08:30:18,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2022-11-19 08:30:18,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 25 treesize of output 22 [2022-11-19 08:30:18,411 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 08:30:18,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:30:18,599 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_767 (Array Int Int))) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_767) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) is different from false [2022-11-19 08:30:18,613 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_767 (Array Int Int))) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) v_ArrVal_767) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) is different from false [2022-11-19 08:30:18,621 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:30:18,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-11-19 08:30:18,633 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:30:18,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 55 [2022-11-19 08:30:18,639 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 21 treesize of output 17 [2022-11-19 08:30:43,057 WARN L233 SmtUtils]: Spent 24.17s on a formula simplification. DAG size of input: 42 DAG size of output: 35 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-19 08:31:07,343 WARN L233 SmtUtils]: Spent 24.13s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-19 08:31:39,649 WARN L233 SmtUtils]: Spent 32.13s on a formula simplification. DAG size of input: 55 DAG size of output: 46 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-19 08:31:47,969 WARN L233 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-19 08:31:48,004 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2022-11-19 08:31:48,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25968637] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:31:48,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [813784640] [2022-11-19 08:31:48,007 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2022-11-19 08:31:48,007 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 08:31:48,007 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 08:31:48,008 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 08:31:48,008 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 08:31:48,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:48,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:48,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-19 08:31:48,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 08:31:48,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 08:31:48,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:48,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-19 08:31:48,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:48,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:48,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:48,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:48,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:48,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-19 08:31:48,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:31:48,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:48,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:48,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-19 08:31:48,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:31:48,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:31:48,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:48,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:48,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-19 08:31:48,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:31:48,361 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:31:48,416 INFO L321 Elim1Store]: treesize reduction 76, result has 25.5 percent of original size [2022-11-19 08:31:48,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 256 treesize of output 257 [2022-11-19 08:31:48,453 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-19 08:31:48,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 256 treesize of output 238 [2022-11-19 08:31:48,487 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-19 08:31:48,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 256 treesize of output 238 [2022-11-19 08:31:48,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2022-11-19 08:31:48,868 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-11-19 08:31:48,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-11-19 08:31:49,003 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-11-19 08:31:49,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-11-19 08:31:49,052 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 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-19 08:31:49,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:49,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-19 08:31:49,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 08:31:49,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 08:31:49,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:49,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:49,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:49,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:49,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:49,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-19 08:31:49,229 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 08:31:55,301 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7375#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (< |ULTIMATE.start_main_~p~0#1.base| |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~flag~0#1| 1) (not (= |ULTIMATE.start_main_old_#valid#1| |#valid|)) (<= 0 |ULTIMATE.start_main_~flag~0#1|) (= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 0) (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |#NULL.offset| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_main_#res#1| 0) (= |#NULL.base| 0))' at error location [2022-11-19 08:31:55,301 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 08:31:55,301 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:31:55,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 35 [2022-11-19 08:31:55,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128175903] [2022-11-19 08:31:55,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:31:55,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-19 08:31:55,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:31:55,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-19 08:31:55,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=2985, Unknown=3, NotChecked=226, Total=3540 [2022-11-19 08:31:55,305 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 37 states, 36 states have (on average 2.6944444444444446) internal successors, (97), 36 states have internal predecessors, (97), 0 states have call successors, (0), 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-19 08:31:56,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:31:56,348 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-11-19 08:31:56,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-19 08:31:56,348 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.6944444444444446) internal successors, (97), 36 states have internal predecessors, (97), 0 states have call successors, (0), 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 35 [2022-11-19 08:31:56,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:31:56,349 INFO L225 Difference]: With dead ends: 93 [2022-11-19 08:31:56,349 INFO L226 Difference]: Without dead ends: 71 [2022-11-19 08:31:56,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 55 SyntacticMatches, 5 SemanticMatches, 64 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1674 ImplicationChecksByTransitivity, 96.6s TimeCoverageRelationStatistics Valid=401, Invalid=3636, Unknown=3, NotChecked=250, Total=4290 [2022-11-19 08:31:56,351 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 53 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 286 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 08:31:56,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 397 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 420 Invalid, 0 Unknown, 286 Unchecked, 0.4s Time] [2022-11-19 08:31:56,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-19 08:31:56,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2022-11-19 08:31:56,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 63 states have internal predecessors, (67), 0 states have call successors, (0), 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-19 08:31:56,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2022-11-19 08:31:56,354 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 35 [2022-11-19 08:31:56,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:31:56,354 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2022-11-19 08:31:56,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.6944444444444446) internal successors, (97), 36 states have internal predecessors, (97), 0 states have call successors, (0), 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-19 08:31:56,355 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2022-11-19 08:31:56,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-19 08:31:56,355 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:31:56,355 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:31:56,363 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-19 08:31:56,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:31:56,561 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-19 08:31:56,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:31:56,561 INFO L85 PathProgramCache]: Analyzing trace with hash -403151837, now seen corresponding path program 1 times [2022-11-19 08:31:56,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:31:56,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463961830] [2022-11-19 08:31:56,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:31:56,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:31:56,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:31:57,494 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:31:57,494 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:31:57,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463961830] [2022-11-19 08:31:57,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463961830] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:31:57,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643086540] [2022-11-19 08:31:57,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:31:57,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:31:57,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:31:57,496 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:31:57,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-19 08:31:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:31:57,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-19 08:31:57,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:31:57,756 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 08:31:57,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-19 08:31:57,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:31:57,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:31:58,083 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:31:58,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-11-19 08:31:58,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 08:31:58,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:31:58,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 21 [2022-11-19 08:31:58,215 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-19 08:31:58,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-19 08:31:58,356 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 08:31:58,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-11-19 08:31:58,365 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 11 treesize of output 7 [2022-11-19 08:31:58,380 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:31:58,392 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-19 08:31:58,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 37 treesize of output 28 [2022-11-19 08:31:58,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 20 [2022-11-19 08:31:58,681 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-19 08:31:58,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 99 [2022-11-19 08:31:58,700 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:31:58,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 103 [2022-11-19 08:31:58,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2022-11-19 08:31:58,914 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:31:58,920 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-19 08:31:58,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 30 [2022-11-19 08:31:58,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 33 treesize of output 17 [2022-11-19 08:31:58,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2022-11-19 08:31:58,999 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 08:31:58,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:31:59,103 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_858 (Array Int Int)) (v_ArrVal_859 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (not (= 3 (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_858) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_860) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_859) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) is different from false [2022-11-19 08:31:59,118 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_858 (Array Int Int)) (v_ArrVal_859 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (not (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int| .cse0 v_ArrVal_858) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_860) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_859) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) 3))) is different from false [2022-11-19 08:31:59,130 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_859 (Array Int Int)) (v_ArrVal_856 Int) (v_ArrVal_860 (Array Int Int))) (not (= 3 (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 v_ArrVal_856)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_858) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_860) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_853) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_859) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) is different from false [2022-11-19 08:31:59,237 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:31:59,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 53 treesize of output 57 [2022-11-19 08:31:59,261 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:31:59,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 66 [2022-11-19 08:31:59,276 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:31:59,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 124 [2022-11-19 08:31:59,283 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 76 treesize of output 58 [2022-11-19 08:31:59,326 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 30 treesize of output 22 [2022-11-19 08:31:59,708 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:31:59,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 109 [2022-11-19 08:31:59,719 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:31:59,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 99 [2022-11-19 08:31:59,736 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:31:59,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 207 treesize of output 146 [2022-11-19 08:31:59,743 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 126 treesize of output 118 [2022-11-19 08:31:59,750 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 118 treesize of output 114 [2022-11-19 08:31:59,769 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:31:59,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 253 treesize of output 246 [2022-11-19 08:31:59,781 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 230 treesize of output 222 [2022-11-19 08:31:59,790 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 222 treesize of output 214 [2022-11-19 08:31:59,808 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:31:59,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 214 treesize of output 199 [2022-11-19 08:31:59,827 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:31:59,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 190 treesize of output 159 [2022-11-19 08:32:01,046 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:32:01,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 107 treesize of output 255 [2022-11-19 08:32:02,624 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2022-11-19 08:32:02,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643086540] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:32:02,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1391525293] [2022-11-19 08:32:02,626 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-11-19 08:32:02,626 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 08:32:02,626 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 08:32:02,627 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 08:32:02,627 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 08:32:02,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:02,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:02,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-19 08:32:02,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 08:32:02,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 08:32:02,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:02,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-19 08:32:02,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:02,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:02,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:02,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:02,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:02,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-19 08:32:02,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:02,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:02,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-19 08:32:02,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:32:02,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:32:02,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:02,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:02,859 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-19 08:32:02,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 46 [2022-11-19 08:32:02,892 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-19 08:32:02,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 34 treesize of output 16 [2022-11-19 08:32:02,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:02,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2022-11-19 08:32:03,025 INFO L321 Elim1Store]: treesize reduction 142, result has 15.5 percent of original size [2022-11-19 08:32:03,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 351 treesize of output 351 [2022-11-19 08:32:03,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:32:03,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:32:03,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-19 08:32:03,332 INFO L321 Elim1Store]: treesize reduction 64, result has 29.7 percent of original size [2022-11-19 08:32:03,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 129 [2022-11-19 08:32:03,379 INFO L321 Elim1Store]: treesize reduction 64, result has 29.7 percent of original size [2022-11-19 08:32:03,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 117 [2022-11-19 08:32:03,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 08:32:03,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:03,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 16 [2022-11-19 08:32:03,502 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-19 08:32:03,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 16 [2022-11-19 08:32:03,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 08:32:03,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 08:32:03,545 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 9 [2022-11-19 08:32:03,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-19 08:32:03,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:32:03,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:32:03,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:03,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 16 [2022-11-19 08:32:03,639 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-19 08:32:03,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 16 [2022-11-19 08:32:03,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 08:32:03,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:03,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 16 [2022-11-19 08:32:03,698 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-19 08:32:03,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 16 [2022-11-19 08:32:03,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 08:32:03,785 INFO L321 Elim1Store]: treesize reduction 58, result has 29.3 percent of original size [2022-11-19 08:32:03,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 180 treesize of output 194 [2022-11-19 08:32:03,877 INFO L321 Elim1Store]: treesize reduction 62, result has 41.5 percent of original size [2022-11-19 08:32:03,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 181 treesize of output 213 [2022-11-19 08:32:04,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:32:04,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-19 08:32:04,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:32:04,206 INFO L321 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-11-19 08:32:04,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 163 [2022-11-19 08:32:04,248 INFO L321 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-11-19 08:32:04,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 151 [2022-11-19 08:32:04,302 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-19 08:32:04,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 143 treesize of output 149 [2022-11-19 08:32:05,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2022-11-19 08:32:05,455 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-11-19 08:32:05,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-11-19 08:32:05,600 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-11-19 08:32:05,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-11-19 08:32:05,732 INFO L321 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-11-19 08:32:05,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 174 [2022-11-19 08:32:05,773 INFO L321 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-11-19 08:32:05,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 162 [2022-11-19 08:32:05,810 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-19 08:32:05,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 154 treesize of output 160 [2022-11-19 08:32:05,987 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-19 08:32:05,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 16 [2022-11-19 08:32:05,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:32:05,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 16 [2022-11-19 08:32:06,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 08:32:06,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 08:32:06,043 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 9 [2022-11-19 08:32:06,045 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 08:32:09,829 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7832#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= |ULTIMATE.start_main_~flag~0#1| 1) (<= 0 |ULTIMATE.start_main_~flag~0#1|) (not (= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-19 08:32:09,829 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 08:32:09,829 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:32:09,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 41 [2022-11-19 08:32:09,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544710101] [2022-11-19 08:32:09,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:32:09,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-19 08:32:09,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:32:09,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-19 08:32:09,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=3114, Unknown=4, NotChecked=348, Total=3782 [2022-11-19 08:32:09,832 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand has 42 states, 42 states have (on average 2.4761904761904763) internal successors, (104), 41 states have internal predecessors, (104), 0 states have call successors, (0), 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-19 08:32:17,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:32:17,433 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2022-11-19 08:32:17,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-19 08:32:17,434 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.4761904761904763) internal successors, (104), 41 states have internal predecessors, (104), 0 states have call successors, (0), 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 38 [2022-11-19 08:32:17,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:32:17,435 INFO L225 Difference]: With dead ends: 125 [2022-11-19 08:32:17,435 INFO L226 Difference]: Without dead ends: 107 [2022-11-19 08:32:17,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 64 SyntacticMatches, 8 SemanticMatches, 92 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2609 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=803, Invalid=7388, Unknown=11, NotChecked=540, Total=8742 [2022-11-19 08:32:17,436 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 274 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 1473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 543 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-19 08:32:17,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 655 Invalid, 1473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 825 Invalid, 0 Unknown, 543 Unchecked, 0.7s Time] [2022-11-19 08:32:17,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-19 08:32:17,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 79. [2022-11-19 08:32:17,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 70 states have (on average 1.1857142857142857) internal successors, (83), 78 states have internal predecessors, (83), 0 states have call successors, (0), 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-19 08:32:17,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2022-11-19 08:32:17,440 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 38 [2022-11-19 08:32:17,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:32:17,440 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2022-11-19 08:32:17,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.4761904761904763) internal successors, (104), 41 states have internal predecessors, (104), 0 states have call successors, (0), 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-19 08:32:17,441 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2022-11-19 08:32:17,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-19 08:32:17,441 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:32:17,441 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:32:17,451 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-11-19 08:32:17,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-19 08:32:17,647 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-19 08:32:17,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:32:17,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1434091777, now seen corresponding path program 2 times [2022-11-19 08:32:17,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:32:17,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520978327] [2022-11-19 08:32:17,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:32:17,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:32:17,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:32:19,182 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:32:19,182 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:32:19,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520978327] [2022-11-19 08:32:19,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520978327] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:32:19,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426296401] [2022-11-19 08:32:19,182 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 08:32:19,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:32:19,183 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:32:19,184 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:32:19,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-19 08:32:19,358 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-19 08:32:19,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:32:19,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 92 conjunts are in the unsatisfiable core [2022-11-19 08:32:19,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:32:19,457 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-19 08:32:19,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-19 08:32:19,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:32:19,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:32:19,618 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 08:32:19,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-19 08:32:19,625 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 5 treesize of output 3 [2022-11-19 08:32:19,643 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:32:19,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2022-11-19 08:32:19,707 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-19 08:32:19,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-19 08:32:19,787 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 08:32:19,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-19 08:32:19,797 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 5 treesize of output 3 [2022-11-19 08:32:19,821 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-19 08:32:19,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 29 treesize of output 24 [2022-11-19 08:32:20,106 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 08:32:20,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-19 08:32:20,116 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 5 treesize of output 3 [2022-11-19 08:32:20,168 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-19 08:32:20,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 53 [2022-11-19 08:32:20,180 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 16 treesize of output 8 [2022-11-19 08:32:20,317 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-19 08:32:20,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-19 08:32:20,476 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-19 08:32:20,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-11-19 08:32:20,537 INFO L321 Elim1Store]: treesize reduction 54, result has 31.6 percent of original size [2022-11-19 08:32:20,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 62 [2022-11-19 08:32:21,012 INFO L321 Elim1Store]: treesize reduction 50, result has 39.0 percent of original size [2022-11-19 08:32:21,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 179 treesize of output 155 [2022-11-19 08:32:21,086 INFO L321 Elim1Store]: treesize reduction 74, result has 43.9 percent of original size [2022-11-19 08:32:21,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 127 treesize of output 153 [2022-11-19 08:32:21,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 08:32:21,198 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 5 treesize of output 3 [2022-11-19 08:32:21,307 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 18 treesize of output 10 [2022-11-19 08:32:22,022 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:32:22,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 359 treesize of output 381 [2022-11-19 08:32:22,255 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 19 treesize of output 11 [2022-11-19 08:32:22,295 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 19 treesize of output 11 [2022-11-19 08:32:22,330 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 19 treesize of output 11 [2022-11-19 08:32:23,699 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 62 treesize of output 50 [2022-11-19 08:32:23,720 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 77 treesize of output 63 [2022-11-19 08:32:23,770 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 62 treesize of output 50 [2022-11-19 08:32:23,794 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 81 treesize of output 69 [2022-11-19 08:32:24,459 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 63 treesize of output 51 [2022-11-19 08:32:24,523 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 133 treesize of output 113 [2022-11-19 08:32:29,579 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:32:29,601 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:32:29,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 173 treesize of output 167 [2022-11-19 08:32:30,466 INFO L321 Elim1Store]: treesize reduction 4, result has 97.1 percent of original size [2022-11-19 08:32:30,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 136 treesize of output 212 [2022-11-19 08:32:32,026 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-19 08:32:32,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 24 [2022-11-19 08:32:32,057 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-19 08:32:32,061 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:32:32,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:32:32,691 INFO L321 Elim1Store]: treesize reduction 4, result has 86.2 percent of original size [2022-11-19 08:32:32,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 95 [2022-11-19 08:32:34,203 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:32:34,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 21 treesize of output 25 [2022-11-19 08:32:34,211 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:32:34,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 28 [2022-11-19 08:32:34,231 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:32:34,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 44 [2022-11-19 08:32:34,251 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:32:34,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-11-19 08:32:34,260 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:32:34,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 28 [2022-11-19 08:32:35,387 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:32:35,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 310 treesize of output 494 [2022-11-19 08:32:35,841 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 50 treesize of output 42 [2022-11-19 08:32:35,873 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 57 treesize of output 45 [2022-11-19 08:32:35,931 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 41 treesize of output 33 [2022-11-19 08:32:36,063 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 3 [2022-11-19 08:32:36,221 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 46 treesize of output 38 [2022-11-19 08:32:36,275 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 46 treesize of output 38 [2022-11-19 08:32:36,786 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 19 treesize of output 11 [2022-11-19 08:32:36,869 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 11 treesize of output 7 [2022-11-19 08:32:36,932 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 28 treesize of output 20 [2022-11-19 08:32:37,133 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 35 treesize of output 23 [2022-11-19 08:32:37,376 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 45 treesize of output 37 [2022-11-19 08:32:37,469 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 52 treesize of output 40 [2022-11-19 08:32:37,532 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 45 treesize of output 37 [2022-11-19 08:32:37,636 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 291 treesize of output 275 [2022-11-19 08:32:38,718 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 30 treesize of output 18 [2022-11-19 08:32:38,762 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 63 treesize of output 47 [2022-11-19 08:32:38,865 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 56 treesize of output 44 [2022-11-19 08:32:39,134 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 57 treesize of output 45 [2022-11-19 08:32:39,149 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 45 treesize of output 37 [2022-11-19 08:32:39,240 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 19 treesize of output 11 [2022-11-19 08:32:39,404 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-19 08:32:39,514 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 46 treesize of output 38 [2022-11-19 08:32:40,076 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 23 treesize of output 15 [2022-11-19 08:32:40,277 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 208 treesize of output 196 [2022-11-19 08:32:40,479 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 215 treesize of output 199 [2022-11-19 08:32:40,700 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 182 treesize of output 170 [2022-11-19 08:32:48,689 WARN L859 $PredicateComparison]: unable to prove that (or (< |c_ULTIMATE.start_main_~a~0#1.offset| 0) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|))) (let ((.cse15 (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse187 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse187) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse188 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store .cse188 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse187 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_subst_2 Int) (v_prenex_127 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse190 (+ 4 v_subst_2))) (let ((.cse189 (select v_arrayElimArr_19 .cse190))) (or (not (= (select (select (store (store .cse188 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse189 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse187 .cse189) (not (= (select v_arrayElimArr_20 .cse190) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse189 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse189)))))))))))) (.cse55 (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse183 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse184 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse182 (select (select (store (store .cse184 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse183 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse182) (= .cse183 .cse182) (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_subst_2 Int) (v_prenex_127 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse186 (+ 4 v_subst_2))) (let ((.cse185 (select v_arrayElimArr_19 .cse186))) (or (not (= (select (select (store (store .cse184 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse185 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse183 .cse185) (not (= (select v_arrayElimArr_20 .cse186) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse185 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse185))))))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse183))))) (.cse16 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (and (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse0 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse0) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store .cse1 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse0 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_subst_1 Int) (v_prenex_126 (Array Int Int))) (let ((.cse3 (+ 4 v_subst_1))) (let ((.cse4 (select v_arrayElimArr_22 .cse3))) (or (not (= (select v_arrayElimArr_23 .cse3) 0)) (not (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse4 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse4 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse4) (= .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))))))))))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse10 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse9 (select (select (store (store .cse7 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse10 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_arrayElimArr_23 (Array Int Int)) (v_subst_1 Int)) (let ((.cse6 (+ 4 v_subst_1))) (or (not (= (select v_arrayElimArr_23 .cse6) 0)) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_prenex_126 (Array Int Int))) (let ((.cse8 (select v_arrayElimArr_22 .cse6))) (or (not (= (select (select (store (store .cse7 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse8 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse8 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse8) (= .cse8 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse8 .cse9))))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse9))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse10)))) (or (and (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse14 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (or (forall ((v_prenex_490 (Array Int Int)) (v_prenex_491 (Array Int Int)) (v_prenex_493 (Array Int Int)) (v_prenex_494 (Array Int Int)) (v_prenex_495 (Array Int Int)) (v_prenex_492 Int)) (let ((.cse13 (+ v_prenex_492 4))) (let ((.cse12 (select v_prenex_491 .cse13))) (or (not (= (select (select (store (store .cse11 |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_491) .cse12 v_prenex_490) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_493) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_494) .cse12 v_prenex_495) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_prenex_494 .cse13) 0)) (= .cse12 |c_ULTIMATE.start_main_~p~0#1.base|))))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store .cse11 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse14 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse14)))) .cse15) .cse16) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_subst_2 Int) (v_ArrVal_981 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse19 (+ 4 v_subst_2))) (let ((.cse18 (select v_arrayElimArr_19 .cse19)) (.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (or (not (= (select (select (store (store .cse17 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse18 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= (select v_arrayElimArr_20 .cse19) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse18 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse18) (= .cse18 (select (select (store (store .cse17 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) (select v_arrayElimArr_21 (+ 4 v_subst_3)) v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) .cse16) (or (forall ((v_prenex_316 (Array Int Int)) (v_prenex_317 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_prenex_319 (Array Int Int)) (v_prenex_320 (Array Int Int)) (v_prenex_321 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_prenex_318 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse23 (+ v_prenex_318 4))) (let ((.cse21 (select v_arrayElimArr_21 (+ 4 v_subst_3))) (.cse22 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse20 (select v_prenex_317 .cse23))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_319) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_320) .cse20 v_prenex_321) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse21 .cse20) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse21) (= (select (select (store (store .cse22 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse21 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse20) (not (= (select (select (store (store .cse22 |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_317) .cse20 v_prenex_316) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse20) (not (= (select v_prenex_320 .cse23) 0)))))) .cse16) (or (forall ((v_prenex_316 (Array Int Int)) (v_prenex_317 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_prenex_319 (Array Int Int)) (v_prenex_320 (Array Int Int)) (v_prenex_321 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_prenex_318 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse27 (+ v_prenex_318 4))) (let ((.cse25 (select v_arrayElimArr_21 (+ 4 v_subst_3))) (.cse26 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse24 (select v_prenex_317 .cse27))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_319) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_320) .cse24 v_prenex_321) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse25 .cse24) (= (select (select (store (store .cse26 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse25 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse24) (not (= (select (select (store (store .cse26 |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_317) .cse24 v_prenex_316) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse24) (not (= (select v_prenex_320 .cse27) 0)))))) .cse16) (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse29 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse31 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_subst_1 Int) (v_prenex_126 (Array Int Int))) (let ((.cse28 (+ 4 v_subst_1))) (let ((.cse30 (select v_arrayElimArr_22 .cse28))) (or (not (= (select v_arrayElimArr_23 .cse28) 0)) (not (= (select (select (store (store .cse29 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse30 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse30 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse30) (= .cse30 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse30 .cse31))))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store .cse29 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse31 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_subst_2 Int) (v_ArrVal_981 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse32 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse35 (+ 4 v_subst_2))) (let ((.cse33 (select v_arrayElimArr_19 .cse35)) (.cse34 (select (select (store (store .cse32 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) (select v_arrayElimArr_21 (+ 4 v_subst_3)) v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select (select (store (store .cse32 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse33 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse34) (not (= (select v_arrayElimArr_20 .cse35) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse33 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse33) (= .cse33 .cse34))))) .cse16) (or .cse16 (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_subst_2 Int) (v_ArrVal_981 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse40 (+ 4 v_subst_2)) (.cse36 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse39 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse38 (select (select (store (store .cse36 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse39 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse37 (select v_arrayElimArr_19 .cse40))) (or (not (= (select (select (store (store .cse36 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse37 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse38) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse39) (= .cse39 .cse37) (= .cse39 .cse38) (not (= (select v_arrayElimArr_20 .cse40) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse37 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse37)))))) (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse42 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse45 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse44 (select (select (store (store .cse42 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse45 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_arrayElimArr_23 (Array Int Int)) (v_subst_1 Int)) (let ((.cse41 (+ 4 v_subst_1))) (or (not (= (select v_arrayElimArr_23 .cse41) 0)) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_prenex_126 (Array Int Int))) (let ((.cse43 (select v_arrayElimArr_22 .cse41))) (or (not (= (select (select (store (store .cse42 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse43 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse43 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse43) (= .cse43 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse43 .cse44) (= .cse43 .cse45))))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse44))))) (or (and (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse46 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse46) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse49 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (or (forall ((v_prenex_466 Int) (v_prenex_464 (Array Int Int)) (v_prenex_465 (Array Int Int)) (v_prenex_467 (Array Int Int)) (v_prenex_468 (Array Int Int)) (v_prenex_469 (Array Int Int))) (let ((.cse47 (+ v_prenex_466 4))) (let ((.cse48 (select v_prenex_465 .cse47))) (or (not (= (select v_prenex_468 .cse47) 0)) (= .cse48 |c_ULTIMATE.start_main_~p~0#1.base|) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_467) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_468) .cse48 v_prenex_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select (select (store (store .cse49 |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_465) .cse48 v_prenex_464) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)))))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store .cse49 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse46 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))))) .cse15) .cse16) (or (and (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse54 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse50 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse53 (select (select (store (store .cse50 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse54 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_prenex_490 (Array Int Int)) (v_prenex_491 (Array Int Int)) (v_prenex_493 (Array Int Int)) (v_prenex_494 (Array Int Int)) (v_prenex_495 (Array Int Int)) (v_prenex_492 Int)) (let ((.cse52 (+ v_prenex_492 4))) (let ((.cse51 (select v_prenex_491 .cse52))) (or (not (= (select (select (store (store .cse50 |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_491) .cse51 v_prenex_490) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_493) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_494) .cse51 v_prenex_495) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_prenex_494 .cse52) 0)) (= .cse51 |c_ULTIMATE.start_main_~p~0#1.base|))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse53) (= .cse54 .cse53))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse54)))) .cse55) .cse16) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse60 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse57 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse59 (select (select (store (store .cse57 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse60 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_arrayElimArr_23 (Array Int Int)) (v_subst_1 Int)) (let ((.cse56 (+ 4 v_subst_1))) (or (not (= (select v_arrayElimArr_23 .cse56) 0)) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_prenex_126 (Array Int Int))) (let ((.cse58 (select v_arrayElimArr_22 .cse56))) (or (not (= (select (select (store (store .cse57 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse58 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse58 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse58) (= .cse58 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse58 .cse59))))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse59) (= .cse60 .cse59))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse60)))) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int)) (v_subst_1 Int)) (let ((.cse63 (+ 4 v_subst_1))) (let ((.cse61 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse62 (select v_arrayElimArr_22 .cse63)) (.cse64 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((v_prenex_126 (Array Int Int))) (not (= (select (select (store (store .cse61 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse62 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse63) 0)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse62 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse62) (= .cse62 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse62 (select (select (store (store .cse61 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse64 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse62 .cse64))))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse65 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse65) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse68 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse66 (select (select (store (store .cse68 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse65 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse66) (= .cse65 .cse66) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_subst_1 Int) (v_prenex_126 (Array Int Int))) (let ((.cse67 (+ 4 v_subst_1))) (let ((.cse69 (select v_arrayElimArr_22 .cse67))) (or (not (= (select v_arrayElimArr_23 .cse67) 0)) (not (= (select (select (store (store .cse68 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse69 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse69 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse69) (= .cse69 |c_ULTIMATE.start_main_~a~0#1.base|)))))))))))) (or (and (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse70 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse70) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse71 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse74 (select (select (store (store .cse71 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse70 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_subst_2 Int) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse73 (+ 4 v_subst_2))) (let ((.cse72 (select v_arrayElimArr_19 .cse73))) (or (not (= (select (select (store (store .cse71 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse72 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= (select v_arrayElimArr_20 .cse73) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse72 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse72) (= .cse72 .cse74))))) (= .cse70 .cse74)))))))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse75 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse78 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse76 (select (select (store (store .cse78 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse75 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse75 .cse76) (forall ((v_prenex_316 (Array Int Int)) (v_prenex_317 (Array Int Int)) (v_prenex_319 (Array Int Int)) (v_prenex_320 (Array Int Int)) (v_prenex_321 (Array Int Int)) (v_prenex_318 Int)) (let ((.cse79 (+ v_prenex_318 4))) (let ((.cse77 (select v_prenex_317 .cse79))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_319) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_320) .cse77 v_prenex_321) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse75 .cse77) (= .cse76 .cse77) (not (= (select (select (store (store .cse78 |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_317) .cse77 v_prenex_316) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse77) (not (= (select v_prenex_320 .cse79) 0)))))))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse75))))) .cse16) (or (and (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse84 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse80 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse83 (select (select (store (store .cse80 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse84 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_subst_2 Int) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse82 (+ 4 v_subst_2))) (let ((.cse81 (select v_arrayElimArr_19 .cse82))) (or (not (= (select (select (store (store .cse80 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse81 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= (select v_arrayElimArr_20 .cse82) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse81 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse81) (= .cse81 .cse83))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse83) (= .cse84 .cse83))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse84)))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse85 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse85) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse88 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse86 (select (select (store (store .cse88 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse85 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse86) (= .cse85 .cse86) (forall ((v_prenex_316 (Array Int Int)) (v_prenex_317 (Array Int Int)) (v_prenex_319 (Array Int Int)) (v_prenex_320 (Array Int Int)) (v_prenex_321 (Array Int Int)) (v_prenex_318 Int)) (let ((.cse89 (+ v_prenex_318 4))) (let ((.cse87 (select v_prenex_317 .cse89))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_319) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_320) .cse87 v_prenex_321) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse85 .cse87) (= .cse86 .cse87) (not (= (select (select (store (store .cse88 |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_317) .cse87 v_prenex_316) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse87) (not (= (select v_prenex_320 .cse89) 0)))))))))))))) .cse16) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_subst_2 Int) (v_ArrVal_981 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse92 (+ 4 v_subst_2))) (let ((.cse90 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse91 (select v_arrayElimArr_19 .cse92))) (or (not (= (select (select (store (store .cse90 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse91 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store .cse90 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) (select v_arrayElimArr_21 (+ 4 v_subst_3)) v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (select v_arrayElimArr_20 .cse92) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse91 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse91))))) .cse16) (or (and (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse97 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse95 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse96 (select (select (store (store .cse95 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse97 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_prenex_466 Int) (v_prenex_464 (Array Int Int)) (v_prenex_465 (Array Int Int)) (v_prenex_467 (Array Int Int)) (v_prenex_468 (Array Int Int)) (v_prenex_469 (Array Int Int))) (let ((.cse93 (+ v_prenex_466 4))) (let ((.cse94 (select v_prenex_465 .cse93))) (or (not (= (select v_prenex_468 .cse93) 0)) (= .cse94 |c_ULTIMATE.start_main_~p~0#1.base|) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_467) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_468) .cse94 v_prenex_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select (select (store (store .cse95 |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_465) .cse94 v_prenex_464) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse96) (= .cse97 .cse96))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse97)))) .cse55) .cse16) (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse99 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse102 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse98 (select (select (store (store .cse99 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse102 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse98) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_subst_1 Int)) (let ((.cse101 (+ 4 v_subst_1))) (let ((.cse100 (select v_arrayElimArr_22 .cse101))) (or (forall ((v_prenex_126 (Array Int Int))) (not (= (select (select (store (store .cse99 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse100 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse101) 0)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse100 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse100) (= .cse100 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse100 .cse98) (= .cse100 .cse102))))))))) (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse105 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse107 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse103 (select (select (store (store .cse105 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse107 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse103) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_subst_1 Int) (v_prenex_126 (Array Int Int))) (let ((.cse104 (+ 4 v_subst_1))) (let ((.cse106 (select v_arrayElimArr_22 .cse104))) (or (not (= (select v_arrayElimArr_23 .cse104) 0)) (not (= (select (select (store (store .cse105 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse106 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse106 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse106) (= .cse106 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse106 .cse103) (= .cse106 .cse107))))))))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse112 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse109 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse111 (select (select (store (store .cse109 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse112 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_arrayElimArr_23 (Array Int Int)) (v_subst_1 Int)) (let ((.cse108 (+ 4 v_subst_1))) (or (not (= (select v_arrayElimArr_23 .cse108) 0)) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_prenex_126 (Array Int Int))) (let ((.cse110 (select v_arrayElimArr_22 .cse108))) (or (not (= (select (select (store (store .cse109 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse110 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse110 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse110) (= .cse110 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse110 .cse111))))))) (= .cse112 .cse111))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse112)))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int)) (v_subst_1 Int)) (let ((.cse113 (+ 4 v_subst_1))) (or (not (= (select v_arrayElimArr_23 .cse113) 0)) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_prenex_126 (Array Int Int))) (let ((.cse114 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse115 (select v_arrayElimArr_22 .cse113)) (.cse116 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (not (= (select (select (store (store .cse114 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse115 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse115 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse115) (= .cse115 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse115 (select (select (store (store .cse114 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse116 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse115 .cse116))))))) (or .cse16 (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_subst_2 Int) (v_ArrVal_981 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse117 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse119 (select v_arrayElimArr_21 (+ 4 v_subst_3))) (.cse121 (+ 4 v_subst_2))) (let ((.cse118 (select v_arrayElimArr_19 .cse121)) (.cse120 (select (select (store (store .cse117 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse119 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select (select (store (store .cse117 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse118 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse119) (= .cse119 .cse120) (not (= (select v_arrayElimArr_20 .cse121) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse118 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse118) (= .cse118 .cse120)))))) (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse123 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse122 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse123 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse122) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse123) (= .cse123 |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse122))))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse124 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse124) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse126 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse128 (select (select (store (store .cse126 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse124 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_subst_1 Int) (v_prenex_126 (Array Int Int))) (let ((.cse125 (+ 4 v_subst_1))) (let ((.cse127 (select v_arrayElimArr_22 .cse125))) (or (not (= (select v_arrayElimArr_23 .cse125) 0)) (not (= (select (select (store (store .cse126 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse127 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse127 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse127) (= .cse127 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse127 .cse128))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse128)))))))) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_subst_2 Int) (v_ArrVal_981 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse133 (+ 4 v_subst_2)) (.cse129 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse132 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse131 (select (select (store (store .cse129 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse132 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse130 (select v_arrayElimArr_19 .cse133))) (or (not (= (select (select (store (store .cse129 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse130 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse131) (= .cse132 .cse130) (= .cse132 .cse131) (not (= (select v_arrayElimArr_20 .cse133) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse130 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse130))))) .cse16) (or (and (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse137 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse134 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_subst_2 Int) (v_prenex_127 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse136 (+ 4 v_subst_2))) (let ((.cse135 (select v_arrayElimArr_19 .cse136))) (or (not (= (select (select (store (store .cse134 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse135 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= (select v_arrayElimArr_20 .cse136) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse135 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse135))))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store .cse134 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse137 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse137)))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse142 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse138 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse140 (select (select (store (store .cse138 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse142 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_subst_2 Int) (v_arrayElimArr_20 (Array Int Int))) (let ((.cse141 (+ 4 v_subst_2))) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse139 (select v_arrayElimArr_19 .cse141))) (or (not (= (select (select (store (store .cse138 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse139 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse139 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse139) (= .cse139 .cse140)))) (not (= (select v_arrayElimArr_20 .cse141) 0))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse140))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse142))))) .cse16) (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse144 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse147 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse146 (select (select (store (store .cse144 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse147 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_subst_1 Int) (v_prenex_126 (Array Int Int))) (let ((.cse143 (+ 4 v_subst_1))) (let ((.cse145 (select v_arrayElimArr_22 .cse143))) (or (not (= (select v_arrayElimArr_23 .cse143) 0)) (not (= (select (select (store (store .cse144 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse145 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse145 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse145) (= .cse145 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse145 .cse146))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse147) (= .cse147 .cse146))))) (or (and (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse148 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse148) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse149 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse152 (select (select (store (store .cse149 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse148 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_subst_2 Int) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse151 (+ 4 v_subst_2))) (let ((.cse150 (select v_arrayElimArr_19 .cse151))) (or (not (= (select (select (store (store .cse149 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse150 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= (select v_arrayElimArr_20 .cse151) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse150 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse150) (= .cse150 .cse152))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse152)))))))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse153 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse153) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse156 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse154 (select (select (store (store .cse156 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse153 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse154) (forall ((v_prenex_316 (Array Int Int)) (v_prenex_317 (Array Int Int)) (v_prenex_319 (Array Int Int)) (v_prenex_320 (Array Int Int)) (v_prenex_321 (Array Int Int)) (v_prenex_318 Int)) (let ((.cse157 (+ v_prenex_318 4))) (let ((.cse155 (select v_prenex_317 .cse157))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_319) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_320) .cse155 v_prenex_321) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse153 .cse155) (= .cse154 .cse155) (not (= (select (select (store (store .cse156 |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_317) .cse155 v_prenex_316) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse155) (not (= (select v_prenex_320 .cse157) 0)))))))))))))) .cse16) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse162 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse159 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse161 (select (select (store (store .cse159 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse162 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_subst_1 Int) (v_prenex_126 (Array Int Int))) (let ((.cse158 (+ 4 v_subst_1))) (let ((.cse160 (select v_arrayElimArr_22 .cse158))) (or (not (= (select v_arrayElimArr_23 .cse158) 0)) (not (= (select (select (store (store .cse159 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse160 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse160 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse160) (= .cse160 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse160 .cse161))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse161) (= .cse162 .cse161))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse162)))) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int)) (v_subst_1 Int) (v_prenex_126 (Array Int Int))) (let ((.cse163 (+ 4 v_subst_1))) (let ((.cse164 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse165 (select v_arrayElimArr_22 .cse163)) (.cse166 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (not (= (select v_arrayElimArr_23 .cse163) 0)) (not (= (select (select (store (store .cse164 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse165 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse165 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse165) (= .cse165 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse165 (select (select (store (store .cse164 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse166 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse165 .cse166))))) (or (forall ((v_prenex_316 (Array Int Int)) (v_prenex_317 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_prenex_319 (Array Int Int)) (v_prenex_320 (Array Int Int)) (v_prenex_321 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_prenex_318 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse171 (+ v_prenex_318 4)) (.cse170 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse168 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse169 (select (select (store (store .cse170 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse168 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse167 (select v_prenex_317 .cse171))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_319) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_320) .cse167 v_prenex_321) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse168 .cse167) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse169) (= .cse169 .cse167) (not (= (select (select (store (store .cse170 |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_317) .cse167 v_prenex_316) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse167) (not (= (select v_prenex_320 .cse171) 0)))))) .cse16) (or (and (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse176 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse172 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse174 (select (select (store (store .cse172 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse176 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_subst_2 Int) (v_arrayElimArr_20 (Array Int Int))) (let ((.cse175 (+ 4 v_subst_2))) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse173 (select v_arrayElimArr_19 .cse175))) (or (not (= (select (select (store (store .cse172 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse173 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse173 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse173) (= .cse173 .cse174)))) (not (= (select v_arrayElimArr_20 .cse175) 0))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse174) (= .cse176 .cse174))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse176)))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse181 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse177 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse180 (select (select (store (store .cse177 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse181 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_subst_2 Int) (v_prenex_127 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse179 (+ 4 v_subst_2))) (let ((.cse178 (select v_arrayElimArr_19 .cse179))) (or (not (= (select (select (store (store .cse177 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse178 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= (select v_arrayElimArr_20 .cse179) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse178 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse178))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse180) (= .cse181 .cse180))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse181))))) .cse16))))) is different from true [2022-11-19 08:42:31,323 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. No stderr output. [2022-11-19 08:42:31,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1832069524] [2022-11-19 08:42:31,325 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-11-19 08:42:31,325 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 08:42:31,325 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 08:42:31,326 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 08:42:31,326 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 08:42:31,336 FATAL L? ?]: Ignoring exception! de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:314) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:158) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:132) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.checkSatTerm(SmtUtils.java:273) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.isFalse(SymbolicTools.java:221) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.RelationCheckUtil.isEqBottom_SolverAlphaSolver(RelationCheckUtil.java:56) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.ExplicitValueDomain.isEqBottom(ExplicitValueDomain.java:73) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.CompoundDomain.isEqBottom(CompoundDomain.java:84) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.StatsWrapperDomain.isEqBottom(StatsWrapperDomain.java:69) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.earlyExitAfterStep(DagInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:125) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Broken pipe at java.base/java.io.FileOutputStream.writeBytes(Native Method) at java.base/java.io.FileOutputStream.write(FileOutputStream.java:354) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:318) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:153) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:251) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:257) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:156) ... 44 more [2022-11-19 08:42:31,339 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 139 [2022-11-19 08:42:31,349 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-11-19 08:42:31,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2022-11-19 08:42:31,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96533341] [2022-11-19 08:42:31,354 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-11-19 08:42:31,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-19 08:42:31,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:42:31,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-19 08:42:31,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=404, Invalid=3018, Unknown=4, NotChecked=114, Total=3540 [2022-11-19 08:42:31,358 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 26 states, 25 states have (on average 1.84) internal successors, (46), 25 states have internal predecessors, (46), 0 states have call successors, (0), 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-19 08:42:31,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1636 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=404, Invalid=3018, Unknown=4, NotChecked=114, Total=3540 [2022-11-19 08:42:31,359 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 08:42:31,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 08:42:31,364 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-19 08:42:31,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-19 08:42:31,560 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:314) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:158) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertCodeBlock(IncrementalHoareTripleChecker.java:436) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:278) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:284) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.releaseLock(ChainingHoareTripleChecker.java:449) at java.base/java.util.ArrayList$ArrayListSpliterator.forEachRemaining(ArrayList.java:1655) at java.base/java.util.stream.ReferencePipeline$Head.forEach(ReferencePipeline.java:658) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.releaseLock(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:365) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:442) at java.base/java.io.OutputStream.write(OutputStream.java:157) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:318) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:153) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:251) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:257) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:156) ... 36 more [2022-11-19 08:42:31,562 INFO L158 Benchmark]: Toolchain (without parser) took 838963.18ms. Allocated memory was 115.3MB in the beginning and 423.6MB in the end (delta: 308.3MB). Free memory was 76.1MB in the beginning and 348.3MB in the end (delta: -272.3MB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. [2022-11-19 08:42:31,562 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 115.3MB. Free memory is still 94.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 08:42:31,562 INFO L158 Benchmark]: CACSL2BoogieTranslator took 624.93ms. Allocated memory is still 115.3MB. Free memory was 75.8MB in the beginning and 82.5MB in the end (delta: -6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-19 08:42:31,562 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.42ms. Allocated memory is still 115.3MB. Free memory was 82.2MB in the beginning and 80.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 08:42:31,563 INFO L158 Benchmark]: Boogie Preprocessor took 51.38ms. Allocated memory is still 115.3MB. Free memory was 80.2MB in the beginning and 78.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 08:42:31,563 INFO L158 Benchmark]: RCFGBuilder took 852.68ms. Allocated memory is still 115.3MB. Free memory was 78.6MB in the beginning and 59.4MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-19 08:42:31,563 INFO L158 Benchmark]: TraceAbstraction took 837327.24ms. Allocated memory was 115.3MB in the beginning and 423.6MB in the end (delta: 308.3MB). Free memory was 58.8MB in the beginning and 348.3MB in the end (delta: -289.5MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. [2022-11-19 08:42:31,564 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.24ms. Allocated memory is still 115.3MB. Free memory is still 94.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 624.93ms. Allocated memory is still 115.3MB. Free memory was 75.8MB in the beginning and 82.5MB in the end (delta: -6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.42ms. Allocated memory is still 115.3MB. Free memory was 82.2MB in the beginning and 80.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.38ms. Allocated memory is still 115.3MB. Free memory was 80.2MB in the beginning and 78.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 852.68ms. Allocated memory is still 115.3MB. Free memory was 78.6MB in the beginning and 59.4MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 837327.24ms. Allocated memory was 115.3MB in the beginning and 423.6MB in the end (delta: 308.3MB). Free memory was 58.8MB in the beginning and 348.3MB in the end (delta: -289.5MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:314) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-properties/alternating_list-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS --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 941f3dd0e4566f414ae914eed10af26405f8e9f2f3d427c146090b07336d2fc2 --- 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-8393723 [2022-11-19 08:42:33,601 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 08:42:33,604 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 08:42:33,645 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 08:42:33,646 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 08:42:33,649 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 08:42:33,652 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 08:42:33,657 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 08:42:33,659 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 08:42:33,667 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 08:42:33,668 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 08:42:33,670 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 08:42:33,671 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 08:42:33,673 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 08:42:33,675 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 08:42:33,676 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 08:42:33,678 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 08:42:33,680 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 08:42:33,685 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 08:42:33,689 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 08:42:33,693 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 08:42:33,695 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 08:42:33,697 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 08:42:33,698 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 08:42:33,705 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 08:42:33,709 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 08:42:33,710 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 08:42:33,711 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 08:42:33,712 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 08:42:33,713 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 08:42:33,714 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 08:42:33,715 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 08:42:33,717 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 08:42:33,717 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 08:42:33,718 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 08:42:33,719 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 08:42:33,720 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 08:42:33,720 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 08:42:33,720 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 08:42:33,722 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 08:42:33,723 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 08:42:33,728 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-19 08:42:33,766 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 08:42:33,767 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 08:42:33,769 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 08:42:33,769 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 08:42:33,770 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 08:42:33,771 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 08:42:33,771 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 08:42:33,771 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 08:42:33,771 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 08:42:33,772 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 08:42:33,773 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 08:42:33,773 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 08:42:33,775 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-19 08:42:33,775 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-19 08:42:33,775 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 08:42:33,776 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 08:42:33,776 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 08:42:33,776 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 08:42:33,776 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 08:42:33,777 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 08:42:33,777 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-19 08:42:33,777 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-19 08:42:33,778 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-19 08:42:33,778 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 08:42:33,778 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-19 08:42:33,778 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-19 08:42:33,779 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-19 08:42:33,779 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 08:42:33,779 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 08:42:33,780 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 08:42:33,780 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-19 08:42:33,781 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 08:42:33,781 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:42:33,781 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 08:42:33,782 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 08:42:33,782 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-19 08:42:33,782 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-19 08:42:33,782 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 08:42:33,783 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-19 08:42:33,783 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_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/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_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS 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 -> 941f3dd0e4566f414ae914eed10af26405f8e9f2f3d427c146090b07336d2fc2 [2022-11-19 08:42:34,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 08:42:34,202 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 08:42:34,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 08:42:34,206 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 08:42:34,206 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 08:42:34,208 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/list-properties/alternating_list-1.i [2022-11-19 08:42:34,282 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/data/21bdd8c95/69fc96027852403cbcc1c2c5562f9e1b/FLAGb83184b99 [2022-11-19 08:42:34,815 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 08:42:34,816 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/sv-benchmarks/c/list-properties/alternating_list-1.i [2022-11-19 08:42:34,829 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/data/21bdd8c95/69fc96027852403cbcc1c2c5562f9e1b/FLAGb83184b99 [2022-11-19 08:42:35,152 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/data/21bdd8c95/69fc96027852403cbcc1c2c5562f9e1b [2022-11-19 08:42:35,156 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 08:42:35,158 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 08:42:35,163 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 08:42:35,163 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 08:42:35,168 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 08:42:35,169 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:42:35" (1/1) ... [2022-11-19 08:42:35,171 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c7650c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:35, skipping insertion in model container [2022-11-19 08:42:35,171 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:42:35" (1/1) ... [2022-11-19 08:42:35,178 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 08:42:35,230 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 08:42:35,665 WARN L234 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_91e33424-323c-4f73-96c5-6133fc96236b/sv-benchmarks/c/list-properties/alternating_list-1.i[23574,23587] [2022-11-19 08:42:35,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:42:35,698 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 08:42:35,733 WARN L234 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_91e33424-323c-4f73-96c5-6133fc96236b/sv-benchmarks/c/list-properties/alternating_list-1.i[23574,23587] [2022-11-19 08:42:35,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:42:35,762 INFO L208 MainTranslator]: Completed translation [2022-11-19 08:42:35,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:35 WrapperNode [2022-11-19 08:42:35,762 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 08:42:35,763 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 08:42:35,764 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 08:42:35,764 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 08:42:35,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:35" (1/1) ... [2022-11-19 08:42:35,786 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:35" (1/1) ... [2022-11-19 08:42:35,807 INFO L138 Inliner]: procedures = 127, calls = 23, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 91 [2022-11-19 08:42:35,807 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 08:42:35,808 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 08:42:35,808 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 08:42:35,808 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 08:42:35,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:35" (1/1) ... [2022-11-19 08:42:35,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:35" (1/1) ... [2022-11-19 08:42:35,821 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:35" (1/1) ... [2022-11-19 08:42:35,822 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:35" (1/1) ... [2022-11-19 08:42:35,830 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:35" (1/1) ... [2022-11-19 08:42:35,834 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:35" (1/1) ... [2022-11-19 08:42:35,836 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:35" (1/1) ... [2022-11-19 08:42:35,837 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:35" (1/1) ... [2022-11-19 08:42:35,840 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 08:42:35,841 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 08:42:35,841 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 08:42:35,841 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 08:42:35,842 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:35" (1/1) ... [2022-11-19 08:42:35,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:42:35,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:42:35,872 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 08:42:35,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 08:42:35,939 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-19 08:42:35,940 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-19 08:42:35,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-19 08:42:35,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-19 08:42:35,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 08:42:35,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-19 08:42:35,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-19 08:42:35,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 08:42:35,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-19 08:42:35,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-19 08:42:35,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 08:42:35,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 08:42:36,078 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 08:42:36,080 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 08:42:36,121 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-19 08:42:36,514 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 08:42:36,531 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 08:42:36,531 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-19 08:42:36,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:42:36 BoogieIcfgContainer [2022-11-19 08:42:36,533 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 08:42:36,535 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 08:42:36,535 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 08:42:36,538 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 08:42:36,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:42:35" (1/3) ... [2022-11-19 08:42:36,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d8dd7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:42:36, skipping insertion in model container [2022-11-19 08:42:36,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:35" (2/3) ... [2022-11-19 08:42:36,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d8dd7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:42:36, skipping insertion in model container [2022-11-19 08:42:36,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:42:36" (3/3) ... [2022-11-19 08:42:36,549 INFO L112 eAbstractionObserver]: Analyzing ICFG alternating_list-1.i [2022-11-19 08:42:36,571 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 08:42:36,571 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-11-19 08:42:36,617 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 08:42:36,624 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;@637c52c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 08:42:36,625 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2022-11-19 08:42:36,629 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 42 states have (on average 2.0) internal successors, (84), 73 states have internal predecessors, (84), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:42:36,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-19 08:42:36,636 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:42:36,637 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-19 08:42:36,638 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-19 08:42:36,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:42:36,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1037516521, now seen corresponding path program 1 times [2022-11-19 08:42:36,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:42:36,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1949071725] [2022-11-19 08:42:36,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:42:36,658 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-19 08:42:36,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:42:36,667 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/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-19 08:42:36,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/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-19 08:42:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:42:36,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 08:42:36,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:42:36,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-19 08:42:36,953 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-19 08:42:36,954 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:42:36,954 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:42:36,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1949071725] [2022-11-19 08:42:36,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1949071725] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:42:36,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:42:36,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:42:36,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959346027] [2022-11-19 08:42:36,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:42:36,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:42:36,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:42:36,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:42:37,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:42:37,003 INFO L87 Difference]: Start difference. First operand has 75 states, 42 states have (on average 2.0) internal successors, (84), 73 states have internal predecessors, (84), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:42:37,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:42:37,419 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2022-11-19 08:42:37,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 08:42:37,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-19 08:42:37,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:42:37,431 INFO L225 Difference]: With dead ends: 95 [2022-11-19 08:42:37,431 INFO L226 Difference]: Without dead ends: 89 [2022-11-19 08:42:37,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:42:37,437 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 125 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 08:42:37,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 60 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 08:42:37,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-19 08:42:37,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 69. [2022-11-19 08:42:37,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 46 states have (on average 1.7608695652173914) internal successors, (81), 68 states have internal predecessors, (81), 0 states have call successors, (0), 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-19 08:42:37,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 81 transitions. [2022-11-19 08:42:37,486 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 81 transitions. Word has length 6 [2022-11-19 08:42:37,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:42:37,487 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 81 transitions. [2022-11-19 08:42:37,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:42:37,487 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2022-11-19 08:42:37,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-19 08:42:37,488 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:42:37,488 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-19 08:42:37,505 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/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-19 08:42:37,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/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-19 08:42:37,706 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-19 08:42:37,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:42:37,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1037516522, now seen corresponding path program 1 times [2022-11-19 08:42:37,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:42:37,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [227508899] [2022-11-19 08:42:37,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:42:37,708 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-19 08:42:37,708 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:42:37,709 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/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-19 08:42:37,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/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-19 08:42:37,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:42:37,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 08:42:37,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:42:37,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 08:42:37,857 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-19 08:42:37,858 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:42:37,858 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:42:37,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [227508899] [2022-11-19 08:42:37,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [227508899] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:42:37,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:42:37,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:42:37,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833470290] [2022-11-19 08:42:37,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:42:37,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:42:37,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:42:37,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:42:37,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:42:37,870 INFO L87 Difference]: Start difference. First operand 69 states and 81 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:42:38,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:42:38,218 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2022-11-19 08:42:38,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:42:38,219 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-19 08:42:38,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:42:38,220 INFO L225 Difference]: With dead ends: 97 [2022-11-19 08:42:38,220 INFO L226 Difference]: Without dead ends: 97 [2022-11-19 08:42:38,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-19 08:42:38,222 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 135 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 08:42:38,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 59 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 08:42:38,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-19 08:42:38,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 85. [2022-11-19 08:42:38,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.564516129032258) internal successors, (97), 84 states have internal predecessors, (97), 0 states have call successors, (0), 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-19 08:42:38,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 97 transitions. [2022-11-19 08:42:38,233 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 97 transitions. Word has length 6 [2022-11-19 08:42:38,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:42:38,234 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 97 transitions. [2022-11-19 08:42:38,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:42:38,234 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 97 transitions. [2022-11-19 08:42:38,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-19 08:42:38,235 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:42:38,235 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:42:38,260 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/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-19 08:42:38,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/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-19 08:42:38,461 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-19 08:42:38,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:42:38,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1480007144, now seen corresponding path program 1 times [2022-11-19 08:42:38,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:42:38,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1790288613] [2022-11-19 08:42:38,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:42:38,463 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-19 08:42:38,463 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:42:38,464 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/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-19 08:42:38,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/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-19 08:42:38,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:42:38,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-19 08:42:38,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:42:38,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 08:42:38,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-19 08:42:38,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:42:38,652 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:42:38,653 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:42:38,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1790288613] [2022-11-19 08:42:38,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1790288613] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:42:38,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:42:38,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 08:42:38,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115888481] [2022-11-19 08:42:38,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:42:38,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 08:42:38,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:42:38,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 08:42:38,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:42:38,655 INFO L87 Difference]: Start difference. First operand 85 states and 97 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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-19 08:42:39,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:42:39,125 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2022-11-19 08:42:39,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 08:42:39,126 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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-19 08:42:39,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:42:39,128 INFO L225 Difference]: With dead ends: 130 [2022-11-19 08:42:39,128 INFO L226 Difference]: Without dead ends: 130 [2022-11-19 08:42:39,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-19 08:42:39,129 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 90 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 08:42:39,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 193 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 08:42:39,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-19 08:42:39,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 88. [2022-11-19 08:42:39,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 65 states have (on average 1.5384615384615385) internal successors, (100), 87 states have internal predecessors, (100), 0 states have call successors, (0), 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-19 08:42:39,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2022-11-19 08:42:39,138 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 13 [2022-11-19 08:42:39,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:42:39,139 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2022-11-19 08:42:39,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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-19 08:42:39,139 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2022-11-19 08:42:39,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 08:42:39,140 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:42:39,140 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:42:39,159 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/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)] Ended with exit code 0 [2022-11-19 08:42:39,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/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-19 08:42:39,352 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-19 08:42:39,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:42:39,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1405331501, now seen corresponding path program 1 times [2022-11-19 08:42:39,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:42:39,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [461286550] [2022-11-19 08:42:39,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:42:39,354 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-19 08:42:39,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:42:39,362 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/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-19 08:42:39,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/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-19 08:42:39,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:42:39,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 08:42:39,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:42:39,617 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-19 08:42:39,617 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:42:39,618 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:42:39,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [461286550] [2022-11-19 08:42:39,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [461286550] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:42:39,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:42:39,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:42:39,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436515818] [2022-11-19 08:42:39,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:42:39,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:42:39,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:42:39,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:42:39,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:42:39,620 INFO L87 Difference]: Start difference. First operand 88 states and 100 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:42:39,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:42:39,966 INFO L93 Difference]: Finished difference Result 98 states and 108 transitions. [2022-11-19 08:42:39,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 08:42:39,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-19 08:42:39,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:42:39,968 INFO L225 Difference]: With dead ends: 98 [2022-11-19 08:42:39,968 INFO L226 Difference]: Without dead ends: 98 [2022-11-19 08:42:39,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:42:39,969 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 136 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 08:42:39,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 68 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 08:42:39,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-11-19 08:42:39,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 89. [2022-11-19 08:42:39,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 66 states have (on average 1.5303030303030303) internal successors, (101), 88 states have internal predecessors, (101), 0 states have call successors, (0), 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-19 08:42:39,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 101 transitions. [2022-11-19 08:42:39,976 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 101 transitions. Word has length 14 [2022-11-19 08:42:39,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:42:39,977 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 101 transitions. [2022-11-19 08:42:39,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:42:39,977 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 101 transitions. [2022-11-19 08:42:39,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-19 08:42:39,977 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:42:39,978 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:42:39,996 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-19 08:42:40,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/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-19 08:42:40,189 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-19 08:42:40,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:42:40,191 INFO L85 PathProgramCache]: Analyzing trace with hash -615557696, now seen corresponding path program 1 times [2022-11-19 08:42:40,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:42:40,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1360170424] [2022-11-19 08:42:40,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:42:40,192 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-19 08:42:40,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:42:40,193 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/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-19 08:42:40,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/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-19 08:42:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:42:40,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-19 08:42:40,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:42:40,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 08:42:40,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-19 08:42:40,375 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-19 08:42:40,376 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:42:40,376 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:42:40,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1360170424] [2022-11-19 08:42:40,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1360170424] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:42:40,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:42:40,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 08:42:40,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434274270] [2022-11-19 08:42:40,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:42:40,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 08:42:40,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:42:40,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 08:42:40,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:42:40,381 INFO L87 Difference]: Start difference. First operand 89 states and 101 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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-19 08:42:40,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:42:40,842 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2022-11-19 08:42:40,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 08:42:40,843 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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-19 08:42:40,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:42:40,844 INFO L225 Difference]: With dead ends: 106 [2022-11-19 08:42:40,844 INFO L226 Difference]: Without dead ends: 106 [2022-11-19 08:42:40,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-19 08:42:40,845 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 56 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 08:42:40,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 195 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 08:42:40,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-19 08:42:40,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 92. [2022-11-19 08:42:40,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 91 states have internal predecessors, (104), 0 states have call successors, (0), 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-19 08:42:40,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2022-11-19 08:42:40,853 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 15 [2022-11-19 08:42:40,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:42:40,853 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2022-11-19 08:42:40,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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-19 08:42:40,854 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2022-11-19 08:42:40,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-19 08:42:40,855 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:42:40,855 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:42:40,877 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/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-19 08:42:41,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/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-19 08:42:41,068 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-19 08:42:41,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:42:41,068 INFO L85 PathProgramCache]: Analyzing trace with hash -435094785, now seen corresponding path program 1 times [2022-11-19 08:42:41,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:42:41,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1656706072] [2022-11-19 08:42:41,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:42:41,069 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-19 08:42:41,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:42:41,070 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/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-19 08:42:41,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/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-19 08:42:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:42:41,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-19 08:42:41,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:42:41,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:42:41,158 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:42:41,158 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:42:41,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1656706072] [2022-11-19 08:42:41,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1656706072] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:42:41,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:42:41,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:42:41,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990384935] [2022-11-19 08:42:41,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:42:41,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:42:41,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:42:41,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:42:41,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:42:41,160 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-19 08:42:41,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:42:41,174 INFO L93 Difference]: Finished difference Result 141 states and 152 transitions. [2022-11-19 08:42:41,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:42:41,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-19 08:42:41,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:42:41,176 INFO L225 Difference]: With dead ends: 141 [2022-11-19 08:42:41,176 INFO L226 Difference]: Without dead ends: 141 [2022-11-19 08:42:41,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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-19 08:42:41,177 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 49 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 08:42:41,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 132 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 08:42:41,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-19 08:42:41,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 100. [2022-11-19 08:42:41,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 77 states have (on average 1.5064935064935066) internal successors, (116), 99 states have internal predecessors, (116), 0 states have call successors, (0), 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-19 08:42:41,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 116 transitions. [2022-11-19 08:42:41,184 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 116 transitions. Word has length 15 [2022-11-19 08:42:41,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:42:41,185 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 116 transitions. [2022-11-19 08:42:41,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-19 08:42:41,185 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 116 transitions. [2022-11-19 08:42:41,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-19 08:42:41,192 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:42:41,192 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:42:41,213 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/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-19 08:42:41,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/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-19 08:42:41,414 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-19 08:42:41,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:42:41,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1131851013, now seen corresponding path program 1 times [2022-11-19 08:42:41,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:42:41,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1490739267] [2022-11-19 08:42:41,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:42:41,416 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-19 08:42:41,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:42:41,421 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/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-19 08:42:41,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/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-19 08:42:41,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:42:41,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-19 08:42:41,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:42:41,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-19 08:42:41,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:42:41,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-19 08:42:41,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:42:41,582 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:42:41,582 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:42:41,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1490739267] [2022-11-19 08:42:41,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1490739267] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:42:41,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:42:41,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 08:42:41,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415213621] [2022-11-19 08:42:41,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:42:41,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 08:42:41,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:42:41,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 08:42:41,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:42:41,585 INFO L87 Difference]: Start difference. First operand 100 states and 116 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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-19 08:42:42,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:42:42,032 INFO L93 Difference]: Finished difference Result 107 states and 123 transitions. [2022-11-19 08:42:42,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 08:42:42,032 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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-19 08:42:42,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:42:42,033 INFO L225 Difference]: With dead ends: 107 [2022-11-19 08:42:42,033 INFO L226 Difference]: Without dead ends: 107 [2022-11-19 08:42:42,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-19 08:42:42,034 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 91 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 08:42:42,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 138 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 08:42:42,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-19 08:42:42,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 97. [2022-11-19 08:42:42,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 77 states have (on average 1.4675324675324675) internal successors, (113), 96 states have internal predecessors, (113), 0 states have call successors, (0), 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-19 08:42:42,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 113 transitions. [2022-11-19 08:42:42,040 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 113 transitions. Word has length 15 [2022-11-19 08:42:42,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:42:42,041 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 113 transitions. [2022-11-19 08:42:42,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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-19 08:42:42,041 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 113 transitions. [2022-11-19 08:42:42,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-19 08:42:42,041 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:42:42,042 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:42:42,057 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-11-19 08:42:42,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/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-19 08:42:42,253 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-19 08:42:42,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:42:42,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1131851014, now seen corresponding path program 1 times [2022-11-19 08:42:42,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:42:42,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2061928613] [2022-11-19 08:42:42,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:42:42,253 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-19 08:42:42,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:42:42,254 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/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-19 08:42:42,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/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-19 08:42:42,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:42:42,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-19 08:42:42,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:42:42,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 08:42:42,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:42:42,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:42:42,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-19 08:42:42,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-19 08:42:42,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:42:42,506 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:42:42,506 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:42:42,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2061928613] [2022-11-19 08:42:42,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2061928613] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:42:42,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:42:42,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 08:42:42,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770682949] [2022-11-19 08:42:42,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:42:42,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 08:42:42,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:42:42,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 08:42:42,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:42:42,509 INFO L87 Difference]: Start difference. First operand 97 states and 113 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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-19 08:42:43,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:42:43,121 INFO L93 Difference]: Finished difference Result 98 states and 111 transitions. [2022-11-19 08:42:43,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 08:42:43,122 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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-19 08:42:43,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:42:43,123 INFO L225 Difference]: With dead ends: 98 [2022-11-19 08:42:43,123 INFO L226 Difference]: Without dead ends: 98 [2022-11-19 08:42:43,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-19 08:42:43,124 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 65 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 08:42:43,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 174 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 08:42:43,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-11-19 08:42:43,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 85. [2022-11-19 08:42:43,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 84 states have internal predecessors, (99), 0 states have call successors, (0), 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-19 08:42:43,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2022-11-19 08:42:43,130 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 15 [2022-11-19 08:42:43,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:42:43,130 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2022-11-19 08:42:43,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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-19 08:42:43,131 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2022-11-19 08:42:43,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-19 08:42:43,131 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:42:43,132 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:42:43,151 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/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-19 08:42:43,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/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-19 08:42:43,346 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-19 08:42:43,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:42:43,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1903836295, now seen corresponding path program 1 times [2022-11-19 08:42:43,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:42:43,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1155793181] [2022-11-19 08:42:43,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:42:43,347 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-19 08:42:43,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:42:43,348 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/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-19 08:42:43,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/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-19 08:42:43,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:42:43,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-19 08:42:43,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:42:43,629 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~p~0#1.base| (_ BitVec 32))) (and (= (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~p~0#1.base| (_ bv0 1)) |c_#valid|) (= (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~p~0#1.base|) (_ bv0 1)))) is different from true [2022-11-19 08:42:43,629 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-19 08:42:43,630 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:42:43,630 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:42:43,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1155793181] [2022-11-19 08:42:43,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1155793181] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:42:43,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:42:43,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:42:43,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698178585] [2022-11-19 08:42:43,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:42:43,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:42:43,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:42:43,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:42:43,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2022-11-19 08:42:43,631 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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-19 08:42:43,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:42:43,633 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2022-11-19 08:42:43,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 08:42:43,634 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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-19 08:42:43,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:42:43,634 INFO L225 Difference]: With dead ends: 91 [2022-11-19 08:42:43,634 INFO L226 Difference]: Without dead ends: 80 [2022-11-19 08:42:43,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2022-11-19 08:42:43,635 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 2 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 08:42:43,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 106 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 103 Unchecked, 0.0s Time] [2022-11-19 08:42:43,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-19 08:42:43,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2022-11-19 08:42:43,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 63 states have (on average 1.4444444444444444) internal successors, (91), 77 states have internal predecessors, (91), 0 states have call successors, (0), 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-19 08:42:43,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2022-11-19 08:42:43,640 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 91 transitions. Word has length 16 [2022-11-19 08:42:43,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:42:43,640 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 91 transitions. [2022-11-19 08:42:43,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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-19 08:42:43,647 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2022-11-19 08:42:43,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 08:42:43,647 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:42:43,648 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-19 08:42:43,660 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/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-19 08:42:43,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/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-19 08:42:43,858 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-19 08:42:43,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:42:43,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1348721194, now seen corresponding path program 1 times [2022-11-19 08:42:43,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:42:43,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [972827858] [2022-11-19 08:42:43,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:42:43,859 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-19 08:42:43,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:42:43,860 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/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-19 08:42:43,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/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-19 08:42:44,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:42:44,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-19 08:42:44,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:42:44,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-19 08:42:44,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 08:42:44,210 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 08:42:44,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-19 08:42:44,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:42:44,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 20 [2022-11-19 08:42:44,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:42:44,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-11-19 08:42:44,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 14 treesize of output 16 [2022-11-19 08:42:44,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-19 08:42:44,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:42:44,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:42:44,670 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|)) v_ArrVal_131) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32))) is different from false [2022-11-19 08:42:44,977 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:42:44,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-11-19 08:42:44,999 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:42:44,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2022-11-19 08:42:45,010 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 9 treesize of output 7 [2022-11-19 08:42:47,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:42:47,229 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:42:47,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [972827858] [2022-11-19 08:42:47,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [972827858] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:42:47,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1217289670] [2022-11-19 08:42:47,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:42:47,230 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 08:42:47,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 08:42:47,232 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 08:42:47,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2022-11-19 08:42:47,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:42:47,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-19 08:42:47,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:42:47,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-19 08:42:47,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 08:42:47,649 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 08:42:47,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-19 08:42:47,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:42:47,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 20 [2022-11-19 08:42:47,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:42:47,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-11-19 08:42:47,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 14 treesize of output 16 [2022-11-19 08:42:48,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-19 08:42:48,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:42:48,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:42:48,059 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_161 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_161) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32))) is different from false [2022-11-19 08:42:48,071 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_161 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_161) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-11-19 08:42:48,610 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:42:48,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-11-19 08:42:48,635 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:42:48,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2022-11-19 08:42:48,642 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 9 treesize of output 7 [2022-11-19 08:42:50,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-19 08:42:50,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1217289670] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:42:50,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491020140] [2022-11-19 08:42:50,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:42:50,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:42:50,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:42:50,799 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:42:50,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-19 08:42:50,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:42:50,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-19 08:42:50,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:42:50,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-19 08:42:50,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 08:42:50,993 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 08:42:50,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-19 08:42:51,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:42:51,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 20 [2022-11-19 08:42:51,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:42:51,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-11-19 08:42:51,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 14 treesize of output 16 [2022-11-19 08:42:51,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-19 08:42:51,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:42:51,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:42:51,149 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_191 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_191) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32))) is different from false [2022-11-19 08:42:51,160 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_191 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_191) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32))) is different from false [2022-11-19 08:42:51,170 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_191 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|)) v_ArrVal_191) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32))) is different from false [2022-11-19 08:42:53,594 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:42:53,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-11-19 08:42:53,617 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:42:53,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2022-11-19 08:42:53,627 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 9 treesize of output 7 [2022-11-19 08:42:55,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-19 08:42:55,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491020140] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:42:55,800 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-19 08:42:55,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12, 12, 12, 12] total 37 [2022-11-19 08:42:55,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30046470] [2022-11-19 08:42:55,801 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-19 08:42:55,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-19 08:42:55,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:42:55,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-19 08:42:55,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=739, Unknown=75, NotChecked=378, Total=1332 [2022-11-19 08:42:55,804 INFO L87 Difference]: Start difference. First operand 78 states and 91 transitions. Second operand has 37 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 37 states have internal predecessors, (71), 0 states have call successors, (0), 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-19 08:42:57,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:42:57,503 INFO L93 Difference]: Finished difference Result 174 states and 200 transitions. [2022-11-19 08:42:57,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-19 08:42:57,504 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 37 states have internal predecessors, (71), 0 states have call successors, (0), 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-19 08:42:57,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:42:57,505 INFO L225 Difference]: With dead ends: 174 [2022-11-19 08:42:57,505 INFO L226 Difference]: Without dead ends: 174 [2022-11-19 08:42:57,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 87 SyntacticMatches, 7 SemanticMatches, 41 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=226, Invalid=1053, Unknown=77, NotChecked=450, Total=1806 [2022-11-19 08:42:57,507 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 189 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 1512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1030 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:42:57,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 690 Invalid, 1512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 458 Invalid, 0 Unknown, 1030 Unchecked, 1.1s Time] [2022-11-19 08:42:57,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-11-19 08:42:57,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 94. [2022-11-19 08:42:57,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 79 states have (on average 1.379746835443038) internal successors, (109), 93 states have internal predecessors, (109), 0 states have call successors, (0), 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-19 08:42:57,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 109 transitions. [2022-11-19 08:42:57,513 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 109 transitions. Word has length 22 [2022-11-19 08:42:57,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:42:57,514 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 109 transitions. [2022-11-19 08:42:57,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 37 states have internal predecessors, (71), 0 states have call successors, (0), 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-19 08:42:57,514 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 109 transitions. [2022-11-19 08:42:57,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-19 08:42:57,515 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:42:57,515 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:42:57,524 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2022-11-19 08:42:57,723 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-19 08:42:57,928 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/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-19 08:42:58,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/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-19 08:42:58,119 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-19 08:42:58,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:42:58,120 INFO L85 PathProgramCache]: Analyzing trace with hash -13367516, now seen corresponding path program 1 times [2022-11-19 08:42:58,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:42:58,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [376227901] [2022-11-19 08:42:58,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:42:58,121 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-19 08:42:58,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:42:58,122 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/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-19 08:42:58,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-19 08:42:58,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:42:58,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-19 08:42:58,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:42:58,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-19 08:42:58,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 08:42:58,341 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:42:58,341 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:42:58,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [376227901] [2022-11-19 08:42:58,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [376227901] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:42:58,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:42:58,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-19 08:42:58,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267054843] [2022-11-19 08:42:58,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:42:58,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 08:42:58,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:42:58,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 08:42:58,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-19 08:42:58,343 INFO L87 Difference]: Start difference. First operand 94 states and 109 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 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-19 08:42:58,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:42:58,835 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2022-11-19 08:42:58,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 08:42:58,835 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-11-19 08:42:58,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:42:58,836 INFO L225 Difference]: With dead ends: 109 [2022-11-19 08:42:58,836 INFO L226 Difference]: Without dead ends: 109 [2022-11-19 08:42:58,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-19 08:42:58,838 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 44 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 08:42:58,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 218 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 08:42:58,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-19 08:42:58,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 97. [2022-11-19 08:42:58,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 96 states have internal predecessors, (112), 0 states have call successors, (0), 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-19 08:42:58,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 112 transitions. [2022-11-19 08:42:58,843 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 112 transitions. Word has length 24 [2022-11-19 08:42:58,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:42:58,844 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 112 transitions. [2022-11-19 08:42:58,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 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-19 08:42:58,844 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 112 transitions. [2022-11-19 08:42:58,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-19 08:42:58,845 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:42:58,846 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:42:58,863 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-19 08:42:59,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/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-19 08:42:59,060 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-19 08:42:59,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:42:59,060 INFO L85 PathProgramCache]: Analyzing trace with hash 959080204, now seen corresponding path program 1 times [2022-11-19 08:42:59,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:42:59,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1307764638] [2022-11-19 08:42:59,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:42:59,061 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-19 08:42:59,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:42:59,062 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/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-19 08:42:59,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33424-323c-4f73-96c5-6133fc96236b/bin/utaipan-I9t0OCRTmS/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 (15)] Waiting until timeout for monitored process [2022-11-19 08:42:59,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:42:59,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-19 08:42:59,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:42:59,242 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-19 08:42:59,242 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 12 treesize of output 22 [2022-11-19 08:42:59,451 INFO L321 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2022-11-19 08:42:59,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2022-11-19 08:42:59,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:42:59,905 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:42:59,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2022-11-19 08:43:02,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 27 [2022-11-19 08:43:02,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:43:02,451 INFO L328 TraceCheckSpWp]: Computing backward predicates...