./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 b5237d83 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_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/config/TaipanReach.xml -i ../../sv-benchmarks/c/verifythis/prefixsum_rec.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba --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-b5237d8 [2022-11-22 02:45:46,059 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 02:45:46,061 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 02:45:46,085 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 02:45:46,085 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 02:45:46,086 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 02:45:46,096 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 02:45:46,100 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 02:45:46,102 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 02:45:46,108 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 02:45:46,110 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 02:45:46,112 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 02:45:46,112 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 02:45:46,117 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 02:45:46,120 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 02:45:46,122 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 02:45:46,124 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 02:45:46,125 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 02:45:46,126 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 02:45:46,128 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 02:45:46,130 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 02:45:46,132 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 02:45:46,134 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 02:45:46,135 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 02:45:46,144 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 02:45:46,147 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 02:45:46,147 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 02:45:46,148 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 02:45:46,150 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 02:45:46,151 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 02:45:46,152 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 02:45:46,153 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 02:45:46,155 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 02:45:46,157 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 02:45:46,159 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 02:45:46,160 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 02:45:46,161 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 02:45:46,161 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 02:45:46,161 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 02:45:46,163 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 02:45:46,164 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 02:45:46,165 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-22 02:45:46,206 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 02:45:46,206 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 02:45:46,207 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 02:45:46,207 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 02:45:46,208 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 02:45:46,208 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 02:45:46,208 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 02:45:46,209 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 02:45:46,209 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 02:45:46,209 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 02:45:46,210 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 02:45:46,210 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 02:45:46,211 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 02:45:46,211 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 02:45:46,211 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 02:45:46,212 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 02:45:46,212 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 02:45:46,212 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 02:45:46,213 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 02:45:46,213 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 02:45:46,213 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 02:45:46,213 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 02:45:46,214 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 02:45:46,214 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 02:45:46,214 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 02:45:46,214 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 02:45:46,215 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 02:45:46,215 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 02:45:46,216 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 02:45:46,216 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 02:45:46,216 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 02:45:46,216 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 02:45:46,217 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 02:45:46,217 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 02:45:46,217 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 02:45:46,217 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 02:45:46,218 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 02:45:46,218 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 02:45:46,218 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 02:45:46,218 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 02:45:46,219 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 02:45:46,219 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_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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-22 02:45:46,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 02:45:46,547 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 02:45:46,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 02:45:46,550 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 02:45:46,551 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 02:45:46,552 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/verifythis/prefixsum_rec.c [2022-11-22 02:45:49,581 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 02:45:49,787 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 02:45:49,788 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/sv-benchmarks/c/verifythis/prefixsum_rec.c [2022-11-22 02:45:49,794 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/data/15d087184/5a02cc7e429e498abf9fdab0e2df7a38/FLAG77c204df9 [2022-11-22 02:45:49,810 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/data/15d087184/5a02cc7e429e498abf9fdab0e2df7a38 [2022-11-22 02:45:49,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 02:45:49,814 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 02:45:49,815 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 02:45:49,816 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 02:45:49,822 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 02:45:49,823 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:45:49" (1/1) ... [2022-11-22 02:45:49,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77f8c257 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:45:49, skipping insertion in model container [2022-11-22 02:45:49,825 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:45:49" (1/1) ... [2022-11-22 02:45:49,834 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 02:45:49,851 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 02:45:50,086 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_658f93af-a137-4e94-a11d-a9d39fa67921/sv-benchmarks/c/verifythis/prefixsum_rec.c[525,538] [2022-11-22 02:45:50,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 02:45:50,153 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 02:45:50,169 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_658f93af-a137-4e94-a11d-a9d39fa67921/sv-benchmarks/c/verifythis/prefixsum_rec.c[525,538] [2022-11-22 02:45:50,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 02:45:50,213 INFO L208 MainTranslator]: Completed translation [2022-11-22 02:45:50,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:45:50 WrapperNode [2022-11-22 02:45:50,213 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 02:45:50,215 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 02:45:50,215 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 02:45:50,215 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 02:45:50,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:45:50" (1/1) ... [2022-11-22 02:45:50,244 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:45:50" (1/1) ... [2022-11-22 02:45:50,279 INFO L138 Inliner]: procedures = 22, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 75 [2022-11-22 02:45:50,279 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 02:45:50,280 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 02:45:50,280 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 02:45:50,281 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 02:45:50,291 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:45:50" (1/1) ... [2022-11-22 02:45:50,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:45:50" (1/1) ... [2022-11-22 02:45:50,303 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:45:50" (1/1) ... [2022-11-22 02:45:50,304 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:45:50" (1/1) ... [2022-11-22 02:45:50,315 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:45:50" (1/1) ... [2022-11-22 02:45:50,319 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:45:50" (1/1) ... [2022-11-22 02:45:50,320 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:45:50" (1/1) ... [2022-11-22 02:45:50,322 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:45:50" (1/1) ... [2022-11-22 02:45:50,334 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 02:45:50,335 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 02:45:50,335 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 02:45:50,335 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 02:45:50,336 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:45:50" (1/1) ... [2022-11-22 02:45:50,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 02:45:50,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:45:50,380 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 02:45:50,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 02:45:50,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 02:45:50,421 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-22 02:45:50,421 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-22 02:45:50,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 02:45:50,421 INFO L130 BoogieDeclarations]: Found specification of procedure downsweep [2022-11-22 02:45:50,421 INFO L138 BoogieDeclarations]: Found implementation of procedure downsweep [2022-11-22 02:45:50,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-22 02:45:50,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-22 02:45:50,422 INFO L130 BoogieDeclarations]: Found specification of procedure upsweep [2022-11-22 02:45:50,422 INFO L138 BoogieDeclarations]: Found implementation of procedure upsweep [2022-11-22 02:45:50,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 02:45:50,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 02:45:50,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-22 02:45:50,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-22 02:45:50,423 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-22 02:45:50,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 02:45:50,515 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 02:45:50,517 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 02:45:50,794 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 02:45:50,839 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 02:45:50,840 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-22 02:45:50,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:45:50 BoogieIcfgContainer [2022-11-22 02:45:50,842 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 02:45:50,855 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 02:45:50,855 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 02:45:50,859 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 02:45:50,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 02:45:49" (1/3) ... [2022-11-22 02:45:50,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f3248be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:45:50, skipping insertion in model container [2022-11-22 02:45:50,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:45:50" (2/3) ... [2022-11-22 02:45:50,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f3248be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:45:50, skipping insertion in model container [2022-11-22 02:45:50,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:45:50" (3/3) ... [2022-11-22 02:45:50,864 INFO L112 eAbstractionObserver]: Analyzing ICFG prefixsum_rec.c [2022-11-22 02:45:50,885 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 02:45:50,886 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-22 02:45:50,945 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 02:45:50,952 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;@2073ce65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 02:45:50,953 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-22 02:45:50,957 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-22 02:45:50,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-22 02:45:50,967 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:45:50,977 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-22 02:45:50,978 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 02:45:50,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:45:50,985 INFO L85 PathProgramCache]: Analyzing trace with hash -903243188, now seen corresponding path program 1 times [2022-11-22 02:45:50,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:45:50,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964965620] [2022-11-22 02:45:50,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:45:51,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:45:51,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:45:51,814 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-22 02:45:51,815 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:45:51,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964965620] [2022-11-22 02:45:51,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964965620] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:45:51,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:45:51,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 02:45:51,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746624990] [2022-11-22 02:45:51,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:45:51,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 02:45:51,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:45:51,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 02:45:51,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:45:51,860 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-22 02:45:52,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:45:52,165 INFO L93 Difference]: Finished difference Result 75 states and 101 transitions. [2022-11-22 02:45:52,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 02:45:52,168 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-22 02:45:52,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:45:52,176 INFO L225 Difference]: With dead ends: 75 [2022-11-22 02:45:52,176 INFO L226 Difference]: Without dead ends: 55 [2022-11-22 02:45:52,179 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-22 02:45:52,183 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-22 02:45:52,184 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-22 02:45:52,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-22 02:45:52,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 37. [2022-11-22 02:45:52,224 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-22 02:45:52,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2022-11-22 02:45:52,227 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 34 [2022-11-22 02:45:52,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:45:52,228 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2022-11-22 02:45:52,228 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-22 02:45:52,228 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-11-22 02:45:52,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-22 02:45:52,231 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:45:52,231 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-22 02:45:52,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 02:45:52,231 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 02:45:52,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:45:52,232 INFO L85 PathProgramCache]: Analyzing trace with hash 344366338, now seen corresponding path program 1 times [2022-11-22 02:45:52,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:45:52,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435973515] [2022-11-22 02:45:52,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:45:52,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:45:52,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:45:52,594 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-22 02:45:52,594 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:45:52,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435973515] [2022-11-22 02:45:52,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435973515] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:45:52,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333866982] [2022-11-22 02:45:52,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:45:52,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:45:52,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:45:52,607 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:45:52,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 02:45:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:45:52,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-22 02:45:52,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:45:52,890 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-22 02:45:52,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:45:52,996 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-22 02:45:52,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333866982] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:45:52,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1068854737] [2022-11-22 02:45:53,019 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2022-11-22 02:45:53,019 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:45:53,023 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:45:53,029 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:45:53,029 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:45:53,350 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2022-11-22 02:45:53,364 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:45:53,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1068854737] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:45:53,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:45:53,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 6, 6] total 17 [2022-11-22 02:45:53,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47618529] [2022-11-22 02:45:53,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:45:53,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-22 02:45:53,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:45:53,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-22 02:45:53,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2022-11-22 02:45:53,805 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-22 02:45:53,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:45:53,993 INFO L93 Difference]: Finished difference Result 69 states and 89 transitions. [2022-11-22 02:45:53,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 02:45:53,994 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-22 02:45:53,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:45:53,995 INFO L225 Difference]: With dead ends: 69 [2022-11-22 02:45:53,995 INFO L226 Difference]: Without dead ends: 38 [2022-11-22 02:45:53,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2022-11-22 02:45:53,997 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 47 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:45:53,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 55 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:45:53,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-22 02:45:54,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-11-22 02:45:54,014 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-22 02:45:54,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2022-11-22 02:45:54,019 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 35 [2022-11-22 02:45:54,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:45:54,019 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2022-11-22 02:45:54,019 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-22 02:45:54,020 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-11-22 02:45:54,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-22 02:45:54,022 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:45:54,023 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-22 02:45:54,035 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-22 02:45:54,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:45:54,230 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 02:45:54,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:45:54,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1298516122, now seen corresponding path program 1 times [2022-11-22 02:45:54,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:45:54,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234161484] [2022-11-22 02:45:54,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:45:54,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:45:54,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:45:54,483 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-22 02:45:54,484 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:45:54,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234161484] [2022-11-22 02:45:54,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234161484] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:45:54,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092406067] [2022-11-22 02:45:54,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:45:54,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:45:54,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:45:54,486 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:45:54,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-22 02:45:54,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:45:54,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-22 02:45:54,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:45:54,732 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-22 02:45:54,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:45:54,837 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-22 02:45:54,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092406067] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:45:54,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1241458906] [2022-11-22 02:45:54,843 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2022-11-22 02:45:54,844 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:45:54,844 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:45:54,844 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:45:54,845 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:45:55,280 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-22 02:45:55,298 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-22 02:45:55,356 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-22 02:45:55,483 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-22 02:45:55,483 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-22 02:45:55,518 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-22 02:45:55,519 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-22 02:45:55,671 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-22 02:45:55,684 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:45:55,839 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-22 02:45:55,853 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:45:55,910 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-22 02:45:56,004 INFO L321 Elim1Store]: treesize reduction 84, result has 9.7 percent of original size [2022-11-22 02:45:56,004 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-22 02:45:56,076 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:45:56,087 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-22 02:45:56,088 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-22 02:45:56,194 INFO L321 Elim1Store]: treesize reduction 22, result has 59.3 percent of original size [2022-11-22 02:45:56,194 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-22 02:45:56,293 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-22 02:45:56,337 INFO L321 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-11-22 02:45:56,338 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-22 02:45:56,358 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-22 02:45:56,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2022-11-22 02:45:56,670 INFO L197 IcfgInterpreter]: Interpreting procedure downsweep with input of size 41 for LOIs [2022-11-22 02:45:56,686 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.meminit with input of size 70 for LOIs [2022-11-22 02:45:56,732 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2022-11-22 02:45:56,734 INFO L197 IcfgInterpreter]: Interpreting procedure upsweep with input of size 42 for LOIs [2022-11-22 02:45:56,756 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:46:01,310 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-22 02:46:01,310 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:46:01,310 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:46:01,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-11-22 02:46:01,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745106091] [2022-11-22 02:46:01,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:46:01,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-22 02:46:01,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:46:01,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-22 02:46:01,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1327, Unknown=0, NotChecked=0, Total=1482 [2022-11-22 02:46:01,313 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-22 02:46:01,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:46:01,513 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2022-11-22 02:46:01,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 02:46:01,515 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-22 02:46:01,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:46:01,516 INFO L225 Difference]: With dead ends: 60 [2022-11-22 02:46:01,516 INFO L226 Difference]: Without dead ends: 39 [2022-11-22 02:46:01,517 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-22 02:46:01,518 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 14 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:46:01,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 135 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:46:01,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-22 02:46:01,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-11-22 02:46:01,527 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-22 02:46:01,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2022-11-22 02:46:01,528 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 36 [2022-11-22 02:46:01,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:46:01,529 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2022-11-22 02:46:01,529 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-22 02:46:01,529 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2022-11-22 02:46:01,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-22 02:46:01,530 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:46:01,531 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-22 02:46:01,544 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-22 02:46:01,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:46:01,737 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 02:46:01,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:46:01,737 INFO L85 PathProgramCache]: Analyzing trace with hash 975807272, now seen corresponding path program 2 times [2022-11-22 02:46:01,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:46:01,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689587123] [2022-11-22 02:46:01,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:46:01,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:46:01,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:46:03,935 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-22 02:46:03,935 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:46:03,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689587123] [2022-11-22 02:46:03,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689587123] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:46:03,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004410998] [2022-11-22 02:46:03,936 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 02:46:03,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:46:03,936 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:46:03,937 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:46:03,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-22 02:46:04,041 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-22 02:46:04,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:46:04,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-22 02:46:04,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:46:04,132 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-22 02:46:04,279 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-22 02:46:04,318 INFO L321 Elim1Store]: treesize reduction 34, result has 26.1 percent of original size [2022-11-22 02:46:04,319 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-22 02:46:04,473 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-22 02:46:04,473 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-22 02:46:04,504 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-22 02:46:04,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:46:04,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004410998] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:46:04,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1248704998] [2022-11-22 02:46:04,803 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2022-11-22 02:46:04,803 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:46:04,804 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:46:04,804 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:46:04,804 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:46:05,229 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-22 02:46:05,236 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-22 02:46:05,305 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-22 02:46:05,419 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-22 02:46:05,420 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-22 02:46:05,449 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-22 02:46:05,449 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-22 02:46:05,562 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-22 02:46:05,575 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:46:05,709 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-22 02:46:05,726 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:46:05,828 INFO L321 Elim1Store]: treesize reduction 38, result has 11.6 percent of original size [2022-11-22 02:46:05,828 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-22 02:46:05,878 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:46:05,890 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-22 02:46:05,890 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-22 02:46:05,935 INFO L321 Elim1Store]: treesize reduction 22, result has 59.3 percent of original size [2022-11-22 02:46:05,935 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-22 02:46:05,984 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-22 02:46:06,027 INFO L321 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-11-22 02:46:06,027 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-22 02:46:06,043 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-22 02:46:06,065 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-22 02:46:06,249 INFO L197 IcfgInterpreter]: Interpreting procedure downsweep with input of size 41 for LOIs [2022-11-22 02:46:06,261 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.meminit with input of size 70 for LOIs [2022-11-22 02:46:06,294 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2022-11-22 02:46:06,295 INFO L197 IcfgInterpreter]: Interpreting procedure upsweep with input of size 34 for LOIs [2022-11-22 02:46:06,306 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:46:11,201 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-22 02:46:11,201 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:46:11,201 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-22 02:46:11,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 28 [2022-11-22 02:46:11,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817929552] [2022-11-22 02:46:11,202 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-22 02:46:11,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-22 02:46:11,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:46:11,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-22 02:46:11,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=2938, Unknown=1, NotChecked=110, Total=3306 [2022-11-22 02:46:11,205 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-22 02:46:15,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:46:15,131 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2022-11-22 02:46:15,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-22 02:46:15,131 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-22 02:46:15,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:46:15,134 INFO L225 Difference]: With dead ends: 68 [2022-11-22 02:46:15,134 INFO L226 Difference]: Without dead ends: 66 [2022-11-22 02:46:15,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1807 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=522, Invalid=5643, Unknown=1, NotChecked=154, Total=6320 [2022-11-22 02:46:15,138 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 120 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-22 02:46:15,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 191 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 719 Invalid, 0 Unknown, 53 Unchecked, 1.3s Time] [2022-11-22 02:46:15,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-22 02:46:15,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 44. [2022-11-22 02:46:15,151 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-22 02:46:15,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2022-11-22 02:46:15,152 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 37 [2022-11-22 02:46:15,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:46:15,153 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2022-11-22 02:46:15,153 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-22 02:46:15,153 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2022-11-22 02:46:15,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-22 02:46:15,154 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:46:15,155 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-22 02:46:15,171 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-22 02:46:15,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:46:15,368 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 02:46:15,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:46:15,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1941203874, now seen corresponding path program 1 times [2022-11-22 02:46:15,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:46:15,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547336488] [2022-11-22 02:46:15,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:46:15,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:46:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:46:17,924 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-22 02:46:17,925 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:46:17,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547336488] [2022-11-22 02:46:17,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547336488] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:46:17,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265986274] [2022-11-22 02:46:17,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:46:17,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:46:17,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:46:17,927 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:46:17,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-22 02:46:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:46:18,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 106 conjunts are in the unsatisfiable core [2022-11-22 02:46:18,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:46:18,136 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-22 02:46:18,213 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-22 02:46:18,324 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 02:46:18,324 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-22 02:46:18,372 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-22 02:46:18,379 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-22 02:46:18,436 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-22 02:46:18,442 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-22 02:46:18,504 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-22 02:46:18,510 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-22 02:46:18,683 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-22 02:46:18,699 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-22 02:46:18,769 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-22 02:46:18,838 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-22 02:46:18,875 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-22 02:46:19,384 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-22 02:46:19,398 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-22 02:46:19,453 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-22 02:46:19,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:46:24,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265986274] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:46:24,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [418531594] [2022-11-22 02:46:24,282 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2022-11-22 02:46:24,282 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:46:24,282 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:46:24,283 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:46:24,283 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:46:24,509 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-22 02:46:24,515 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-22 02:46:24,568 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-22 02:46:24,734 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-22 02:46:24,734 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-22 02:46:24,769 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-22 02:46:24,769 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-22 02:46:24,894 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-22 02:46:24,908 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:46:25,051 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-22 02:46:25,063 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:46:25,119 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-22 02:46:25,240 INFO L321 Elim1Store]: treesize reduction 84, result has 9.7 percent of original size [2022-11-22 02:46:25,240 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-22 02:46:25,296 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:46:25,309 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-22 02:46:25,309 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-22 02:46:25,357 INFO L321 Elim1Store]: treesize reduction 22, result has 59.3 percent of original size [2022-11-22 02:46:25,358 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-22 02:46:25,402 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-22 02:46:25,443 INFO L321 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-11-22 02:46:25,443 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-22 02:46:25,460 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-22 02:46:25,480 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-22 02:46:25,939 INFO L197 IcfgInterpreter]: Interpreting procedure downsweep with input of size 41 for LOIs [2022-11-22 02:46:25,952 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.meminit with input of size 70 for LOIs [2022-11-22 02:46:25,980 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2022-11-22 02:46:25,981 INFO L197 IcfgInterpreter]: Interpreting procedure upsweep with input of size 34 for LOIs [2022-11-22 02:46:25,990 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:46:32,732 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-22 02:46:32,733 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:46:32,733 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-22 02:46:32,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 39 [2022-11-22 02:46:32,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758429741] [2022-11-22 02:46:32,734 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-22 02:46:32,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-22 02:46:32,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:46:32,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-22 02:46:32,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=4254, Unknown=4, NotChecked=402, Total=4970 [2022-11-22 02:46:32,739 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-22 02:46:36,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:46:36,587 INFO L93 Difference]: Finished difference Result 68 states and 89 transitions. [2022-11-22 02:46:36,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-22 02:46:36,588 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-22 02:46:36,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:46:36,589 INFO L225 Difference]: With dead ends: 68 [2022-11-22 02:46:36,589 INFO L226 Difference]: Without dead ends: 66 [2022-11-22 02:46:36,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 91 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2165 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=556, Invalid=7462, Unknown=4, NotChecked=534, Total=8556 [2022-11-22 02:46:36,592 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 136 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 191 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-22 02:46:36,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 241 Invalid, 1213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 899 Invalid, 0 Unknown, 191 Unchecked, 1.4s Time] [2022-11-22 02:46:36,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-22 02:46:36,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2022-11-22 02:46:36,609 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-22 02:46:36,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2022-11-22 02:46:36,610 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 40 [2022-11-22 02:46:36,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:46:36,611 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2022-11-22 02:46:36,611 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-22 02:46:36,611 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2022-11-22 02:46:36,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-22 02:46:36,612 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:46:36,613 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-22 02:46:36,627 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-22 02:46:36,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:46:36,818 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 02:46:36,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:46:36,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1975245212, now seen corresponding path program 2 times [2022-11-22 02:46:36,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:46:36,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148263953] [2022-11-22 02:46:36,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:46:36,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:46:36,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:46:37,014 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-22 02:46:37,014 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:46:37,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148263953] [2022-11-22 02:46:37,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148263953] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:46:37,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372828756] [2022-11-22 02:46:37,017 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 02:46:37,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:46:37,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:46:37,018 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:46:37,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-22 02:46:37,154 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-22 02:46:37,154 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:46:37,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-22 02:46:37,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:46:37,306 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-22 02:46:37,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:46:37,615 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-22 02:46:37,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372828756] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:46:37,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1464838436] [2022-11-22 02:46:37,618 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2022-11-22 02:46:37,618 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:46:37,618 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:46:37,619 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:46:37,619 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:46:37,855 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-22 02:46:37,861 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-22 02:46:37,905 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-22 02:46:38,002 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-22 02:46:38,002 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-22 02:46:38,063 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-22 02:46:38,063 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-22 02:46:38,193 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-22 02:46:38,204 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:46:38,331 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-22 02:46:38,344 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:46:38,428 INFO L321 Elim1Store]: treesize reduction 28, result has 15.2 percent of original size [2022-11-22 02:46:38,428 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-22 02:46:38,480 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:46:38,493 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-22 02:46:38,493 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-22 02:46:38,545 INFO L321 Elim1Store]: treesize reduction 22, result has 59.3 percent of original size [2022-11-22 02:46:38,545 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-22 02:46:38,587 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-22 02:46:38,632 INFO L321 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-11-22 02:46:38,633 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-22 02:46:38,651 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-22 02:46:38,671 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-22 02:46:39,117 INFO L197 IcfgInterpreter]: Interpreting procedure downsweep with input of size 41 for LOIs [2022-11-22 02:46:39,129 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.meminit with input of size 70 for LOIs [2022-11-22 02:46:39,167 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2022-11-22 02:46:39,169 INFO L197 IcfgInterpreter]: Interpreting procedure upsweep with input of size 34 for LOIs [2022-11-22 02:46:39,177 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:46:44,833 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-22 02:46:44,833 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:46:44,833 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:46:44,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 22 [2022-11-22 02:46:44,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67877794] [2022-11-22 02:46:44,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:46:44,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-22 02:46:44,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:46:44,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-22 02:46:44,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=2210, Unknown=0, NotChecked=0, Total=2450 [2022-11-22 02:46:44,836 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-22 02:46:45,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:46:45,231 INFO L93 Difference]: Finished difference Result 84 states and 110 transitions. [2022-11-22 02:46:45,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-22 02:46:45,232 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-22 02:46:45,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:46:45,234 INFO L225 Difference]: With dead ends: 84 [2022-11-22 02:46:45,234 INFO L226 Difference]: Without dead ends: 65 [2022-11-22 02:46:45,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=308, Invalid=2772, Unknown=0, NotChecked=0, Total=3080 [2022-11-22 02:46:45,236 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 59 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 02:46:45,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 306 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 02:46:45,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-22 02:46:45,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 54. [2022-11-22 02:46:45,253 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-22 02:46:45,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 72 transitions. [2022-11-22 02:46:45,254 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 72 transitions. Word has length 41 [2022-11-22 02:46:45,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:46:45,254 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 72 transitions. [2022-11-22 02:46:45,255 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-22 02:46:45,255 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 72 transitions. [2022-11-22 02:46:45,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-22 02:46:45,256 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:46:45,256 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-22 02:46:45,263 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-22 02:46:45,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-22 02:46:45,462 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 02:46:45,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:46:45,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1324607256, now seen corresponding path program 3 times [2022-11-22 02:46:45,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:46:45,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344181809] [2022-11-22 02:46:45,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:46:45,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:46:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:46:45,685 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-22 02:46:45,685 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:46:45,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344181809] [2022-11-22 02:46:45,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344181809] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:46:45,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099053505] [2022-11-22 02:46:45,686 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 02:46:45,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:46:45,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:46:45,691 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:46:45,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-22 02:46:45,791 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 02:46:45,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:46:45,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-22 02:46:45,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:46:45,895 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-22 02:46:45,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:46:45,999 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-22 02:46:46,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099053505] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:46:46,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1475329757] [2022-11-22 02:46:46,002 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2022-11-22 02:46:46,002 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:46:46,002 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:46:46,003 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:46:46,003 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:46:46,706 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-22 02:46:46,713 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-22 02:46:46,757 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-22 02:46:46,854 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-22 02:46:46,855 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-22 02:46:46,885 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-22 02:46:46,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-22 02:46:46,980 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-22 02:46:46,991 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:46:47,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-22 02:46:47,088 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-22 02:46:47,168 INFO L321 Elim1Store]: treesize reduction 38, result has 11.6 percent of original size [2022-11-22 02:46:47,169 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-22 02:46:47,212 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:46:47,224 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-22 02:46:47,224 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-22 02:46:47,272 INFO L321 Elim1Store]: treesize reduction 22, result has 59.3 percent of original size [2022-11-22 02:46:47,273 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-22 02:46:47,317 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-22 02:46:47,365 INFO L321 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-11-22 02:46:47,366 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-22 02:46:47,382 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-22 02:46:47,406 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-22 02:46:47,837 INFO L197 IcfgInterpreter]: Interpreting procedure downsweep with input of size 41 for LOIs [2022-11-22 02:46:47,849 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.meminit with input of size 70 for LOIs [2022-11-22 02:46:47,877 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2022-11-22 02:46:47,879 INFO L197 IcfgInterpreter]: Interpreting procedure upsweep with input of size 34 for LOIs [2022-11-22 02:46:47,887 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:46:52,922 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-22 02:46:52,922 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:46:52,922 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:46:52,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-11-22 02:46:52,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035829562] [2022-11-22 02:46:52,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:46:52,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-22 02:46:52,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:46:52,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-22 02:46:52,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1635, Unknown=0, NotChecked=0, Total=1806 [2022-11-22 02:46:52,924 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-22 02:46:53,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:46:53,168 INFO L93 Difference]: Finished difference Result 78 states and 98 transitions. [2022-11-22 02:46:53,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-22 02:46:53,169 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-22 02:46:53,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:46:53,170 INFO L225 Difference]: With dead ends: 78 [2022-11-22 02:46:53,171 INFO L226 Difference]: Without dead ends: 65 [2022-11-22 02:46:53,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 91 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=204, Invalid=1958, Unknown=0, NotChecked=0, Total=2162 [2022-11-22 02:46:53,172 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 34 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:46:53,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 283 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:46:53,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-22 02:46:53,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2022-11-22 02:46:53,192 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-22 02:46:53,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions. [2022-11-22 02:46:53,193 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 81 transitions. Word has length 43 [2022-11-22 02:46:53,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:46:53,194 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 81 transitions. [2022-11-22 02:46:53,194 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-22 02:46:53,194 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2022-11-22 02:46:53,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-22 02:46:53,196 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:46:53,196 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-22 02:46:53,203 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-22 02:46:53,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:46:53,402 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 02:46:53,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:46:53,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1425646728, now seen corresponding path program 1 times [2022-11-22 02:46:53,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:46:53,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068444186] [2022-11-22 02:46:53,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:46:53,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:46:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:46:53,566 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-22 02:46:53,566 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:46:53,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068444186] [2022-11-22 02:46:53,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068444186] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:46:53,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701171959] [2022-11-22 02:46:53,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:46:53,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:46:53,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:46:53,569 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:46:53,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-22 02:46:53,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:46:53,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-22 02:46:53,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:46:53,835 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-22 02:46:53,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:46:54,243 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-22 02:46:54,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701171959] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:46:54,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [771376061] [2022-11-22 02:46:54,246 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2022-11-22 02:46:54,248 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:46:54,249 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 02:46:54,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:46:54,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 7] total 19 [2022-11-22 02:46:54,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617356791] [2022-11-22 02:46:54,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:46:54,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-22 02:46:54,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:46:54,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-22 02:46:54,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2022-11-22 02:46:54,258 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-22 02:46:54,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:46:54,781 INFO L93 Difference]: Finished difference Result 74 states and 96 transitions. [2022-11-22 02:46:54,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-22 02:46:54,782 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-22 02:46:54,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:46:54,783 INFO L225 Difference]: With dead ends: 74 [2022-11-22 02:46:54,783 INFO L226 Difference]: Without dead ends: 64 [2022-11-22 02:46:54,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2022-11-22 02:46:54,785 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 59 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 02:46:54,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 243 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 02:46:54,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-22 02:46:54,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2022-11-22 02:46:54,804 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-22 02:46:54,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 82 transitions. [2022-11-22 02:46:54,806 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 82 transitions. Word has length 47 [2022-11-22 02:46:54,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:46:54,806 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 82 transitions. [2022-11-22 02:46:54,806 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-22 02:46:54,807 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 82 transitions. [2022-11-22 02:46:54,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-22 02:46:54,808 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:46:54,808 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-22 02:46:54,819 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-22 02:46:55,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:46:55,015 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 02:46:55,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:46:55,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1790229342, now seen corresponding path program 1 times [2022-11-22 02:46:55,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:46:55,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289983580] [2022-11-22 02:46:55,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:46:55,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:46:55,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:46:55,184 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-22 02:46:55,184 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:46:55,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289983580] [2022-11-22 02:46:55,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289983580] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:46:55,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132050814] [2022-11-22 02:46:55,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:46:55,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:46:55,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:46:55,187 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:46:55,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-22 02:46:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:46:55,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-22 02:46:55,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:46:55,394 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-22 02:46:55,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:46:55,698 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-22 02:46:55,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132050814] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:46:55,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [145532443] [2022-11-22 02:46:55,705 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2022-11-22 02:46:55,705 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:46:55,706 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 02:46:55,707 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:46:55,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2022-11-22 02:46:55,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959866892] [2022-11-22 02:46:55,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:46:55,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-22 02:46:55,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:46:55,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-22 02:46:55,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-11-22 02:46:55,713 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-22 02:46:55,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:46:55,972 INFO L93 Difference]: Finished difference Result 72 states and 94 transitions. [2022-11-22 02:46:55,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 02:46:55,974 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-22 02:46:55,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:46:55,975 INFO L225 Difference]: With dead ends: 72 [2022-11-22 02:46:55,975 INFO L226 Difference]: Without dead ends: 47 [2022-11-22 02:46:55,975 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-22 02:46:55,976 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 8 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:46:55,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 191 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:46:55,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-22 02:46:55,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-11-22 02:46:55,991 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-22 02:46:55,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2022-11-22 02:46:55,992 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 60 transitions. Word has length 50 [2022-11-22 02:46:55,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:46:55,993 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 60 transitions. [2022-11-22 02:46:55,993 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-22 02:46:55,993 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2022-11-22 02:46:55,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-22 02:46:55,998 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:46:55,998 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-22 02:46:56,012 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-22 02:46:56,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:46:56,213 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 02:46:56,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:46:56,213 INFO L85 PathProgramCache]: Analyzing trace with hash 71955684, now seen corresponding path program 2 times [2022-11-22 02:46:56,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:46:56,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707993668] [2022-11-22 02:46:56,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:46:56,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:46:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:46:56,410 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-22 02:46:56,410 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:46:56,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707993668] [2022-11-22 02:46:56,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707993668] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:46:56,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530586902] [2022-11-22 02:46:56,411 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 02:46:56,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:46:56,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:46:56,412 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:46:56,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-22 02:46:56,588 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-22 02:46:56,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:46:56,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-22 02:46:56,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:46:56,645 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-22 02:46:56,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:46:56,927 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-22 02:46:56,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530586902] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:46:56,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1988392326] [2022-11-22 02:46:56,929 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2022-11-22 02:46:56,929 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:46:56,930 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 02:46:56,930 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:46:56,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 16 [2022-11-22 02:46:56,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991849666] [2022-11-22 02:46:56,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:46:56,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-22 02:46:56,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:46:56,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-22 02:46:56,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-11-22 02:46:56,932 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-22 02:46:57,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:46:57,197 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2022-11-22 02:46:57,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 02:46:57,198 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-22 02:46:57,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:46:57,199 INFO L225 Difference]: With dead ends: 52 [2022-11-22 02:46:57,199 INFO L226 Difference]: Without dead ends: 44 [2022-11-22 02:46:57,200 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-22 02:46:57,201 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 24 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:46:57,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 268 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:46:57,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-22 02:46:57,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-11-22 02:46:57,213 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-22 02:46:57,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2022-11-22 02:46:57,214 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 51 [2022-11-22 02:46:57,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:46:57,215 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2022-11-22 02:46:57,215 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-22 02:46:57,215 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2022-11-22 02:46:57,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-22 02:46:57,216 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:46:57,216 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-22 02:46:57,228 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-22 02:46:57,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-22 02:46:57,422 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 02:46:57,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:46:57,423 INFO L85 PathProgramCache]: Analyzing trace with hash 735415558, now seen corresponding path program 1 times [2022-11-22 02:46:57,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:46:57,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104284284] [2022-11-22 02:46:57,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:46:57,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:46:57,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:46:57,838 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-22 02:46:57,838 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:46:57,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104284284] [2022-11-22 02:46:57,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104284284] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:46:57,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734185210] [2022-11-22 02:46:57,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:46:57,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:46:57,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:46:57,840 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:46:57,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-22 02:46:57,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:46:58,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 165 conjunts are in the unsatisfiable core [2022-11-22 02:46:58,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:46:58,045 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-22 02:46:58,082 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-22 02:46:58,157 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 02:46:58,157 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-22 02:46:58,232 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-22 02:46:58,321 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-22 02:46:58,360 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-22 02:46:58,407 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-22 02:46:58,631 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-22 02:46:58,820 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-22 02:47:03,301 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-22 02:47:03,327 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-22 02:47:03,445 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-22 02:47:05,896 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-22 02:47:06,138 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-22 02:47:08,665 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-22 02:47:14,916 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-22 02:47:15,044 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-22 02:47:15,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:47:18,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734185210] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:47:18,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1190153527] [2022-11-22 02:47:18,743 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-11-22 02:47:18,744 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:47:18,744 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 02:47:18,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-22 02:47:18,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 37] total 44 [2022-11-22 02:47:18,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671507884] [2022-11-22 02:47:18,745 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-22 02:47:18,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-22 02:47:18,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:47:18,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-22 02:47:18,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1683, Unknown=10, NotChecked=430, Total=2256 [2022-11-22 02:47:18,748 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-22 02:47:24,093 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-22 02:47:33,439 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-22 02:47:41,997 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-22 02:47:42,045 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-22 02:47:45,065 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-22 02:47:45,079 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-22 02:47:47,263 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-22 02:47:49,349 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-22 02:47:50,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:47:50,095 INFO L93 Difference]: Finished difference Result 100 states and 155 transitions. [2022-11-22 02:47:50,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-22 02:47:50,096 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-22 02:47:50,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:47:50,097 INFO L225 Difference]: With dead ends: 100 [2022-11-22 02:47:50,098 INFO L226 Difference]: Without dead ends: 75 [2022-11-22 02:47:50,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 964 ImplicationChecksByTransitivity, 33.9s TimeCoverageRelationStatistics Valid=532, Invalid=5332, Unknown=16, NotChecked=1092, Total=6972 [2022-11-22 02:47:50,101 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 69 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 1570 mSolverCounterSat, 78 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 2077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1570 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 418 IncrementalHoareTripleChecker+Unchecked, 15.3s IncrementalHoareTripleChecker+Time [2022-11-22 02:47:50,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 274 Invalid, 2077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1570 Invalid, 11 Unknown, 418 Unchecked, 15.3s Time] [2022-11-22 02:47:50,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-22 02:47:50,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 62. [2022-11-22 02:47:50,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 38 states have internal predecessors, (41), 15 states have call successors, (15), 5 states have call predecessors, (15), 11 states have return successors, (38), 18 states have call predecessors, (38), 15 states have call successors, (38) [2022-11-22 02:47:50,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 94 transitions. [2022-11-22 02:47:50,122 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 94 transitions. Word has length 58 [2022-11-22 02:47:50,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:47:50,123 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 94 transitions. [2022-11-22 02:47:50,123 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-22 02:47:50,123 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 94 transitions. [2022-11-22 02:47:50,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-22 02:47:50,124 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:47:50,124 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-22 02:47:50,130 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-22 02:47:50,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_658f93af-a137-4e94-a11d-a9d39fa67921/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-22 02:47:50,327 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 02:47:50,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:47:50,327 INFO L85 PathProgramCache]: Analyzing trace with hash 46717768, now seen corresponding path program 2 times [2022-11-22 02:47:50,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:47:50,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89387991] [2022-11-22 02:47:50,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:47:50,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:47:50,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat