./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-cav19/array_tiling_poly6.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-cav19/array_tiling_poly6.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8042a67d0dc5a681cc7287c11c57f70e29cd2c3a .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-5485861 [2020-10-25 19:22:47,077 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-25 19:22:47,082 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-25 19:22:47,137 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-25 19:22:47,138 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-25 19:22:47,145 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-25 19:22:47,148 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-25 19:22:47,156 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-25 19:22:47,158 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-25 19:22:47,160 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-25 19:22:47,161 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-25 19:22:47,163 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-25 19:22:47,163 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-25 19:22:47,165 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-25 19:22:47,166 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-25 19:22:47,168 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-25 19:22:47,169 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-25 19:22:47,170 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-25 19:22:47,172 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-25 19:22:47,174 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-25 19:22:47,176 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-25 19:22:47,178 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-25 19:22:47,179 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-25 19:22:47,180 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-25 19:22:47,183 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-25 19:22:47,184 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-25 19:22:47,184 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-25 19:22:47,185 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-25 19:22:47,186 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-25 19:22:47,187 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-25 19:22:47,188 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-25 19:22:47,189 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-25 19:22:47,190 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-25 19:22:47,191 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-25 19:22:47,193 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-25 19:22:47,193 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-25 19:22:47,194 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-25 19:22:47,195 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-25 19:22:47,195 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-25 19:22:47,196 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-25 19:22:47,197 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-25 19:22:47,203 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-25 19:22:47,261 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-25 19:22:47,261 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-25 19:22:47,264 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-25 19:22:47,265 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-25 19:22:47,265 INFO L138 SettingsManager]: * Use SBE=true [2020-10-25 19:22:47,266 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-25 19:22:47,266 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-25 19:22:47,266 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-25 19:22:47,267 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-25 19:22:47,267 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-25 19:22:47,268 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-25 19:22:47,269 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-25 19:22:47,269 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-25 19:22:47,269 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-25 19:22:47,269 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-25 19:22:47,270 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-25 19:22:47,270 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-25 19:22:47,270 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-25 19:22:47,271 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-25 19:22:47,271 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-25 19:22:47,271 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-25 19:22:47,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 19:22:47,272 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-25 19:22:47,272 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-25 19:22:47,272 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-25 19:22:47,272 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-25 19:22:47,273 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-25 19:22:47,273 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-25 19:22:47,273 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-25 19:22:47,273 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> Automizer 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 -> 8042a67d0dc5a681cc7287c11c57f70e29cd2c3a [2020-10-25 19:22:47,669 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-25 19:22:47,726 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-25 19:22:47,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-25 19:22:47,732 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-25 19:22:47,733 INFO L275 PluginConnector]: CDTParser initialized [2020-10-25 19:22:47,734 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-cav19/array_tiling_poly6.c [2020-10-25 19:22:47,809 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b367b1cd/ea88f61335b5430da6761e94d89161a6/FLAGabd77b940 [2020-10-25 19:22:48,399 INFO L306 CDTParser]: Found 1 translation units. [2020-10-25 19:22:48,400 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-cav19/array_tiling_poly6.c [2020-10-25 19:22:48,408 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b367b1cd/ea88f61335b5430da6761e94d89161a6/FLAGabd77b940 [2020-10-25 19:22:48,771 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b367b1cd/ea88f61335b5430da6761e94d89161a6 [2020-10-25 19:22:48,775 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-25 19:22:48,786 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-25 19:22:48,806 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-25 19:22:48,809 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-25 19:22:48,818 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-25 19:22:48,822 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 07:22:48" (1/1) ... [2020-10-25 19:22:48,838 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b97d50c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:22:48, skipping insertion in model container [2020-10-25 19:22:48,839 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 07:22:48" (1/1) ... [2020-10-25 19:22:48,869 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-25 19:22:48,905 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-25 19:22:49,132 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 19:22:49,141 INFO L203 MainTranslator]: Completed pre-run [2020-10-25 19:22:49,159 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 19:22:49,176 INFO L208 MainTranslator]: Completed translation [2020-10-25 19:22:49,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:22:49 WrapperNode [2020-10-25 19:22:49,177 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-25 19:22:49,178 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-25 19:22:49,178 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-25 19:22:49,179 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-25 19:22:49,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:22:49" (1/1) ... [2020-10-25 19:22:49,199 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:22:49" (1/1) ... [2020-10-25 19:22:49,221 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-25 19:22:49,222 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-25 19:22:49,223 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-25 19:22:49,223 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-25 19:22:49,232 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:22:49" (1/1) ... [2020-10-25 19:22:49,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:22:49" (1/1) ... [2020-10-25 19:22:49,235 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:22:49" (1/1) ... [2020-10-25 19:22:49,235 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:22:49" (1/1) ... [2020-10-25 19:22:49,241 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:22:49" (1/1) ... [2020-10-25 19:22:49,246 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:22:49" (1/1) ... [2020-10-25 19:22:49,248 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:22:49" (1/1) ... [2020-10-25 19:22:49,250 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-25 19:22:49,252 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-25 19:22:49,252 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-25 19:22:49,252 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-25 19:22:49,253 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:22:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 19:22:49,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-25 19:22:49,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-25 19:22:49,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-25 19:22:49,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-25 19:22:49,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-25 19:22:49,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-25 19:22:49,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-25 19:22:49,706 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-25 19:22:49,706 INFO L298 CfgBuilder]: Removed 13 assume(true) statements. [2020-10-25 19:22:49,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 07:22:49 BoogieIcfgContainer [2020-10-25 19:22:49,709 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-25 19:22:49,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-25 19:22:49,711 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-25 19:22:49,715 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-25 19:22:49,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 07:22:48" (1/3) ... [2020-10-25 19:22:49,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35153c9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 07:22:49, skipping insertion in model container [2020-10-25 19:22:49,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:22:49" (2/3) ... [2020-10-25 19:22:49,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35153c9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 07:22:49, skipping insertion in model container [2020-10-25 19:22:49,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 07:22:49" (3/3) ... [2020-10-25 19:22:49,720 INFO L111 eAbstractionObserver]: Analyzing ICFG array_tiling_poly6.c [2020-10-25 19:22:49,734 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-25 19:22:49,749 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-25 19:22:49,784 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-25 19:22:49,833 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-25 19:22:49,833 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-25 19:22:49,834 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-25 19:22:49,834 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-25 19:22:49,834 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-25 19:22:49,834 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-25 19:22:49,835 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-25 19:22:49,835 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-25 19:22:49,853 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2020-10-25 19:22:49,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-25 19:22:49,861 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:22:49,862 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:22:49,863 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:22:49,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:22:49,871 INFO L82 PathProgramCache]: Analyzing trace with hash -56209308, now seen corresponding path program 1 times [2020-10-25 19:22:49,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:22:49,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721240434] [2020-10-25 19:22:49,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:22:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:22:50,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:22:50,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721240434] [2020-10-25 19:22:50,079 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:22:50,079 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-25 19:22:50,080 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40733171] [2020-10-25 19:22:50,085 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-25 19:22:50,086 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:22:50,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-25 19:22:50,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-25 19:22:50,105 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2020-10-25 19:22:50,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:22:50,125 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2020-10-25 19:22:50,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-25 19:22:50,126 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-10-25 19:22:50,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:22:50,136 INFO L225 Difference]: With dead ends: 38 [2020-10-25 19:22:50,137 INFO L226 Difference]: Without dead ends: 16 [2020-10-25 19:22:50,140 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-25 19:22:50,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-10-25 19:22:50,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-10-25 19:22:50,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-25 19:22:50,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2020-10-25 19:22:50,188 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 11 [2020-10-25 19:22:50,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:22:50,190 INFO L481 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2020-10-25 19:22:50,190 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-25 19:22:50,190 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2020-10-25 19:22:50,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-25 19:22:50,191 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:22:50,192 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:22:50,192 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-25 19:22:50,193 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:22:50,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:22:50,197 INFO L82 PathProgramCache]: Analyzing trace with hash -411746854, now seen corresponding path program 1 times [2020-10-25 19:22:50,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:22:50,198 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575921810] [2020-10-25 19:22:50,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:22:50,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:22:50,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:22:50,339 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575921810] [2020-10-25 19:22:50,340 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:22:50,340 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-25 19:22:50,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189525287] [2020-10-25 19:22:50,342 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 19:22:50,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:22:50,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 19:22:50,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:22:50,346 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 5 states. [2020-10-25 19:22:50,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:22:50,421 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2020-10-25 19:22:50,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:22:50,422 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-25 19:22:50,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:22:50,423 INFO L225 Difference]: With dead ends: 39 [2020-10-25 19:22:50,423 INFO L226 Difference]: Without dead ends: 26 [2020-10-25 19:22:50,424 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:22:50,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-10-25 19:22:50,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2020-10-25 19:22:50,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-25 19:22:50,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2020-10-25 19:22:50,431 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 11 [2020-10-25 19:22:50,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:22:50,431 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-10-25 19:22:50,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 19:22:50,432 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2020-10-25 19:22:50,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-25 19:22:50,432 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:22:50,433 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:22:50,433 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-25 19:22:50,433 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:22:50,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:22:50,435 INFO L82 PathProgramCache]: Analyzing trace with hash 467501014, now seen corresponding path program 1 times [2020-10-25 19:22:50,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:22:50,435 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435420711] [2020-10-25 19:22:50,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:22:50,453 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-10-25 19:22:50,453 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1603288949] [2020-10-25 19:22:50,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 19:22:50,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:22:50,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-25 19:22:50,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:22:50,656 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-25 19:22:50,657 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 19:22:50,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-25 19:22:50,759 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435420711] [2020-10-25 19:22:50,760 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-10-25 19:22:50,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603288949] [2020-10-25 19:22:50,760 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-25 19:22:50,761 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-25 19:22:50,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299811732] [2020-10-25 19:22:50,761 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-25 19:22:50,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:22:50,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-25 19:22:50,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-25 19:22:50,763 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 6 states. [2020-10-25 19:22:50,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:22:50,919 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2020-10-25 19:22:50,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-25 19:22:50,920 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-25 19:22:50,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:22:50,921 INFO L225 Difference]: With dead ends: 47 [2020-10-25 19:22:50,921 INFO L226 Difference]: Without dead ends: 36 [2020-10-25 19:22:50,922 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-25 19:22:50,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-10-25 19:22:50,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 22. [2020-10-25 19:22:50,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-25 19:22:50,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2020-10-25 19:22:50,930 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2020-10-25 19:22:50,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:22:50,931 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2020-10-25 19:22:50,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-25 19:22:50,931 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2020-10-25 19:22:50,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-25 19:22:50,932 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:22:50,932 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:22:51,145 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-10-25 19:22:51,146 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:22:51,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:22:51,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1570853842, now seen corresponding path program 2 times [2020-10-25 19:22:51,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:22:51,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339243575] [2020-10-25 19:22:51,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:22:51,165 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-10-25 19:22:51,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1191775872] [2020-10-25 19:22:51,166 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 19:22:51,256 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-25 19:22:51,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 19:22:51,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 17 conjunts are in the unsatisfiable core [2020-10-25 19:22:51,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:22:51,307 INFO L384 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 17 [2020-10-25 19:22:51,308 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 19:22:51,316 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 19:22:51,316 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-25 19:22:51,317 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2020-10-25 19:22:51,379 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 19:22:51,379 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 60 [2020-10-25 19:22:51,381 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 19:22:51,404 INFO L625 ElimStorePlain]: treesize reduction 30, result has 48.3 percent of original size [2020-10-25 19:22:51,409 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-25 19:22:51,409 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:28 [2020-10-25 19:22:51,581 INFO L350 Elim1Store]: treesize reduction 32, result has 75.6 percent of original size [2020-10-25 19:22:51,582 INFO L384 Elim1Store]: Elim1 did not use preprocessing 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 56 treesize of output 130 [2020-10-25 19:22:51,585 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 19:22:51,621 INFO L625 ElimStorePlain]: treesize reduction 101, result has 24.1 percent of original size [2020-10-25 19:22:51,625 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-25 19:22:51,625 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:32 [2020-10-25 19:22:51,780 INFO L350 Elim1Store]: treesize reduction 42, result has 67.9 percent of original size [2020-10-25 19:22:51,781 INFO L384 Elim1Store]: Elim1 did not use preprocessing 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 56 treesize of output 120 [2020-10-25 19:22:51,784 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 19:22:51,866 INFO L625 ElimStorePlain]: treesize reduction 56, result has 57.3 percent of original size [2020-10-25 19:22:51,869 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-25 19:22:51,872 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-25 19:22:51,879 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-25 19:22:51,880 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:75 [2020-10-25 19:22:51,882 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-25 19:22:51,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-25 19:22:51,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-25 19:22:51,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-25 19:22:51,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-25 19:22:51,962 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-25 19:22:52,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-25 19:22:52,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-25 19:22:52,041 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-25 19:22:52,116 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-25 19:22:52,117 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-25 19:22:52,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-25 19:22:52,270 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-25 19:22:52,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 19:22:52,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-25 19:22:52,288 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-25 19:22:52,392 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:22:52,392 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339243575] [2020-10-25 19:22:52,393 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-10-25 19:22:52,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191775872] [2020-10-25 19:22:52,394 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-25 19:22:52,394 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-10-25 19:22:52,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928989823] [2020-10-25 19:22:52,395 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-25 19:22:52,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:22:52,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-25 19:22:52,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-10-25 19:22:52,397 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 11 states. [2020-10-25 19:22:57,145 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2020-10-25 19:22:57,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:22:57,523 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2020-10-25 19:22:57,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-25 19:22:57,527 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2020-10-25 19:22:57,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:22:57,528 INFO L225 Difference]: With dead ends: 43 [2020-10-25 19:22:57,528 INFO L226 Difference]: Without dead ends: 41 [2020-10-25 19:22:57,530 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2020-10-25 19:22:57,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-10-25 19:22:57,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 24. [2020-10-25 19:22:57,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-25 19:22:57,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2020-10-25 19:22:57,542 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 19 [2020-10-25 19:22:57,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:22:57,542 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2020-10-25 19:22:57,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-25 19:22:57,543 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-10-25 19:22:57,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-25 19:22:57,543 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:22:57,544 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:22:57,757 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 19:22:57,758 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:22:57,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:22:57,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1321151622, now seen corresponding path program 1 times [2020-10-25 19:22:57,759 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:22:57,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163876628] [2020-10-25 19:22:57,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:22:57,777 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-10-25 19:22:57,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [459885572] [2020-10-25 19:22:57,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 19:22:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:22:57,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 20 conjunts are in the unsatisfiable core [2020-10-25 19:22:57,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:22:57,885 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-10-25 19:22:57,885 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 19:22:57,888 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 19:22:57,889 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-25 19:22:57,889 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2020-10-25 19:22:57,950 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 19:22:57,951 INFO L384 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 80 [2020-10-25 19:22:57,953 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 19:22:57,974 INFO L625 ElimStorePlain]: treesize reduction 64, result has 16.9 percent of original size [2020-10-25 19:22:57,975 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-25 19:22:57,975 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:13 [2020-10-25 19:22:57,999 INFO L384 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 15 [2020-10-25 19:22:58,000 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 19:22:58,004 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 19:22:58,004 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-25 19:22:58,005 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:11 [2020-10-25 19:22:58,068 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 19:22:58,116 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:22:58,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163876628] [2020-10-25 19:22:58,117 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-10-25 19:22:58,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459885572] [2020-10-25 19:22:58,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-25 19:22:58,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-10-25 19:22:58,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7128731] [2020-10-25 19:22:58,118 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-25 19:22:58,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:22:58,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-25 19:22:58,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-10-25 19:22:58,119 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 11 states. [2020-10-25 19:22:58,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:22:58,360 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2020-10-25 19:22:58,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-25 19:22:58,362 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2020-10-25 19:22:58,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:22:58,363 INFO L225 Difference]: With dead ends: 53 [2020-10-25 19:22:58,363 INFO L226 Difference]: Without dead ends: 51 [2020-10-25 19:22:58,363 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-10-25 19:22:58,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-10-25 19:22:58,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 31. [2020-10-25 19:22:58,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-25 19:22:58,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2020-10-25 19:22:58,373 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 23 [2020-10-25 19:22:58,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:22:58,374 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2020-10-25 19:22:58,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-25 19:22:58,374 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2020-10-25 19:22:58,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-25 19:22:58,375 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:22:58,375 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:22:58,591 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 19:22:58,592 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:22:58,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:22:58,593 INFO L82 PathProgramCache]: Analyzing trace with hash -516059100, now seen corresponding path program 2 times [2020-10-25 19:22:58,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:22:58,594 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209083630] [2020-10-25 19:22:58,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:22:58,616 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-10-25 19:22:58,617 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [506697127] [2020-10-25 19:22:58,619 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 19:22:58,671 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-25 19:22:58,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 19:22:58,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-25 19:22:58,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:22:58,758 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-25 19:22:58,759 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209083630] [2020-10-25 19:22:58,759 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-10-25 19:22:58,759 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506697127] [2020-10-25 19:22:58,759 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-25 19:22:58,759 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-10-25 19:22:58,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935554268] [2020-10-25 19:22:58,760 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-25 19:22:58,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:22:58,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-25 19:22:58,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-25 19:22:58,761 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 9 states. [2020-10-25 19:22:58,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:22:58,966 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2020-10-25 19:22:58,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-25 19:22:58,967 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-25 19:22:58,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:22:58,967 INFO L225 Difference]: With dead ends: 72 [2020-10-25 19:22:58,967 INFO L226 Difference]: Without dead ends: 44 [2020-10-25 19:22:58,968 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2020-10-25 19:22:58,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-10-25 19:22:58,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 28. [2020-10-25 19:22:58,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-10-25 19:22:58,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2020-10-25 19:22:58,976 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 25 [2020-10-25 19:22:58,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:22:58,976 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2020-10-25 19:22:58,976 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-25 19:22:58,976 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-10-25 19:22:58,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-25 19:22:58,977 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:22:58,977 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:22:59,190 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 19:22:59,191 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:22:59,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:22:59,192 INFO L82 PathProgramCache]: Analyzing trace with hash 2087597186, now seen corresponding path program 3 times [2020-10-25 19:22:59,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:22:59,193 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726661692] [2020-10-25 19:22:59,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:22:59,203 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-10-25 19:22:59,204 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1858904505] [2020-10-25 19:22:59,204 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 19:22:59,291 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-25 19:22:59,291 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 19:22:59,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 26 conjunts are in the unsatisfiable core [2020-10-25 19:22:59,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:22:59,309 INFO L384 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 17 [2020-10-25 19:22:59,309 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 19:22:59,314 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 19:22:59,315 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-25 19:22:59,315 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2020-10-25 19:22:59,375 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 19:22:59,376 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 66 [2020-10-25 19:22:59,377 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 19:22:59,426 INFO L625 ElimStorePlain]: treesize reduction 36, result has 47.8 percent of original size [2020-10-25 19:22:59,428 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-25 19:22:59,428 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2020-10-25 19:22:59,687 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2020-10-25 19:22:59,688 INFO L350 Elim1Store]: treesize reduction 14, result has 90.2 percent of original size [2020-10-25 19:22:59,689 INFO L384 Elim1Store]: Elim1 did not use preprocessing 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 56 treesize of output 158 [2020-10-25 19:22:59,691 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 19:22:59,792 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 25 [2020-10-25 19:22:59,793 INFO L625 ElimStorePlain]: treesize reduction 141, result has 19.9 percent of original size [2020-10-25 19:22:59,795 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-25 19:22:59,795 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:35 [2020-10-25 19:22:59,913 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 19:22:59,913 INFO L384 Elim1Store]: Elim1 did not use preprocessing 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 48 treesize of output 83 [2020-10-25 19:22:59,915 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 19:22:59,969 INFO L625 ElimStorePlain]: treesize reduction 51, result has 38.6 percent of original size [2020-10-25 19:22:59,971 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-25 19:22:59,971 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:32 [2020-10-25 19:23:00,199 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2020-10-25 19:23:00,200 INFO L350 Elim1Store]: treesize reduction 14, result has 90.2 percent of original size [2020-10-25 19:23:00,200 INFO L384 Elim1Store]: Elim1 did not use preprocessing 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 56 treesize of output 158 [2020-10-25 19:23:00,202 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 19:23:00,361 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2020-10-25 19:23:00,362 INFO L625 ElimStorePlain]: treesize reduction 60, result has 65.3 percent of original size [2020-10-25 19:23:00,364 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-25 19:23:00,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-25 19:23:00,381 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-25 19:23:00,383 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-25 19:23:00,384 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:113 [2020-10-25 19:23:00,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-25 19:23:00,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-25 19:23:00,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-25 19:23:00,482 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-25 19:23:00,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-25 19:23:00,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-25 19:23:00,488 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-25 19:23:00,490 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-25 19:23:00,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-25 19:23:00,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-25 19:23:00,505 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-25 19:23:00,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-25 19:23:00,511 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-25 19:23:00,512 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-25 19:23:00,516 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-25 19:23:00,517 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-25 19:23:00,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-25 19:23:00,523 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-25 19:23:00,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-25 19:23:00,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-25 19:23:00,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-25 19:23:00,533 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-25 19:23:00,906 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 52 [2020-10-25 19:23:00,913 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-25 19:23:01,414 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-25 19:23:01,414 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 19:23:01,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-25 19:23:01,441 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-25 19:23:01,619 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:23:01,619 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726661692] [2020-10-25 19:23:01,619 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-10-25 19:23:01,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858904505] [2020-10-25 19:23:01,620 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-25 19:23:01,620 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-10-25 19:23:01,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159941256] [2020-10-25 19:23:01,621 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-25 19:23:01,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:23:01,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-25 19:23:01,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2020-10-25 19:23:01,623 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 16 states. [2020-10-25 19:23:02,756 WARN L193 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 27 [2020-10-25 19:23:05,120 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2020-10-25 19:23:05,414 WARN L193 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2020-10-25 19:23:05,716 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2020-10-25 19:23:10,023 WARN L193 SmtUtils]: Spent 4.16 s on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2020-10-25 19:23:10,452 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2020-10-25 19:23:10,698 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2020-10-25 19:23:10,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:23:10,741 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2020-10-25 19:23:10,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-25 19:23:10,744 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-10-25 19:23:10,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:23:10,744 INFO L225 Difference]: With dead ends: 57 [2020-10-25 19:23:10,744 INFO L226 Difference]: Without dead ends: 0 [2020-10-25 19:23:10,745 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2020-10-25 19:23:10,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-25 19:23:10,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-25 19:23:10,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-25 19:23:10,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-25 19:23:10,746 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2020-10-25 19:23:10,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:23:10,747 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-25 19:23:10,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-25 19:23:10,747 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-25 19:23:10,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-25 19:23:10,947 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-10-25 19:23:10,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-25 19:23:11,164 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 120 [2020-10-25 19:23:11,441 WARN L193 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 38 [2020-10-25 19:23:11,582 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 20 [2020-10-25 19:23:12,133 WARN L193 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 47 [2020-10-25 19:23:12,136 INFO L274 CegarLoopResult]: For program point L23-2(lines 23 24) no Hoare annotation was computed. [2020-10-25 19:23:12,137 INFO L270 CegarLoopResult]: At program point L23-3(lines 23 24) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |ULTIMATE.start_main_~#a~0.base|))) (let ((.cse6 (= ULTIMATE.start_main_~i~0 0)) (.cse2 (= (+ (select .cse7 |ULTIMATE.start_main_~#a~0.offset|) 1) 0)) (.cse3 (< 1 ULTIMATE.start_main_~S~0)) (.cse4 (<= 1 ULTIMATE.start_main_~i~0)) (.cse5 (= ULTIMATE.start_assume_abort_if_not_~cond 1))) (let ((.cse0 (or (and .cse6 .cse3 (= (+ (* ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~i~0) (+ (select .cse7 (+ |ULTIMATE.start_main_~#a~0.offset| (* ULTIMATE.start_main_~i~0 4))) 1)) .cse5) (and .cse2 (= ULTIMATE.start_main_~i~0 1) .cse3 .cse4 .cse5 (= (+ (select .cse7 (+ |ULTIMATE.start_main_~#a~0.offset| 4)) 1) 0)))) (.cse1 (<= ULTIMATE.start_main_~S~0 2))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 (<= 0 ULTIMATE.start___VERIFIER_assert_~cond) .cse5) (and (<= ULTIMATE.start_main_~i~0 0) .cse0) (and .cse2 .cse3 (<= 2 ULTIMATE.start_main_~i~0) .cse4 .cse5 (<= ULTIMATE.start_main_~i~0 2) .cse1) (and .cse6 (<= ULTIMATE.start_main_~S~0 0)))))) [2020-10-25 19:23:12,137 INFO L274 CegarLoopResult]: For program point L23-4(lines 23 24) no Hoare annotation was computed. [2020-10-25 19:23:12,137 INFO L274 CegarLoopResult]: For program point L3(line 3) no Hoare annotation was computed. [2020-10-25 19:23:12,137 INFO L274 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-10-25 19:23:12,137 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-10-25 19:23:12,137 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-10-25 19:23:12,137 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-10-25 19:23:12,138 INFO L274 CegarLoopResult]: For program point L20-2(lines 20 21) no Hoare annotation was computed. [2020-10-25 19:23:12,138 INFO L270 CegarLoopResult]: At program point L20-3(lines 20 21) the Hoare annotation is: (let ((.cse4 (select |#memory_int| |ULTIMATE.start_main_~#a~0.base|))) (let ((.cse0 (= (+ (select .cse4 |ULTIMATE.start_main_~#a~0.offset|) 1) 0)) (.cse1 (< 1 ULTIMATE.start_main_~S~0)) (.cse2 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse3 (= ULTIMATE.start_main_~i~0 0))) (or (and .cse0 .cse1 (<= 1 ULTIMATE.start_main_~i~0) .cse2) (and .cse0 .cse3 .cse1 .cse2 (= (select .cse4 (+ |ULTIMATE.start_main_~#a~0.offset| 4)) 0) (exists ((v_prenex_1 Int)) (and (= (+ v_prenex_1 (* v_prenex_1 v_prenex_1)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0.base|) (+ |ULTIMATE.start_main_~#a~0.offset| (* v_prenex_1 4))) 1)) (<= 1 v_prenex_1))) (<= ULTIMATE.start_main_~S~0 2)) (and .cse3 (<= ULTIMATE.start_main_~S~0 0))))) [2020-10-25 19:23:12,138 INFO L274 CegarLoopResult]: For program point L20-4(lines 20 21) no Hoare annotation was computed. [2020-10-25 19:23:12,139 INFO L274 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-10-25 19:23:12,140 INFO L274 CegarLoopResult]: For program point L8-1(line 8) no Hoare annotation was computed. [2020-10-25 19:23:12,140 INFO L274 CegarLoopResult]: For program point L8-3(line 8) no Hoare annotation was computed. [2020-10-25 19:23:12,141 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-10-25 19:23:12,141 INFO L277 CegarLoopResult]: At program point L25(lines 10 26) the Hoare annotation is: true [2020-10-25 19:23:12,141 INFO L274 CegarLoopResult]: For program point L17-2(lines 17 18) no Hoare annotation was computed. [2020-10-25 19:23:12,141 INFO L270 CegarLoopResult]: At program point L17-3(lines 17 18) the Hoare annotation is: (let ((.cse0 (< 1 ULTIMATE.start_main_~S~0)) (.cse1 (= ULTIMATE.start_assume_abort_if_not_~cond 1))) (or (and (= ULTIMATE.start_main_~i~0 0) .cse0 .cse1) (and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0.base|) |ULTIMATE.start_main_~#a~0.offset|) 1) 0) .cse0 (<= ULTIMATE.start_main_~i~0 1) (<= 1 ULTIMATE.start_main_~i~0) .cse1))) [2020-10-25 19:23:12,141 INFO L274 CegarLoopResult]: For program point L17-4(lines 17 18) no Hoare annotation was computed. [2020-10-25 19:23:12,142 INFO L274 CegarLoopResult]: For program point L5(lines 5 7) no Hoare annotation was computed. [2020-10-25 19:23:12,142 INFO L274 CegarLoopResult]: For program point L6(line 6) no Hoare annotation was computed. [2020-10-25 19:23:12,151 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-10-25 19:23:12,152 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-10-25 19:23:12,152 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-10-25 19:23:12,152 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-10-25 19:23:12,152 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-10-25 19:23:12,154 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,155 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,155 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,156 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,162 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-10-25 19:23:12,162 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-10-25 19:23:12,163 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-10-25 19:23:12,163 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-10-25 19:23:12,163 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-10-25 19:23:12,164 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,164 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,165 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,165 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,166 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,167 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,169 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,170 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,170 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,170 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,171 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,171 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,171 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,172 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,173 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,174 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,174 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,174 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,175 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,175 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,175 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,176 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 07:23:12 BoogieIcfgContainer [2020-10-25 19:23:12,178 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-25 19:23:12,179 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-25 19:23:12,179 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-25 19:23:12,179 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-25 19:23:12,180 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 07:22:49" (3/4) ... [2020-10-25 19:23:12,184 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-10-25 19:23:12,196 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2020-10-25 19:23:12,196 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-10-25 19:23:12,196 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-25 19:23:12,197 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-25 19:23:12,221 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((unknown-#memory_int-unknown[a][a] + 1 == 0 && 1 < S) && 1 <= i) && cond == 1) || ((((((unknown-#memory_int-unknown[a][a] + 1 == 0 && i == 0) && 1 < S) && cond == 1) && unknown-#memory_int-unknown[a][a + 4] == 0) && (\exists v_prenex_1 : int :: v_prenex_1 + v_prenex_1 * v_prenex_1 == unknown-#memory_int-unknown[a][a + v_prenex_1 * 4] + 1 && 1 <= v_prenex_1)) && S <= 2)) || (i == 0 && S <= 0) [2020-10-25 19:23:12,243 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-25 19:23:12,243 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-25 19:23:12,245 INFO L168 Benchmark]: Toolchain (without parser) took 23466.30 ms. Allocated memory was 46.1 MB in the beginning and 83.9 MB in the end (delta: 37.7 MB). Free memory was 23.1 MB in the beginning and 65.5 MB in the end (delta: -42.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 16.1 GB. [2020-10-25 19:23:12,245 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 46.1 MB. Free memory is still 28.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 19:23:12,246 INFO L168 Benchmark]: CACSL2BoogieTranslator took 370.88 ms. Allocated memory is still 46.1 MB. Free memory was 31.8 MB in the beginning and 22.3 MB in the end (delta: 9.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-10-25 19:23:12,247 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.53 ms. Allocated memory is still 46.1 MB. Free memory was 22.3 MB in the beginning and 20.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-25 19:23:12,247 INFO L168 Benchmark]: Boogie Preprocessor took 28.21 ms. Allocated memory is still 46.1 MB. Free memory was 20.7 MB in the beginning and 19.7 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 19:23:12,248 INFO L168 Benchmark]: RCFGBuilder took 457.67 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 19.6 MB in the beginning and 28.7 MB in the end (delta: -9.2 MB). Peak memory consumption was 4.9 MB. Max. memory is 16.1 GB. [2020-10-25 19:23:12,249 INFO L168 Benchmark]: TraceAbstraction took 22467.45 ms. Allocated memory was 56.6 MB in the beginning and 83.9 MB in the end (delta: 27.3 MB). Free memory was 28.2 MB in the beginning and 20.8 MB in the end (delta: 7.3 MB). Peak memory consumption was 38.2 MB. Max. memory is 16.1 GB. [2020-10-25 19:23:12,249 INFO L168 Benchmark]: Witness Printer took 64.46 ms. Allocated memory is still 83.9 MB. Free memory was 20.8 MB in the beginning and 65.5 MB in the end (delta: -44.7 MB). Peak memory consumption was 4.5 MB. Max. memory is 16.1 GB. [2020-10-25 19:23:12,253 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 46.1 MB. Free memory is still 28.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 370.88 ms. Allocated memory is still 46.1 MB. Free memory was 31.8 MB in the beginning and 22.3 MB in the end (delta: 9.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 43.53 ms. Allocated memory is still 46.1 MB. Free memory was 22.3 MB in the beginning and 20.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 28.21 ms. Allocated memory is still 46.1 MB. Free memory was 20.7 MB in the beginning and 19.7 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 457.67 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 19.6 MB in the beginning and 28.7 MB in the end (delta: -9.2 MB). Peak memory consumption was 4.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 22467.45 ms. Allocated memory was 56.6 MB in the beginning and 83.9 MB in the end (delta: 27.3 MB). Free memory was 28.2 MB in the beginning and 20.8 MB in the end (delta: 7.3 MB). Peak memory consumption was 38.2 MB. Max. memory is 16.1 GB. * Witness Printer took 64.46 ms. Allocated memory is still 83.9 MB. Free memory was 20.8 MB in the beginning and 65.5 MB in the end (delta: -44.7 MB). Peak memory consumption was 4.5 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant [2020-10-25 19:23:12,268 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-10-25 19:23:12,269 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-10-25 19:23:12,269 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-10-25 19:23:12,269 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-10-25 19:23:12,270 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-10-25 19:23:12,270 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,270 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,271 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,271 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,272 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-10-25 19:23:12,272 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-10-25 19:23:12,272 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-10-25 19:23:12,272 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-10-25 19:23:12,273 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2020-10-25 19:23:12,273 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,273 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,273 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,274 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((unknown-#memory_int-unknown[a][a] + 1 == 0 && 1 < S) && 1 <= i) && cond == 1) || ((((((unknown-#memory_int-unknown[a][a] + 1 == 0 && i == 0) && 1 < S) && cond == 1) && unknown-#memory_int-unknown[a][a + 4] == 0) && (\exists v_prenex_1 : int :: v_prenex_1 + v_prenex_1 * v_prenex_1 == unknown-#memory_int-unknown[a][a + v_prenex_1 * 4] + 1 && 1 <= v_prenex_1)) && S <= 2)) || (i == 0 && S <= 0) - InvariantResult [Line: 17]: Loop Invariant [2020-10-25 19:23:12,274 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,275 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((i == 0 && 1 < S) && cond == 1) || ((((unknown-#memory_int-unknown[a][a] + 1 == 0 && 1 < S) && i <= 1) && 1 <= i) && cond == 1) - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 23]: Loop Invariant [2020-10-25 19:23:12,276 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,276 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,276 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,277 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,277 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,277 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,277 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,277 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,279 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,279 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,279 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,279 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,279 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,280 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,280 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-25 19:23:12,280 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((((((i == 0 && 1 < S) && i * i + i == unknown-#memory_int-unknown[a][a + i * 4] + 1) && cond == 1) || (((((unknown-#memory_int-unknown[a][a] + 1 == 0 && i == 1) && 1 < S) && 1 <= i) && cond == 1) && unknown-#memory_int-unknown[a][a + 4] + 1 == 0)) && S <= 2) || ((((unknown-#memory_int-unknown[a][a] + 1 == 0 && 1 < S) && 1 <= i) && 0 <= cond) && cond == 1)) || (i <= 0 && ((((i == 0 && 1 < S) && i * i + i == unknown-#memory_int-unknown[a][a + i * 4] + 1) && cond == 1) || (((((unknown-#memory_int-unknown[a][a] + 1 == 0 && i == 1) && 1 < S) && 1 <= i) && cond == 1) && unknown-#memory_int-unknown[a][a + 4] + 1 == 0)))) || ((((((unknown-#memory_int-unknown[a][a] + 1 == 0 && 1 < S) && 2 <= i) && 1 <= i) && cond == 1) && i <= 2) && S <= 2)) || (i == 0 && S <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 21.1s, OverallIterations: 7, TraceHistogramMax: 3, AutomataDifference: 15.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 86 SDtfs, 281 SDslu, 180 SDs, 0 SdLazy, 586 SolverSat, 151 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 7.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 65 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 75 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 29 NumberOfFragments, 302 HoareAnnotationTreeSize, 4 FomulaSimplifications, 18405 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 4 FomulaSimplificationsInter, 3691 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 131 NumberOfCodeBlocks, 131 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 124 ConstructedInterpolants, 26 QuantifiedInterpolants, 42150 SizeOfPredicates, 36 NumberOfNonLiveVariables, 447 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 12/55 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...