./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/verifythis/prefixsum_rec.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/verifythis/prefixsum_rec.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 81bdf17d0130e934dcb31a2f76f595e947b99d6273334b7f05365a624466aeab --- 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-38b53e6 [2022-11-25 23:15:43,217 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:15:43,219 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:15:43,242 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:15:43,243 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:15:43,244 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:15:43,246 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:15:43,248 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:15:43,250 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:15:43,251 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:15:43,252 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:15:43,254 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:15:43,254 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:15:43,255 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:15:43,257 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:15:43,258 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:15:43,259 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:15:43,260 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:15:43,262 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:15:43,264 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:15:43,266 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:15:43,267 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:15:43,269 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:15:43,270 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:15:43,273 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:15:43,274 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:15:43,274 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:15:43,275 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:15:43,276 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:15:43,277 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:15:43,277 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:15:43,278 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:15:43,279 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:15:43,280 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:15:43,281 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:15:43,282 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:15:43,283 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:15:43,283 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:15:43,284 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:15:43,285 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:15:43,286 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:15:43,287 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-25 23:15:43,310 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:15:43,310 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:15:43,310 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:15:43,311 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:15:43,311 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:15:43,312 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:15:43,312 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:15:43,312 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:15:43,313 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:15:43,313 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 23:15:43,313 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:15:43,313 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:15:43,314 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 23:15:43,314 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 23:15:43,314 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:15:43,315 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 23:15:43,315 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 23:15:43,315 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 23:15:43,316 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:15:43,316 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 23:15:43,317 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:15:43,317 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 23:15:43,317 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:15:43,318 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 23:15:43,318 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:15:43,318 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 23:15:43,319 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 23:15:43,319 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 23:15:43,319 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:15:43,320 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 23:15:43,320 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:15:43,320 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:15:43,320 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:15:43,321 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:15:43,321 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 23:15:43,321 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:15:43,322 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 23:15:43,322 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 23:15:43,322 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 23:15:43,323 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 23:15:43,323 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:15:43,323 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_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/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_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur 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 ! call(reach_error())) ) 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 -> 81bdf17d0130e934dcb31a2f76f595e947b99d6273334b7f05365a624466aeab [2022-11-25 23:15:43,634 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:15:43,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:15:43,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:15:43,668 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:15:43,668 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:15:43,669 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/verifythis/prefixsum_rec.c [2022-11-25 23:15:46,807 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:15:46,988 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:15:46,989 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/sv-benchmarks/c/verifythis/prefixsum_rec.c [2022-11-25 23:15:46,996 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/data/54deb03b8/4bc5e229294c48a4831ceb7ae843c20e/FLAGb35636242 [2022-11-25 23:15:47,016 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/data/54deb03b8/4bc5e229294c48a4831ceb7ae843c20e [2022-11-25 23:15:47,030 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:15:47,032 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:15:47,036 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:15:47,039 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:15:47,045 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:15:47,046 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:15:47" (1/1) ... [2022-11-25 23:15:47,047 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f08ba7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:15:47, skipping insertion in model container [2022-11-25 23:15:47,048 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:15:47" (1/1) ... [2022-11-25 23:15:47,057 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:15:47,080 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:15:47,209 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/sv-benchmarks/c/verifythis/prefixsum_rec.c[525,538] [2022-11-25 23:15:47,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:15:47,251 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 23:15:47,264 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/sv-benchmarks/c/verifythis/prefixsum_rec.c[525,538] [2022-11-25 23:15:47,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:15:47,293 INFO L208 MainTranslator]: Completed translation [2022-11-25 23:15:47,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:15:47 WrapperNode [2022-11-25 23:15:47,293 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:15:47,295 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 23:15:47,295 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 23:15:47,295 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 23:15:47,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:15:47" (1/1) ... [2022-11-25 23:15:47,312 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:15:47" (1/1) ... [2022-11-25 23:15:47,334 INFO L138 Inliner]: procedures = 22, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 75 [2022-11-25 23:15:47,336 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 23:15:47,336 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 23:15:47,337 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 23:15:47,337 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 23:15:47,344 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:15:47" (1/1) ... [2022-11-25 23:15:47,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:15:47" (1/1) ... [2022-11-25 23:15:47,348 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:15:47" (1/1) ... [2022-11-25 23:15:47,348 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:15:47" (1/1) ... [2022-11-25 23:15:47,357 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:15:47" (1/1) ... [2022-11-25 23:15:47,376 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:15:47" (1/1) ... [2022-11-25 23:15:47,380 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:15:47" (1/1) ... [2022-11-25 23:15:47,386 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:15:47" (1/1) ... [2022-11-25 23:15:47,391 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 23:15:47,392 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 23:15:47,394 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 23:15:47,394 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 23:15:47,395 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:15:47" (1/1) ... [2022-11-25 23:15:47,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:15:47,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:15:47,436 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 23:15:47,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 23:15:47,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 23:15:47,478 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-25 23:15:47,478 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-25 23:15:47,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 23:15:47,479 INFO L130 BoogieDeclarations]: Found specification of procedure downsweep [2022-11-25 23:15:47,479 INFO L138 BoogieDeclarations]: Found implementation of procedure downsweep [2022-11-25 23:15:47,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 23:15:47,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 23:15:47,479 INFO L130 BoogieDeclarations]: Found specification of procedure upsweep [2022-11-25 23:15:47,479 INFO L138 BoogieDeclarations]: Found implementation of procedure upsweep [2022-11-25 23:15:47,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 23:15:47,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 23:15:47,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 23:15:47,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-25 23:15:47,480 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-25 23:15:47,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 23:15:47,568 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 23:15:47,569 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 23:15:47,802 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 23:15:47,857 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 23:15:47,858 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-25 23:15:47,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:15:47 BoogieIcfgContainer [2022-11-25 23:15:47,861 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 23:15:47,863 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 23:15:47,863 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 23:15:47,866 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 23:15:47,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 11:15:47" (1/3) ... [2022-11-25 23:15:47,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5b4684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:15:47, skipping insertion in model container [2022-11-25 23:15:47,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:15:47" (2/3) ... [2022-11-25 23:15:47,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5b4684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:15:47, skipping insertion in model container [2022-11-25 23:15:47,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:15:47" (3/3) ... [2022-11-25 23:15:47,870 INFO L112 eAbstractionObserver]: Analyzing ICFG prefixsum_rec.c [2022-11-25 23:15:47,889 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 23:15:47,889 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 23:15:47,940 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:15:47,947 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=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@479f085b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:15:47,947 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 23:15:47,951 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 24 states have internal predecessors, (28), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-25 23:15:47,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-25 23:15:47,961 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:15:47,961 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, 1, 1, 1, 1] [2022-11-25 23:15:47,962 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:15:47,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:15:47,970 INFO L85 PathProgramCache]: Analyzing trace with hash -903243188, now seen corresponding path program 1 times [2022-11-25 23:15:47,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:15:47,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972111884] [2022-11-25 23:15:47,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:15:47,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:15:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:15:48,884 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-25 23:15:48,884 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:15:48,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972111884] [2022-11-25 23:15:48,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972111884] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:15:48,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:15:48,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 23:15:48,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945597446] [2022-11-25 23:15:48,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:15:48,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:15:48,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:15:48,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:15:48,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:15:48,931 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 24 states have internal predecessors, (28), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-25 23:15:49,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:15:49,191 INFO L93 Difference]: Finished difference Result 75 states and 101 transitions. [2022-11-25 23:15:49,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 23:15:49,195 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 34 [2022-11-25 23:15:49,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:15:49,203 INFO L225 Difference]: With dead ends: 75 [2022-11-25 23:15:49,203 INFO L226 Difference]: Without dead ends: 55 [2022-11-25 23:15:49,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-25 23:15:49,215 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 28 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:15:49,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 179 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:15:49,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-25 23:15:49,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 37. [2022-11-25 23:15:49,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 24 states have internal predecessors, (27), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-25 23:15:49,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2022-11-25 23:15:49,264 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 34 [2022-11-25 23:15:49,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:15:49,265 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2022-11-25 23:15:49,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-25 23:15:49,265 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-11-25 23:15:49,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-25 23:15:49,267 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:15:49,268 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, 1, 1, 1, 1, 1] [2022-11-25 23:15:49,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 23:15:49,268 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:15:49,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:15:49,269 INFO L85 PathProgramCache]: Analyzing trace with hash 344366338, now seen corresponding path program 1 times [2022-11-25 23:15:49,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:15:49,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457754169] [2022-11-25 23:15:49,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:15:49,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:15:49,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:15:49,618 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:15:49,619 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:15:49,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457754169] [2022-11-25 23:15:49,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457754169] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:15:49,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808562308] [2022-11-25 23:15:49,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:15:49,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:15:49,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:15:49,631 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:15:49,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 23:15:49,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:15:49,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 23:15:49,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:15:49,900 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:15:49,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:15:50,047 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:15:50,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808562308] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:15:50,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [188533666] [2022-11-25 23:15:50,090 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2022-11-25 23:15:50,097 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:15:50,102 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:15:50,112 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:15:50,113 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:15:50,591 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2022-11-25 23:15:50,599 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:15:51,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [188533666] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:15:51,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:15:51,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 6, 6] total 17 [2022-11-25 23:15:51,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470483560] [2022-11-25 23:15:51,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:15:51,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 23:15:51,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:15:51,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 23:15:51,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2022-11-25 23:15:51,073 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 8 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-25 23:15:51,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:15:51,288 INFO L93 Difference]: Finished difference Result 69 states and 89 transitions. [2022-11-25 23:15:51,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 23:15:51,289 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 35 [2022-11-25 23:15:51,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:15:51,290 INFO L225 Difference]: With dead ends: 69 [2022-11-25 23:15:51,290 INFO L226 Difference]: Without dead ends: 38 [2022-11-25 23:15:51,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2022-11-25 23:15:51,292 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 41 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:15:51,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 55 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:15:51,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-25 23:15:51,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-11-25 23:15:51,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-25 23:15:51,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2022-11-25 23:15:51,304 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 35 [2022-11-25 23:15:51,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:15:51,305 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2022-11-25 23:15:51,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-25 23:15:51,305 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-11-25 23:15:51,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 23:15:51,306 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:15:51,307 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, 1, 1, 1, 1, 1, 1] [2022-11-25 23:15:51,313 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 23:15:51,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:15:51,512 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:15:51,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:15:51,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1298516122, now seen corresponding path program 1 times [2022-11-25 23:15:51,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:15:51,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654523356] [2022-11-25 23:15:51,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:15:51,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:15:51,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:15:51,808 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 23:15:51,809 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:15:51,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654523356] [2022-11-25 23:15:51,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654523356] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:15:51,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711089025] [2022-11-25 23:15:51,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:15:51,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:15:51,810 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:15:51,815 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:15:51,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 23:15:51,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:15:51,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 23:15:51,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:15:52,057 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 23:15:52,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:15:52,151 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 23:15:52,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711089025] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:15:52,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [188292403] [2022-11-25 23:15:52,158 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2022-11-25 23:15:52,158 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:15:52,158 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:15:52,158 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:15:52,159 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:15:52,612 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-25 23:15:52,633 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 10 treesize of output 9 [2022-11-25 23:15:52,702 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 7 treesize of output 6 [2022-11-25 23:15:52,847 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-25 23:15:52,847 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 1 case distinctions, treesize of input 127 treesize of output 127 [2022-11-25 23:15:52,885 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 23:15:52,886 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 128 treesize of output 130 [2022-11-25 23:15:53,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 6 treesize of output 4 [2022-11-25 23:15:53,037 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:15:53,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 6 treesize of output 4 [2022-11-25 23:15:53,250 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:15:53,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-11-25 23:15:53,395 INFO L321 Elim1Store]: treesize reduction 84, result has 9.7 percent of original size [2022-11-25 23:15:53,395 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 235 treesize of output 232 [2022-11-25 23:15:53,463 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:15:53,476 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 23:15:53,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 25 treesize of output 25 [2022-11-25 23:15:53,558 INFO L321 Elim1Store]: treesize reduction 22, result has 59.3 percent of original size [2022-11-25 23:15:53,559 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 2 case distinctions, treesize of input 33 treesize of output 45 [2022-11-25 23:15:53,653 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 16 treesize of output 12 [2022-11-25 23:15:53,712 INFO L321 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-11-25 23:15:53,713 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 52 treesize of output 48 [2022-11-25 23:15:53,732 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 12 treesize of output 3 [2022-11-25 23:15:53,755 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 12 treesize of output 3 [2022-11-25 23:15:54,010 INFO L197 IcfgInterpreter]: Interpreting procedure downsweep with input of size 41 for LOIs [2022-11-25 23:15:54,024 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.meminit with input of size 70 for LOIs [2022-11-25 23:15:54,062 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2022-11-25 23:15:54,063 INFO L197 IcfgInterpreter]: Interpreting procedure upsweep with input of size 42 for LOIs [2022-11-25 23:15:54,081 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:15:58,648 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '823#(and (= |ULTIMATE.start_check_~a#1.offset| |ULTIMATE.start_check_#in~a#1.offset|) (= |ULTIMATE.start_check_#in~n#1| |ULTIMATE.start_check_~n#1|) (< |ULTIMATE.start_check_~i~0#1| |ULTIMATE.start_check_~n#1|) (= (ite (= |ULTIMATE.start_check_#t~mem11#1| |ULTIMATE.start_check_~sum~0#1|) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |ULTIMATE.start_check_#in~a#1.base| |ULTIMATE.start_main_~a~0#1.base|) (<= 0 |ULTIMATE.start_main_~a~0#1.offset|) (<= 0 |ULTIMATE.start_is_pow2_#res#1|) (= |ULTIMATE.start_check_#in~a0#1.base| |ULTIMATE.start_check_~a0#1.base|) (<= 0 |ULTIMATE.start_main_~i~1#1|) (= |ULTIMATE.start_main_#t~malloc16#1.offset| 0) (<= 0 (+ |ULTIMATE.start_is_pow2_#in~x#1| 2147483648)) (= |ULTIMATE.start_check_~sum~0#1| 0) (= |ULTIMATE.start_main_~a0~0#1.base| |ULTIMATE.start_check_#in~a0#1.base|) (= |ULTIMATE.start_check_~i~0#1| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (= |ULTIMATE.start_check_#t~mem11#1| (select (select |#memory_int| |ULTIMATE.start_check_~a#1.base|) (+ |ULTIMATE.start_check_~a#1.offset| (* |ULTIMATE.start_check_~i~0#1| 4)))) (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_check_#in~a#1.offset|) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_check_#in~n#1|) (<= |ULTIMATE.start_is_pow2_#res#1| 1) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= 0 |ULTIMATE.start_main_~a0~0#1.offset|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_is_pow2_#in~x#1| 2147483647) (= |ULTIMATE.start_check_#in~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (= |ULTIMATE.start_main_#t~malloc15#1.offset| 0) (<= |ULTIMATE.start_main_~n~0#1| (+ (ite (and (not (= (mod |ULTIMATE.start_main_~n~0#1| 2) 0)) (< |ULTIMATE.start_main_~n~0#1| 0)) (+ (div |ULTIMATE.start_main_~n~0#1| 2) 1) (div |ULTIMATE.start_main_~n~0#1| 2)) 1)) (= |ULTIMATE.start_check_~a#1.base| |ULTIMATE.start_check_#in~a#1.base|) (<= |ULTIMATE.start_main_~a0~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_check_#in~a0#1.offset| |ULTIMATE.start_check_~a0#1.offset|) (<= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |#NULL.base| 0))' at error location [2022-11-25 23:15:58,648 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:15:58,648 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:15:58,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-11-25 23:15:58,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968909447] [2022-11-25 23:15:58,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:15:58,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 23:15:58,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:15:58,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 23:15:58,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1327, Unknown=0, NotChecked=0, Total=1482 [2022-11-25 23:15:58,651 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. Second operand has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2022-11-25 23:15:58,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:15:58,862 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2022-11-25 23:15:58,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 23:15:58,863 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) Word has length 36 [2022-11-25 23:15:58,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:15:58,864 INFO L225 Difference]: With dead ends: 60 [2022-11-25 23:15:58,865 INFO L226 Difference]: Without dead ends: 39 [2022-11-25 23:15:58,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=171, Invalid=1469, Unknown=0, NotChecked=0, Total=1640 [2022-11-25 23:15:58,866 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:15:58,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 135 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:15:58,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-25 23:15:58,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-11-25 23:15:58,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-25 23:15:58,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2022-11-25 23:15:58,890 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 36 [2022-11-25 23:15:58,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:15:58,890 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2022-11-25 23:15:58,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2022-11-25 23:15:58,891 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2022-11-25 23:15:58,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-25 23:15:58,894 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:15:58,897 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, 1, 1] [2022-11-25 23:15:58,908 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 23:15:59,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:15:59,103 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:15:59,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:15:59,104 INFO L85 PathProgramCache]: Analyzing trace with hash 975807272, now seen corresponding path program 2 times [2022-11-25 23:15:59,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:15:59,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095144216] [2022-11-25 23:15:59,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:15:59,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:15:59,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:16:01,572 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:16:01,573 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:16:01,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095144216] [2022-11-25 23:16:01,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095144216] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:16:01,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708068407] [2022-11-25 23:16:01,573 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:16:01,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:16:01,574 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:16:01,575 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:16:01,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 23:16:01,673 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-25 23:16:01,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:16:01,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-25 23:16:01,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:16:01,777 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 16 treesize of output 12 [2022-11-25 23:16:01,901 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_112 Int) (downsweep_~left Int)) (and (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse0 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|)) (.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)))) (store (store .cse0 .cse1 v_ArrVal_112) (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)) (select .cse0 .cse1)))) |c_#memory_int|) (<= downsweep_~left |c_downsweep_#in~left|) (not (< (+ downsweep_~left 1) |c_downsweep_#in~right|)))) is different from true [2022-11-25 23:16:01,962 INFO L321 Elim1Store]: treesize reduction 34, result has 26.1 percent of original size [2022-11-25 23:16:01,962 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 2 case distinctions, treesize of input 45 treesize of output 27 [2022-11-25 23:16:02,171 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-25 23:16:02,171 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 23 [2022-11-25 23:16:02,204 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 23:16:02,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:16:02,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708068407] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:16:02,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [172369325] [2022-11-25 23:16:02,540 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2022-11-25 23:16:02,541 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:16:02,541 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:16:02,542 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:16:02,542 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:16:02,962 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 10 treesize of output 9 [2022-11-25 23:16:02,969 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-25 23:16:03,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 7 treesize of output 6 [2022-11-25 23:16:03,160 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-25 23:16:03,160 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 1 case distinctions, treesize of input 127 treesize of output 127 [2022-11-25 23:16:03,188 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 23:16:03,188 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 128 treesize of output 130 [2022-11-25 23:16:03,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 6 treesize of output 4 [2022-11-25 23:16:03,302 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:16:03,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 6 treesize of output 4 [2022-11-25 23:16:03,442 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:16:03,525 INFO L321 Elim1Store]: treesize reduction 38, result has 11.6 percent of original size [2022-11-25 23:16:03,526 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 210 treesize of output 206 [2022-11-25 23:16:03,574 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:16:03,586 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 23:16:03,587 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 25 treesize of output 25 [2022-11-25 23:16:03,637 INFO L321 Elim1Store]: treesize reduction 22, result has 59.3 percent of original size [2022-11-25 23:16:03,637 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 2 case distinctions, treesize of input 33 treesize of output 45 [2022-11-25 23:16:03,712 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 16 treesize of output 12 [2022-11-25 23:16:03,751 INFO L321 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-11-25 23:16:03,752 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 52 treesize of output 48 [2022-11-25 23:16:03,766 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 12 treesize of output 3 [2022-11-25 23:16:03,786 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 12 treesize of output 3 [2022-11-25 23:16:03,942 INFO L197 IcfgInterpreter]: Interpreting procedure downsweep with input of size 41 for LOIs [2022-11-25 23:16:03,955 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.meminit with input of size 70 for LOIs [2022-11-25 23:16:03,984 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2022-11-25 23:16:03,986 INFO L197 IcfgInterpreter]: Interpreting procedure upsweep with input of size 34 for LOIs [2022-11-25 23:16:03,994 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:16:09,233 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1156#(and (= |ULTIMATE.start_check_~a#1.offset| |ULTIMATE.start_check_#in~a#1.offset|) (= |ULTIMATE.start_check_#in~n#1| |ULTIMATE.start_check_~n#1|) (< |ULTIMATE.start_check_~i~0#1| |ULTIMATE.start_check_~n#1|) (= (ite (= |ULTIMATE.start_check_#t~mem11#1| |ULTIMATE.start_check_~sum~0#1|) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |ULTIMATE.start_check_#in~a#1.base| |ULTIMATE.start_main_~a~0#1.base|) (<= 0 |ULTIMATE.start_main_~a~0#1.offset|) (<= 0 |ULTIMATE.start_is_pow2_#res#1|) (= |ULTIMATE.start_check_#in~a0#1.base| |ULTIMATE.start_check_~a0#1.base|) (<= 0 |ULTIMATE.start_main_~i~1#1|) (= |ULTIMATE.start_main_#t~malloc16#1.offset| 0) (<= 0 (+ |ULTIMATE.start_is_pow2_#in~x#1| 2147483648)) (= |ULTIMATE.start_check_~sum~0#1| 0) (= |ULTIMATE.start_main_~a0~0#1.base| |ULTIMATE.start_check_#in~a0#1.base|) (= |ULTIMATE.start_check_~i~0#1| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (= |ULTIMATE.start_check_#t~mem11#1| (select (select |#memory_int| |ULTIMATE.start_check_~a#1.base|) (+ |ULTIMATE.start_check_~a#1.offset| (* |ULTIMATE.start_check_~i~0#1| 4)))) (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_check_#in~a#1.offset|) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_check_#in~n#1|) (<= |ULTIMATE.start_is_pow2_#res#1| 1) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= 0 |ULTIMATE.start_main_~a0~0#1.offset|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_is_pow2_#in~x#1| 2147483647) (= |ULTIMATE.start_check_#in~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (= |ULTIMATE.start_main_#t~malloc15#1.offset| 0) (<= |ULTIMATE.start_main_~n~0#1| (+ (ite (and (not (= (mod |ULTIMATE.start_main_~n~0#1| 2) 0)) (< |ULTIMATE.start_main_~n~0#1| 0)) (+ (div |ULTIMATE.start_main_~n~0#1| 2) 1) (div |ULTIMATE.start_main_~n~0#1| 2)) 1)) (= |ULTIMATE.start_check_~a#1.base| |ULTIMATE.start_check_#in~a#1.base|) (<= |ULTIMATE.start_main_~a0~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_check_#in~a0#1.offset| |ULTIMATE.start_check_~a0#1.offset|) (<= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |#NULL.base| 0))' at error location [2022-11-25 23:16:09,233 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:16:09,233 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 23:16:09,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 28 [2022-11-25 23:16:09,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806664378] [2022-11-25 23:16:09,234 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 23:16:09,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-25 23:16:09,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:16:09,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-25 23:16:09,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=2938, Unknown=1, NotChecked=110, Total=3306 [2022-11-25 23:16:09,237 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand has 28 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 23 states have internal predecessors, (41), 7 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2022-11-25 23:16:13,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:16:13,450 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2022-11-25 23:16:13,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-25 23:16:13,451 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 23 states have internal predecessors, (41), 7 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) Word has length 37 [2022-11-25 23:16:13,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:16:13,454 INFO L225 Difference]: With dead ends: 68 [2022-11-25 23:16:13,454 INFO L226 Difference]: Without dead ends: 66 [2022-11-25 23:16:13,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1807 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=522, Invalid=5643, Unknown=1, NotChecked=154, Total=6320 [2022-11-25 23:16:13,457 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 117 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:16:13,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 191 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 719 Invalid, 0 Unknown, 54 Unchecked, 1.5s Time] [2022-11-25 23:16:13,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-25 23:16:13,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 44. [2022-11-25 23:16:13,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 10 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (13), 11 states have call predecessors, (13), 10 states have call successors, (13) [2022-11-25 23:16:13,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2022-11-25 23:16:13,476 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 37 [2022-11-25 23:16:13,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:16:13,477 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2022-11-25 23:16:13,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 23 states have internal predecessors, (41), 7 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2022-11-25 23:16:13,477 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2022-11-25 23:16:13,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-25 23:16:13,479 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:16:13,479 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:16:13,487 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-25 23:16:13,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:16:13,684 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:16:13,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:16:13,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1941203874, now seen corresponding path program 1 times [2022-11-25 23:16:13,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:16:13,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093837445] [2022-11-25 23:16:13,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:16:13,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:16:13,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:16:16,428 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:16:16,429 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:16:16,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093837445] [2022-11-25 23:16:16,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093837445] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:16:16,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778096498] [2022-11-25 23:16:16,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:16:16,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:16:16,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:16:16,435 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:16:16,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 23:16:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:16:16,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 106 conjunts are in the unsatisfiable core [2022-11-25 23:16:16,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:16:16,625 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-25 23:16:16,697 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 7 treesize of output 6 [2022-11-25 23:16:16,814 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 23:16:16,815 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-25 23:16:16,867 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_154 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_154) |c_#memory_int|)) is different from true [2022-11-25 23:16:16,875 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 13 treesize of output 15 [2022-11-25 23:16:16,949 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 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-25 23:16:16,954 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 21 treesize of output 20 [2022-11-25 23:16:17,025 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 0 case distinctions, treesize of input 30 treesize of output 28 [2022-11-25 23:16:17,034 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 19 treesize of output 23 [2022-11-25 23:16:17,219 WARN L859 $PredicateComparison]: unable to prove that (exists ((upsweep_~left Int) (upsweep_~right Int) (upsweep_~a.offset Int)) (= (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (let ((.cse0 (select |c_old(#memory_int)| |c_upsweep_#in~a.base|)) (.cse1 (+ (* upsweep_~right 4) upsweep_~a.offset))) (store .cse0 .cse1 (+ (select .cse0 (+ (* upsweep_~left 4) upsweep_~a.offset)) (select .cse0 .cse1))))) |c_#memory_int|)) is different from true [2022-11-25 23:16:17,247 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 0 case distinctions, treesize of input 50 treesize of output 44 [2022-11-25 23:16:17,333 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 0 case distinctions, treesize of input 33 treesize of output 31 [2022-11-25 23:16:17,426 WARN L859 $PredicateComparison]: unable to prove that (exists ((downsweep_~left Int) (v_ArrVal_164 Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse2 (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)))) (store (let ((.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4))) (.cse0 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (select .cse0 .cse2)))) .cse2 v_ArrVal_164)))) (<= downsweep_~left |c_downsweep_#in~left|))) is different from true [2022-11-25 23:16:17,471 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 0 case distinctions, treesize of input 65 treesize of output 59 [2022-11-25 23:16:18,030 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 0 case distinctions, treesize of input 91 treesize of output 79 [2022-11-25 23:16:18,041 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 115 treesize of output 109 [2022-11-25 23:16:18,099 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2022-11-25 23:16:18,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:16:25,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778096498] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:16:25,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1288437164] [2022-11-25 23:16:25,057 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2022-11-25 23:16:25,057 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:16:25,057 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:16:25,057 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:16:25,057 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:16:25,275 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-25 23:16:25,282 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 10 treesize of output 9 [2022-11-25 23:16:25,329 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 7 treesize of output 6 [2022-11-25 23:16:25,437 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-25 23:16:25,437 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 1 case distinctions, treesize of input 127 treesize of output 127 [2022-11-25 23:16:25,476 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 23:16:25,476 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 128 treesize of output 130 [2022-11-25 23:16:25,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 6 treesize of output 4 [2022-11-25 23:16:25,597 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:16:25,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 6 treesize of output 4 [2022-11-25 23:16:25,753 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:16:25,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-11-25 23:16:25,897 INFO L321 Elim1Store]: treesize reduction 84, result has 9.7 percent of original size [2022-11-25 23:16:25,898 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 241 treesize of output 238 [2022-11-25 23:16:25,951 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:16:25,965 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 23:16:25,965 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 25 treesize of output 25 [2022-11-25 23:16:26,020 INFO L321 Elim1Store]: treesize reduction 22, result has 59.3 percent of original size [2022-11-25 23:16:26,021 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 2 case distinctions, treesize of input 33 treesize of output 45 [2022-11-25 23:16:26,078 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 16 treesize of output 12 [2022-11-25 23:16:26,132 INFO L321 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-11-25 23:16:26,132 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 52 treesize of output 48 [2022-11-25 23:16:26,152 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 12 treesize of output 3 [2022-11-25 23:16:26,182 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 12 treesize of output 3 [2022-11-25 23:16:26,650 INFO L197 IcfgInterpreter]: Interpreting procedure downsweep with input of size 41 for LOIs [2022-11-25 23:16:26,663 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.meminit with input of size 70 for LOIs [2022-11-25 23:16:26,694 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2022-11-25 23:16:26,695 INFO L197 IcfgInterpreter]: Interpreting procedure upsweep with input of size 34 for LOIs [2022-11-25 23:16:26,705 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:16:33,961 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1573#(and (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (<= |ULTIMATE.start_check_~n#1| 2147483647) (< |ULTIMATE.start_check_~i~0#1| |ULTIMATE.start_check_~n#1|) (= (ite (= |ULTIMATE.start_check_#t~mem11#1| |ULTIMATE.start_check_~sum~0#1|) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= |ULTIMATE.start_check_~i~0#1| 2) (<= 0 |ULTIMATE.start_main_~a~0#1.offset|) (<= 0 (+ |ULTIMATE.start_check_#in~n#1| 2147483648)) (<= 0 |ULTIMATE.start_is_pow2_#res#1|) (<= 0 |ULTIMATE.start_main_~i~1#1|) (= |ULTIMATE.start_main_#t~malloc16#1.offset| 0) (<= 0 (+ |ULTIMATE.start_is_pow2_#in~x#1| 2147483648)) (<= |ULTIMATE.start_check_#in~a0#1.offset| 0) (<= 0 |ULTIMATE.start_check_~i~0#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= |ULTIMATE.start_check_~a0#1.offset| 0) (= |ULTIMATE.start_check_#t~mem11#1| (select (select |#memory_int| |ULTIMATE.start_check_~a#1.base|) (+ |ULTIMATE.start_check_~a#1.offset| (* |ULTIMATE.start_check_~i~0#1| 4)))) (<= |ULTIMATE.start_check_#in~a#1.offset| 0) (<= |ULTIMATE.start_is_pow2_#res#1| 1) (<= |ULTIMATE.start_check_~a#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= 0 |ULTIMATE.start_main_~a0~0#1.offset|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_is_pow2_#in~x#1| 2147483647) (<= |ULTIMATE.start_check_#in~n#1| 2147483647) (= |ULTIMATE.start_main_#t~malloc15#1.offset| 0) (<= 0 |ULTIMATE.start_check_~a0#1.offset|) (<= 0 |ULTIMATE.start_check_~a#1.offset|) (<= |ULTIMATE.start_main_~a0~0#1.offset| 0) (<= 0 |ULTIMATE.start_check_#in~a0#1.offset|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= 0 |ULTIMATE.start_check_#in~a#1.offset|) (= |#NULL.base| 0) (<= 0 (+ |ULTIMATE.start_main_~n~0#1| 2147483648)))' at error location [2022-11-25 23:16:33,962 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:16:33,962 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 23:16:33,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 39 [2022-11-25 23:16:33,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890518478] [2022-11-25 23:16:33,962 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 23:16:33,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-25 23:16:33,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:16:33,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-25 23:16:33,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=4254, Unknown=4, NotChecked=402, Total=4970 [2022-11-25 23:16:33,966 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand has 39 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 32 states have internal predecessors, (50), 8 states have call successors, (11), 3 states have call predecessors, (11), 10 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) [2022-11-25 23:16:38,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:16:38,301 INFO L93 Difference]: Finished difference Result 68 states and 89 transitions. [2022-11-25 23:16:38,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-25 23:16:38,301 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 32 states have internal predecessors, (50), 8 states have call successors, (11), 3 states have call predecessors, (11), 10 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) Word has length 40 [2022-11-25 23:16:38,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:16:38,303 INFO L225 Difference]: With dead ends: 68 [2022-11-25 23:16:38,303 INFO L226 Difference]: Without dead ends: 66 [2022-11-25 23:16:38,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 91 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2165 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=556, Invalid=7462, Unknown=4, NotChecked=534, Total=8556 [2022-11-25 23:16:38,307 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 130 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 191 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:16:38,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 241 Invalid, 1195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 899 Invalid, 0 Unknown, 191 Unchecked, 1.5s Time] [2022-11-25 23:16:38,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-25 23:16:38,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2022-11-25 23:16:38,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 36 states have internal predecessors, (41), 12 states have call successors, (12), 4 states have call predecessors, (12), 6 states have return successors, (20), 13 states have call predecessors, (20), 12 states have call successors, (20) [2022-11-25 23:16:38,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2022-11-25 23:16:38,330 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 40 [2022-11-25 23:16:38,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:16:38,330 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2022-11-25 23:16:38,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 32 states have internal predecessors, (50), 8 states have call successors, (11), 3 states have call predecessors, (11), 10 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) [2022-11-25 23:16:38,331 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2022-11-25 23:16:38,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-25 23:16:38,332 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:16:38,333 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:16:38,347 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 23:16:38,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:16:38,540 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:16:38,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:16:38,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1975245212, now seen corresponding path program 2 times [2022-11-25 23:16:38,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:16:38,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771822751] [2022-11-25 23:16:38,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:16:38,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:16:38,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:16:38,717 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 23:16:38,718 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:16:38,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771822751] [2022-11-25 23:16:38,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771822751] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:16:38,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027025013] [2022-11-25 23:16:38,718 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:16:38,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:16:38,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:16:38,720 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:16:38,737 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 23:16:38,862 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-25 23:16:38,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:16:38,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-25 23:16:38,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:16:39,030 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 23:16:39,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:16:39,393 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 23:16:39,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027025013] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:16:39,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [795773699] [2022-11-25 23:16:39,396 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2022-11-25 23:16:39,396 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:16:39,396 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:16:39,396 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:16:39,397 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:16:39,650 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 10 treesize of output 9 [2022-11-25 23:16:39,657 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-25 23:16:39,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 7 treesize of output 6 [2022-11-25 23:16:39,807 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-25 23:16:39,808 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 1 case distinctions, treesize of input 127 treesize of output 127 [2022-11-25 23:16:39,841 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 23:16:39,841 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 128 treesize of output 130 [2022-11-25 23:16:39,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 6 treesize of output 4 [2022-11-25 23:16:39,986 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:16:40,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 6 treesize of output 4 [2022-11-25 23:16:40,137 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:16:40,226 INFO L321 Elim1Store]: treesize reduction 28, result has 15.2 percent of original size [2022-11-25 23:16:40,227 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 200 treesize of output 196 [2022-11-25 23:16:40,281 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:16:40,297 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 23:16:40,298 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 25 treesize of output 25 [2022-11-25 23:16:40,389 INFO L321 Elim1Store]: treesize reduction 22, result has 59.3 percent of original size [2022-11-25 23:16:40,390 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 2 case distinctions, treesize of input 33 treesize of output 45 [2022-11-25 23:16:40,442 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 16 treesize of output 12 [2022-11-25 23:16:40,496 INFO L321 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-11-25 23:16:40,496 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 52 treesize of output 48 [2022-11-25 23:16:40,517 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 12 treesize of output 3 [2022-11-25 23:16:40,544 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 12 treesize of output 3 [2022-11-25 23:16:40,996 INFO L197 IcfgInterpreter]: Interpreting procedure downsweep with input of size 41 for LOIs [2022-11-25 23:16:41,010 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.meminit with input of size 70 for LOIs [2022-11-25 23:16:41,040 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2022-11-25 23:16:41,042 INFO L197 IcfgInterpreter]: Interpreting procedure upsweep with input of size 34 for LOIs [2022-11-25 23:16:41,052 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:16:47,021 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2085#(and (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (<= |ULTIMATE.start_check_~n#1| 2147483647) (< |ULTIMATE.start_check_~i~0#1| |ULTIMATE.start_check_~n#1|) (= (ite (= |ULTIMATE.start_check_#t~mem11#1| |ULTIMATE.start_check_~sum~0#1|) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= |ULTIMATE.start_check_~i~0#1| 2) (<= 0 |ULTIMATE.start_main_~a~0#1.offset|) (<= 0 (+ |ULTIMATE.start_check_#in~n#1| 2147483648)) (<= 0 |ULTIMATE.start_is_pow2_#res#1|) (<= 0 |ULTIMATE.start_main_~i~1#1|) (= |ULTIMATE.start_main_#t~malloc16#1.offset| 0) (<= 0 (+ |ULTIMATE.start_is_pow2_#in~x#1| 2147483648)) (<= |ULTIMATE.start_check_#in~a0#1.offset| 0) (<= 0 |ULTIMATE.start_check_~i~0#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= |ULTIMATE.start_check_~a0#1.offset| 0) (= |ULTIMATE.start_check_#t~mem11#1| (select (select |#memory_int| |ULTIMATE.start_check_~a#1.base|) (+ |ULTIMATE.start_check_~a#1.offset| (* |ULTIMATE.start_check_~i~0#1| 4)))) (<= |ULTIMATE.start_check_#in~a#1.offset| 0) (<= |ULTIMATE.start_is_pow2_#res#1| 1) (<= |ULTIMATE.start_check_~a#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= 0 |ULTIMATE.start_main_~a0~0#1.offset|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_is_pow2_#in~x#1| 2147483647) (<= |ULTIMATE.start_check_#in~n#1| 2147483647) (= |ULTIMATE.start_main_#t~malloc15#1.offset| 0) (<= 0 |ULTIMATE.start_check_~a0#1.offset|) (<= 0 |ULTIMATE.start_check_~a#1.offset|) (<= |ULTIMATE.start_main_~a0~0#1.offset| 0) (<= 0 |ULTIMATE.start_check_#in~a0#1.offset|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= 0 |ULTIMATE.start_check_#in~a#1.offset|) (= |#NULL.base| 0) (<= 0 (+ |ULTIMATE.start_main_~n~0#1| 2147483648)))' at error location [2022-11-25 23:16:47,021 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:16:47,021 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:16:47,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 22 [2022-11-25 23:16:47,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709898632] [2022-11-25 23:16:47,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:16:47,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-25 23:16:47,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:16:47,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-25 23:16:47,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=2210, Unknown=0, NotChecked=0, Total=2450 [2022-11-25 23:16:47,025 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. Second operand has 22 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 22 states have internal predecessors, (51), 8 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 5 states have call predecessors, (12), 8 states have call successors, (12) [2022-11-25 23:16:47,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:16:47,543 INFO L93 Difference]: Finished difference Result 84 states and 110 transitions. [2022-11-25 23:16:47,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 23:16:47,547 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 22 states have internal predecessors, (51), 8 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 5 states have call predecessors, (12), 8 states have call successors, (12) Word has length 41 [2022-11-25 23:16:47,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:16:47,549 INFO L225 Difference]: With dead ends: 84 [2022-11-25 23:16:47,549 INFO L226 Difference]: Without dead ends: 65 [2022-11-25 23:16:47,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=308, Invalid=2772, Unknown=0, NotChecked=0, Total=3080 [2022-11-25 23:16:47,552 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 58 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:16:47,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 306 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:16:47,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-25 23:16:47,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 54. [2022-11-25 23:16:47,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 36 states have internal predecessors, (41), 12 states have call successors, (12), 4 states have call predecessors, (12), 6 states have return successors, (19), 13 states have call predecessors, (19), 12 states have call successors, (19) [2022-11-25 23:16:47,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 72 transitions. [2022-11-25 23:16:47,570 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 72 transitions. Word has length 41 [2022-11-25 23:16:47,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:16:47,571 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 72 transitions. [2022-11-25 23:16:47,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 22 states have internal predecessors, (51), 8 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 5 states have call predecessors, (12), 8 states have call successors, (12) [2022-11-25 23:16:47,571 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 72 transitions. [2022-11-25 23:16:47,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-25 23:16:47,573 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:16:47,573 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:16:47,591 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 23:16:47,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-25 23:16:47,791 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:16:47,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:16:47,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1324607256, now seen corresponding path program 3 times [2022-11-25 23:16:47,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:16:47,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898770734] [2022-11-25 23:16:47,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:16:47,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:16:47,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:16:48,049 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 23:16:48,049 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:16:48,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898770734] [2022-11-25 23:16:48,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898770734] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:16:48,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986634803] [2022-11-25 23:16:48,050 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 23:16:48,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:16:48,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:16:48,052 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:16:48,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 23:16:48,162 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 23:16:48,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:16:48,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 23:16:48,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:16:48,285 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 23:16:48,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:16:48,431 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 23:16:48,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986634803] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:16:48,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1052197861] [2022-11-25 23:16:48,435 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2022-11-25 23:16:48,435 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:16:48,437 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:16:48,437 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:16:48,437 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:16:48,763 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 10 treesize of output 9 [2022-11-25 23:16:48,770 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-25 23:16:48,819 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 7 treesize of output 6 [2022-11-25 23:16:48,930 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-25 23:16:48,930 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 1 case distinctions, treesize of input 127 treesize of output 127 [2022-11-25 23:16:48,968 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 23:16:48,969 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 128 treesize of output 130 [2022-11-25 23:16:49,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 6 treesize of output 4 [2022-11-25 23:16:49,090 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:16:49,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 6 treesize of output 4 [2022-11-25 23:16:49,196 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:16:49,288 INFO L321 Elim1Store]: treesize reduction 38, result has 11.6 percent of original size [2022-11-25 23:16:49,288 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 210 treesize of output 206 [2022-11-25 23:16:49,355 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:16:49,370 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 23:16:49,370 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 25 treesize of output 25 [2022-11-25 23:16:49,426 INFO L321 Elim1Store]: treesize reduction 22, result has 59.3 percent of original size [2022-11-25 23:16:49,426 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 2 case distinctions, treesize of input 33 treesize of output 45 [2022-11-25 23:16:49,474 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 16 treesize of output 12 [2022-11-25 23:16:49,522 INFO L321 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-11-25 23:16:49,523 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 52 treesize of output 48 [2022-11-25 23:16:49,540 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 12 treesize of output 3 [2022-11-25 23:16:49,565 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 12 treesize of output 3 [2022-11-25 23:16:50,007 INFO L197 IcfgInterpreter]: Interpreting procedure downsweep with input of size 41 for LOIs [2022-11-25 23:16:50,020 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.meminit with input of size 70 for LOIs [2022-11-25 23:16:50,051 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2022-11-25 23:16:50,052 INFO L197 IcfgInterpreter]: Interpreting procedure upsweep with input of size 34 for LOIs [2022-11-25 23:16:50,062 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:16:56,087 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2589#(and (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (<= |ULTIMATE.start_check_~n#1| 2147483647) (< |ULTIMATE.start_check_~i~0#1| |ULTIMATE.start_check_~n#1|) (= (ite (= |ULTIMATE.start_check_#t~mem11#1| |ULTIMATE.start_check_~sum~0#1|) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= |ULTIMATE.start_check_~i~0#1| 2) (<= 0 |ULTIMATE.start_main_~a~0#1.offset|) (<= 0 (+ |ULTIMATE.start_check_#in~n#1| 2147483648)) (<= 0 |ULTIMATE.start_is_pow2_#res#1|) (<= 0 |ULTIMATE.start_main_~i~1#1|) (= |ULTIMATE.start_main_#t~malloc16#1.offset| 0) (<= 0 (+ |ULTIMATE.start_is_pow2_#in~x#1| 2147483648)) (<= |ULTIMATE.start_check_#in~a0#1.offset| 0) (<= 0 |ULTIMATE.start_check_~i~0#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= |ULTIMATE.start_check_~a0#1.offset| 0) (= |ULTIMATE.start_check_#t~mem11#1| (select (select |#memory_int| |ULTIMATE.start_check_~a#1.base|) (+ |ULTIMATE.start_check_~a#1.offset| (* |ULTIMATE.start_check_~i~0#1| 4)))) (<= |ULTIMATE.start_check_#in~a#1.offset| 0) (<= |ULTIMATE.start_is_pow2_#res#1| 1) (<= |ULTIMATE.start_check_~a#1.offset| 0) (<= |ULTIMATE.start_main_#t~malloc15#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= 0 |ULTIMATE.start_main_~a0~0#1.offset|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_is_pow2_#in~x#1| 2147483647) (<= |ULTIMATE.start_check_#in~n#1| 2147483647) (<= 0 |ULTIMATE.start_check_~a0#1.offset|) (<= 0 |ULTIMATE.start_check_~a#1.offset|) (<= |ULTIMATE.start_main_~a0~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_#t~malloc15#1.offset|) (<= 0 |ULTIMATE.start_check_#in~a0#1.offset|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= 0 |ULTIMATE.start_check_#in~a#1.offset|) (= |#NULL.base| 0) (<= 0 (+ |ULTIMATE.start_main_~n~0#1| 2147483648)))' at error location [2022-11-25 23:16:56,087 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:16:56,087 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:16:56,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-11-25 23:16:56,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293441143] [2022-11-25 23:16:56,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:16:56,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-25 23:16:56,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:16:56,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 23:16:56,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1635, Unknown=0, NotChecked=0, Total=1806 [2022-11-25 23:16:56,091 INFO L87 Difference]: Start difference. First operand 54 states and 72 transitions. Second operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-25 23:16:56,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:16:56,330 INFO L93 Difference]: Finished difference Result 78 states and 98 transitions. [2022-11-25 23:16:56,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 23:16:56,331 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2022-11-25 23:16:56,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:16:56,332 INFO L225 Difference]: With dead ends: 78 [2022-11-25 23:16:56,333 INFO L226 Difference]: Without dead ends: 65 [2022-11-25 23:16:56,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 91 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=204, Invalid=1958, Unknown=0, NotChecked=0, Total=2162 [2022-11-25 23:16:56,334 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 34 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:16:56,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 283 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:16:56,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-25 23:16:56,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2022-11-25 23:16:56,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 41 states have (on average 1.170731707317073) internal successors, (48), 41 states have internal predecessors, (48), 13 states have call successors, (13), 4 states have call predecessors, (13), 6 states have return successors, (20), 15 states have call predecessors, (20), 13 states have call successors, (20) [2022-11-25 23:16:56,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions. [2022-11-25 23:16:56,359 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 81 transitions. Word has length 43 [2022-11-25 23:16:56,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:16:56,359 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 81 transitions. [2022-11-25 23:16:56,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-25 23:16:56,360 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2022-11-25 23:16:56,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-25 23:16:56,361 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:16:56,362 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:16:56,371 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 23:16:56,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:16:56,569 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:16:56,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:16:56,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1425646728, now seen corresponding path program 1 times [2022-11-25 23:16:56,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:16:56,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284883872] [2022-11-25 23:16:56,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:16:56,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:16:56,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:16:56,757 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-25 23:16:56,757 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:16:56,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284883872] [2022-11-25 23:16:56,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284883872] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:16:56,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037904610] [2022-11-25 23:16:56,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:16:56,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:16:56,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:16:56,764 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:16:56,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 23:16:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:16:56,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 23:16:56,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:16:57,065 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-25 23:16:57,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:16:57,551 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-25 23:16:57,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037904610] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:16:57,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [419293455] [2022-11-25 23:16:57,554 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2022-11-25 23:16:57,555 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:16:57,556 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) 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:337) 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) [2022-11-25 23:16:57,559 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:16:57,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 7] total 19 [2022-11-25 23:16:57,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466197195] [2022-11-25 23:16:57,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:16:57,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-25 23:16:57,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:16:57,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-25 23:16:57,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2022-11-25 23:16:57,562 INFO L87 Difference]: Start difference. First operand 61 states and 81 transitions. Second operand has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 6 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-11-25 23:16:58,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:16:58,152 INFO L93 Difference]: Finished difference Result 74 states and 96 transitions. [2022-11-25 23:16:58,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 23:16:58,153 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 6 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 47 [2022-11-25 23:16:58,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:16:58,155 INFO L225 Difference]: With dead ends: 74 [2022-11-25 23:16:58,155 INFO L226 Difference]: Without dead ends: 64 [2022-11-25 23:16:58,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2022-11-25 23:16:58,157 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 55 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:16:58,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 243 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 23:16:58,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-25 23:16:58,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2022-11-25 23:16:58,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 40 states have (on average 1.175) internal successors, (47), 41 states have internal predecessors, (47), 14 states have call successors, (14), 5 states have call predecessors, (14), 7 states have return successors, (21), 15 states have call predecessors, (21), 14 states have call successors, (21) [2022-11-25 23:16:58,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 82 transitions. [2022-11-25 23:16:58,187 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 82 transitions. Word has length 47 [2022-11-25 23:16:58,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:16:58,188 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 82 transitions. [2022-11-25 23:16:58,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 6 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-11-25 23:16:58,188 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 82 transitions. [2022-11-25 23:16:58,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-25 23:16:58,190 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:16:58,190 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:16:58,197 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-25 23:16:58,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:16:58,396 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:16:58,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:16:58,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1790229342, now seen corresponding path program 1 times [2022-11-25 23:16:58,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:16:58,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67898591] [2022-11-25 23:16:58,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:16:58,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:16:58,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:16:58,564 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-25 23:16:58,564 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:16:58,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67898591] [2022-11-25 23:16:58,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67898591] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:16:58,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483148017] [2022-11-25 23:16:58,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:16:58,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:16:58,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:16:58,567 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:16:58,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 23:16:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:16:58,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 23:16:58,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:16:58,808 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-25 23:16:58,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:16:59,160 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-25 23:16:59,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483148017] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:16:59,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [885326298] [2022-11-25 23:16:59,162 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2022-11-25 23:16:59,162 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:16:59,163 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) 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:337) 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) [2022-11-25 23:16:59,163 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:16:59,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2022-11-25 23:16:59,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652598171] [2022-11-25 23:16:59,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:16:59,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-25 23:16:59,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:16:59,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-25 23:16:59,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-11-25 23:16:59,165 INFO L87 Difference]: Start difference. First operand 62 states and 82 transitions. Second operand has 16 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 16 states have internal predecessors, (43), 6 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) [2022-11-25 23:16:59,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:16:59,382 INFO L93 Difference]: Finished difference Result 72 states and 94 transitions. [2022-11-25 23:16:59,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 23:16:59,383 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 16 states have internal predecessors, (43), 6 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) Word has length 50 [2022-11-25 23:16:59,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:16:59,384 INFO L225 Difference]: With dead ends: 72 [2022-11-25 23:16:59,384 INFO L226 Difference]: Without dead ends: 47 [2022-11-25 23:16:59,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2022-11-25 23:16:59,385 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 7 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:16:59,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 191 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:16:59,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-25 23:16:59,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-11-25 23:16:59,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 31 states have internal predecessors, (35), 10 states have call successors, (10), 4 states have call predecessors, (10), 6 states have return successors, (15), 11 states have call predecessors, (15), 10 states have call successors, (15) [2022-11-25 23:16:59,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2022-11-25 23:16:59,399 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 60 transitions. Word has length 50 [2022-11-25 23:16:59,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:16:59,399 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 60 transitions. [2022-11-25 23:16:59,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 16 states have internal predecessors, (43), 6 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) [2022-11-25 23:16:59,400 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2022-11-25 23:16:59,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-25 23:16:59,401 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:16:59,401 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:16:59,417 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 23:16:59,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:16:59,608 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:16:59,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:16:59,608 INFO L85 PathProgramCache]: Analyzing trace with hash 71955684, now seen corresponding path program 2 times [2022-11-25 23:16:59,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:16:59,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728247176] [2022-11-25 23:16:59,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:16:59,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:16:59,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:16:59,787 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-25 23:16:59,787 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:16:59,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728247176] [2022-11-25 23:16:59,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728247176] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:16:59,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501072575] [2022-11-25 23:16:59,788 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:16:59,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:16:59,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:16:59,789 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:16:59,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 23:16:59,986 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-25 23:16:59,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:16:59,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-25 23:16:59,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:17:00,050 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-25 23:17:00,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:17:00,357 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-25 23:17:00,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501072575] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:17:00,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1347979423] [2022-11-25 23:17:00,359 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2022-11-25 23:17:00,359 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:17:00,359 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) 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:337) 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) [2022-11-25 23:17:00,359 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:17:00,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 16 [2022-11-25 23:17:00,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33193888] [2022-11-25 23:17:00,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:17:00,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-25 23:17:00,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:17:00,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-25 23:17:00,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-11-25 23:17:00,361 INFO L87 Difference]: Start difference. First operand 47 states and 60 transitions. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 15 states have internal predecessors, (42), 3 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-25 23:17:00,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:17:00,608 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2022-11-25 23:17:00,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 23:17:00,609 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 15 states have internal predecessors, (42), 3 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) Word has length 51 [2022-11-25 23:17:00,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:17:00,609 INFO L225 Difference]: With dead ends: 52 [2022-11-25 23:17:00,610 INFO L226 Difference]: Without dead ends: 44 [2022-11-25 23:17:00,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 92 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-11-25 23:17:00,614 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 24 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:17:00,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 268 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:17:00,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-25 23:17:00,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-11-25 23:17:00,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 10 states have call successors, (10), 4 states have call predecessors, (10), 6 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2022-11-25 23:17:00,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2022-11-25 23:17:00,632 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 51 [2022-11-25 23:17:00,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:17:00,633 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2022-11-25 23:17:00,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 15 states have internal predecessors, (42), 3 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-25 23:17:00,633 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2022-11-25 23:17:00,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-25 23:17:00,634 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:17:00,634 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:17:00,639 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-25 23:17:00,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:17:00,835 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:17:00,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:17:00,835 INFO L85 PathProgramCache]: Analyzing trace with hash 735415558, now seen corresponding path program 1 times [2022-11-25 23:17:00,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:17:00,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797326773] [2022-11-25 23:17:00,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:17:00,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:17:00,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:17:01,252 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-25 23:17:01,252 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:17:01,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797326773] [2022-11-25 23:17:01,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797326773] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:17:01,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046020386] [2022-11-25 23:17:01,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:17:01,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:17:01,253 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:17:01,254 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:17:01,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 23:17:01,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:17:01,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 165 conjunts are in the unsatisfiable core [2022-11-25 23:17:01,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:17:01,476 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-25 23:17:01,514 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 7 treesize of output 6 [2022-11-25 23:17:01,593 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 23:17:01,594 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-25 23:17:01,669 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-25 23:17:01,750 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 0 case distinctions, treesize of input 19 treesize of output 19 [2022-11-25 23:17:01,787 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 13 treesize of output 15 [2022-11-25 23:17:01,834 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 13 treesize of output 15 [2022-11-25 23:17:02,089 WARN L859 $PredicateComparison]: unable to prove that (exists ((upsweep_~right Int) (v_ArrVal_442 Int) (upsweep_~a.offset Int)) (and (<= |c_upsweep_#in~right| upsweep_~right) (= |c_#memory_int| (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (select |c_old(#memory_int)| |c_upsweep_#in~a.base|) (+ (* upsweep_~right 4) upsweep_~a.offset) v_ArrVal_442))) (<= |c_upsweep_#in~a.offset| upsweep_~a.offset))) is different from true [2022-11-25 23:17:02,629 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_443 Int)) (= (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (select |c_old(#memory_int)| |c_upsweep_#in~a.base|) (+ (* |c_upsweep_#in~right| 4) |c_upsweep_#in~a.offset|) v_ArrVal_443)) |c_#memory_int|)) is different from true [2022-11-25 23:17:06,962 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_445 Int) (upsweep_~right Int) (v_ArrVal_442 Int) (upsweep_~a.offset Int) (v_upsweep_~right_57 Int) (v_upsweep_~a.offset_57 Int)) (and (= (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (store (select |c_old(#memory_int)| |c_upsweep_#in~a.base|) (+ (* v_upsweep_~right_57 4) v_upsweep_~a.offset_57) v_ArrVal_442) (+ (* upsweep_~right 4) upsweep_~a.offset) v_ArrVal_445)) |c_#memory_int|) (<= |c_upsweep_#in~right| upsweep_~right) (<= |c_upsweep_#in~left| v_upsweep_~right_57) (<= upsweep_~a.offset v_upsweep_~a.offset_57) (<= |c_upsweep_#in~a.offset| upsweep_~a.offset))) is different from true [2022-11-25 23:17:06,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-11-25 23:17:07,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2022-11-25 23:17:08,883 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_452 Int) (downsweep_~left Int)) (and (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse2 (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)))) (store (let ((.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4))) (.cse0 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (select .cse0 .cse2)))) .cse2 v_ArrVal_452))) |c_#memory_int|) (<= downsweep_~left |c_downsweep_#in~left|) (not (< (+ downsweep_~left 1) |c_downsweep_#in~right|)))) is different from true [2022-11-25 23:17:09,136 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_456 Int) (v_ArrVal_455 Int) (downsweep_~left Int) (downsweep_~right Int) (downsweep_~a.offset Int)) (and (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (store (select |c_old(#memory_int)| |c_downsweep_#in~a.base|) (+ downsweep_~a.offset (* downsweep_~right 4)) v_ArrVal_456) (+ downsweep_~a.offset (* downsweep_~left 4)) v_ArrVal_455)) |c_#memory_int|) (<= |c_downsweep_#in~right| downsweep_~right) (<= |c_downsweep_#in~left| downsweep_~left) (<= |c_downsweep_#in~a.offset| downsweep_~a.offset))) is different from true [2022-11-25 23:17:11,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 135 [2022-11-25 23:17:17,678 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 129 treesize of output 123 [2022-11-25 23:17:17,816 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 11 not checked. [2022-11-25 23:17:17,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:17:19,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046020386] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:17:19,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [898166499] [2022-11-25 23:17:19,750 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-11-25 23:17:19,750 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:17:19,750 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) 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:337) 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) [2022-11-25 23:17:19,751 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 23:17:19,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 37] total 44 [2022-11-25 23:17:19,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112755671] [2022-11-25 23:17:19,751 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 23:17:19,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-25 23:17:19,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:17:19,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-25 23:17:19,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1684, Unknown=9, NotChecked=430, Total=2256 [2022-11-25 23:17:19,754 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand has 44 states, 30 states have (on average 2.033333333333333) internal successors, (61), 35 states have internal predecessors, (61), 12 states have call successors, (19), 3 states have call predecessors, (19), 10 states have return successors, (19), 11 states have call predecessors, (19), 12 states have call successors, (19) [2022-11-25 23:17:25,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 23:17:37,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 23:17:50,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 23:17:50,203 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~malloc15#1.base_BEFORE_CALL_32| Int)) (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc15#1.base_BEFORE_CALL_32|) 1)) (exists ((v_ArrVal_445 Int) (upsweep_~right Int) (v_ArrVal_442 Int) (upsweep_~a.offset Int) (v_upsweep_~right_57 Int) (v_upsweep_~a.offset_57 Int)) (and (= (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (store (select |c_old(#memory_int)| |c_upsweep_#in~a.base|) (+ (* v_upsweep_~right_57 4) v_upsweep_~a.offset_57) v_ArrVal_442) (+ (* upsweep_~right 4) upsweep_~a.offset) v_ArrVal_445)) |c_#memory_int|) (<= |c_upsweep_#in~right| upsweep_~right) (<= |c_upsweep_#in~left| v_upsweep_~right_57) (<= upsweep_~a.offset v_upsweep_~a.offset_57) (<= |c_upsweep_#in~a.offset| upsweep_~a.offset)))) is different from true [2022-11-25 23:17:52,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 23:17:52,617 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_int)| |c_upsweep_#in~a.base|))) (and (exists ((upsweep_~right Int) (v_ArrVal_442 Int) (upsweep_~a.offset Int)) (and (<= |c_upsweep_#in~right| upsweep_~right) (= |c_#memory_int| (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store .cse0 (+ (* upsweep_~right 4) upsweep_~a.offset) v_ArrVal_442))) (<= |c_upsweep_#in~a.offset| upsweep_~a.offset))) (exists ((v_ArrVal_445 Int) (upsweep_~right Int) (v_ArrVal_442 Int) (upsweep_~a.offset Int) (v_upsweep_~right_57 Int) (v_upsweep_~a.offset_57 Int)) (and (= (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (store .cse0 (+ (* v_upsweep_~right_57 4) v_upsweep_~a.offset_57) v_ArrVal_442) (+ (* upsweep_~right 4) upsweep_~a.offset) v_ArrVal_445)) |c_#memory_int|) (<= |c_upsweep_#in~right| upsweep_~right) (<= |c_upsweep_#in~left| v_upsweep_~right_57) (<= upsweep_~a.offset v_upsweep_~a.offset_57) (<= |c_upsweep_#in~a.offset| upsweep_~a.offset))) (exists ((v_ArrVal_443 Int)) (= (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store .cse0 (+ (* |c_upsweep_#in~right| 4) |c_upsweep_#in~a.offset|) v_ArrVal_443)) |c_#memory_int|)))) is different from true [2022-11-25 23:17:55,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 23:17:56,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:17:56,705 INFO L93 Difference]: Finished difference Result 97 states and 145 transitions. [2022-11-25 23:17:56,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-25 23:17:56,706 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 30 states have (on average 2.033333333333333) internal successors, (61), 35 states have internal predecessors, (61), 12 states have call successors, (19), 3 states have call predecessors, (19), 10 states have return successors, (19), 11 states have call predecessors, (19), 12 states have call successors, (19) Word has length 58 [2022-11-25 23:17:56,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:17:56,707 INFO L225 Difference]: With dead ends: 97 [2022-11-25 23:17:56,708 INFO L226 Difference]: Without dead ends: 72 [2022-11-25 23:17:56,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 39.2s TimeCoverageRelationStatistics Valid=530, Invalid=5306, Unknown=44, NotChecked=1092, Total=6972 [2022-11-25 23:17:56,711 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 54 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 1536 mSolverCounterSat, 69 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 2021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1536 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 409 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:17:56,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 274 Invalid, 2021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1536 Invalid, 7 Unknown, 409 Unchecked, 13.0s Time] [2022-11-25 23:17:56,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-25 23:17:56,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 59. [2022-11-25 23:17:56,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 37 states have internal predecessors, (40), 14 states have call successors, (14), 5 states have call predecessors, (14), 10 states have return successors, (31), 16 states have call predecessors, (31), 14 states have call successors, (31) [2022-11-25 23:17:56,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 85 transitions. [2022-11-25 23:17:56,735 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 85 transitions. Word has length 58 [2022-11-25 23:17:56,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:17:56,736 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 85 transitions. [2022-11-25 23:17:56,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 30 states have (on average 2.033333333333333) internal successors, (61), 35 states have internal predecessors, (61), 12 states have call successors, (19), 3 states have call predecessors, (19), 10 states have return successors, (19), 11 states have call predecessors, (19), 12 states have call successors, (19) [2022-11-25 23:17:56,736 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 85 transitions. [2022-11-25 23:17:56,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-25 23:17:56,737 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:17:56,738 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:17:56,743 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-25 23:17:56,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a78a0d08-6fb9-4f4e-8d86-03d2af679dd7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:17:56,938 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 23:17:56,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:17:56,939 INFO L85 PathProgramCache]: Analyzing trace with hash 46717768, now seen corresponding path program 2 times [2022-11-25 23:17:56,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:17:56,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830093276] [2022-11-25 23:17:56,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:17:56,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:17:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat