./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/sum01-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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/loops/sum01-1.i -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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5cba8acfa381c990ec40e4bf9e5d202ee845a576 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 18:12:06,437 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 18:12:06,440 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 18:12:06,452 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 18:12:06,453 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 18:12:06,454 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 18:12:06,456 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 18:12:06,458 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 18:12:06,460 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 18:12:06,461 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 18:12:06,462 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 18:12:06,463 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 18:12:06,464 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 18:12:06,465 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 18:12:06,466 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 18:12:06,467 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 18:12:06,468 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 18:12:06,469 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 18:12:06,473 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 18:12:06,477 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 18:12:06,481 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 18:12:06,483 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 18:12:06,486 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 18:12:06,488 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 18:12:06,494 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 18:12:06,494 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 18:12:06,495 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 18:12:06,496 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 18:12:06,497 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 18:12:06,498 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 18:12:06,498 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 18:12:06,499 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 18:12:06,501 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 18:12:06,502 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 18:12:06,505 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 18:12:06,508 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 18:12:06,509 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 18:12:06,510 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 18:12:06,510 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 18:12:06,511 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 18:12:06,513 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 18:12:06,514 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 18:12:06,539 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 18:12:06,540 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 18:12:06,541 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 18:12:06,542 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 18:12:06,542 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 18:12:06,542 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 18:12:06,543 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 18:12:06,543 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 18:12:06,543 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 18:12:06,544 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 18:12:06,545 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 18:12:06,545 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 18:12:06,545 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 18:12:06,546 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 18:12:06,546 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 18:12:06,546 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 18:12:06,547 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 18:12:06,547 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 18:12:06,547 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 18:12:06,548 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 18:12:06,548 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 18:12:06,548 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:12:06,548 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 18:12:06,549 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 18:12:06,549 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 18:12:06,549 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 18:12:06,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 18:12:06,550 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 18:12:06,550 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 18:12:06,550 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(__VERIFIER_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 -> 5cba8acfa381c990ec40e4bf9e5d202ee845a576 [2020-07-28 18:12:06,877 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 18:12:06,890 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 18:12:06,894 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 18:12:06,896 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 18:12:06,896 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 18:12:06,897 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/sum01-1.i [2020-07-28 18:12:06,971 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5775b0e9/af5d7634487c4d84ab34279ec7a1a496/FLAG9bd6cedce [2020-07-28 18:12:07,472 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 18:12:07,473 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/sum01-1.i [2020-07-28 18:12:07,478 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5775b0e9/af5d7634487c4d84ab34279ec7a1a496/FLAG9bd6cedce [2020-07-28 18:12:07,840 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5775b0e9/af5d7634487c4d84ab34279ec7a1a496 [2020-07-28 18:12:07,843 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 18:12:07,846 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 18:12:07,847 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 18:12:07,847 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 18:12:07,850 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 18:12:07,852 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:12:07" (1/1) ... [2020-07-28 18:12:07,856 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29fd01e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:07, skipping insertion in model container [2020-07-28 18:12:07,857 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:12:07" (1/1) ... [2020-07-28 18:12:07,866 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 18:12:07,883 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 18:12:08,107 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:12:08,113 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 18:12:08,135 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:12:08,149 INFO L208 MainTranslator]: Completed translation [2020-07-28 18:12:08,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:08 WrapperNode [2020-07-28 18:12:08,150 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 18:12:08,150 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 18:12:08,151 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 18:12:08,151 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 18:12:08,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:08" (1/1) ... [2020-07-28 18:12:08,165 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:08" (1/1) ... [2020-07-28 18:12:08,240 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 18:12:08,240 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 18:12:08,241 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 18:12:08,241 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 18:12:08,250 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:08" (1/1) ... [2020-07-28 18:12:08,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:08" (1/1) ... [2020-07-28 18:12:08,251 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:08" (1/1) ... [2020-07-28 18:12:08,251 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:08" (1/1) ... [2020-07-28 18:12:08,254 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:08" (1/1) ... [2020-07-28 18:12:08,262 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:08" (1/1) ... [2020-07-28 18:12:08,263 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:08" (1/1) ... [2020-07-28 18:12:08,265 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 18:12:08,265 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 18:12:08,268 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 18:12:08,268 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 18:12:08,272 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:08" (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-07-28 18:12:08,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 18:12:08,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 18:12:08,536 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 18:12:08,536 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-28 18:12:08,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:12:08 BoogieIcfgContainer [2020-07-28 18:12:08,540 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 18:12:08,541 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 18:12:08,541 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 18:12:08,545 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 18:12:08,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 06:12:07" (1/3) ... [2020-07-28 18:12:08,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11837c0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:12:08, skipping insertion in model container [2020-07-28 18:12:08,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:08" (2/3) ... [2020-07-28 18:12:08,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11837c0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:12:08, skipping insertion in model container [2020-07-28 18:12:08,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:12:08" (3/3) ... [2020-07-28 18:12:08,549 INFO L109 eAbstractionObserver]: Analyzing ICFG sum01-1.i [2020-07-28 18:12:08,562 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 18:12:08,573 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 18:12:08,590 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 18:12:08,618 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 18:12:08,618 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 18:12:08,619 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 18:12:08,619 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 18:12:08,619 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 18:12:08,619 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 18:12:08,619 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 18:12:08,620 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 18:12:08,638 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2020-07-28 18:12:08,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-28 18:12:08,649 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:08,653 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-28 18:12:08,654 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:08,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:08,668 INFO L82 PathProgramCache]: Analyzing trace with hash 30108868, now seen corresponding path program 1 times [2020-07-28 18:12:08,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:08,687 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636998023] [2020-07-28 18:12:08,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:08,823 INFO L280 TraceCheckUtils]: 0: Hoare triple {14#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~i~0, main_~n~0, main_~sn~0;havoc main_~i~0;main_~n~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;main_~sn~0 := 0;main_~i~0 := 1; {14#true} is VALID [2020-07-28 18:12:08,824 INFO L280 TraceCheckUtils]: 1: Hoare triple {14#true} assume !true; {15#false} is VALID [2020-07-28 18:12:08,825 INFO L280 TraceCheckUtils]: 2: Hoare triple {15#false} __VERIFIER_assert_#in~cond := (if main_~sn~0 == 2 * main_~n~0 || 0 == main_~sn~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {15#false} is VALID [2020-07-28 18:12:08,825 INFO L280 TraceCheckUtils]: 3: Hoare triple {15#false} assume 0 == __VERIFIER_assert_~cond; {15#false} is VALID [2020-07-28 18:12:08,826 INFO L280 TraceCheckUtils]: 4: Hoare triple {15#false} assume !false; {15#false} is VALID [2020-07-28 18:12:08,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:08,828 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636998023] [2020-07-28 18:12:08,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:12:08,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 18:12:08,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741302733] [2020-07-28 18:12:08,836 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2020-07-28 18:12:08,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:12:08,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 18:12:08,864 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:08,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 18:12:08,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:12:08,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 18:12:08,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 18:12:08,878 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 2 states. [2020-07-28 18:12:08,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:08,918 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2020-07-28 18:12:08,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 18:12:08,919 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2020-07-28 18:12:08,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:12:08,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 18:12:08,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 21 transitions. [2020-07-28 18:12:08,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 18:12:08,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 21 transitions. [2020-07-28 18:12:08,928 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 21 transitions. [2020-07-28 18:12:08,983 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:08,993 INFO L225 Difference]: With dead ends: 18 [2020-07-28 18:12:08,993 INFO L226 Difference]: Without dead ends: 8 [2020-07-28 18:12:08,996 INFO L675 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-07-28 18:12:09,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2020-07-28 18:12:09,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-07-28 18:12:09,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:12:09,023 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 8 states. [2020-07-28 18:12:09,023 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2020-07-28 18:12:09,023 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2020-07-28 18:12:09,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:09,026 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2020-07-28 18:12:09,026 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2020-07-28 18:12:09,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:09,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:09,027 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2020-07-28 18:12:09,027 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2020-07-28 18:12:09,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:09,028 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2020-07-28 18:12:09,029 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2020-07-28 18:12:09,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:09,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:09,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:12:09,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:12:09,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 18:12:09,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2020-07-28 18:12:09,032 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2020-07-28 18:12:09,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:12:09,033 INFO L479 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2020-07-28 18:12:09,033 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 18:12:09,033 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2020-07-28 18:12:09,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-28 18:12:09,033 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:09,034 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-28 18:12:09,034 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 18:12:09,034 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:09,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:09,035 INFO L82 PathProgramCache]: Analyzing trace with hash 29781167, now seen corresponding path program 1 times [2020-07-28 18:12:09,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:09,035 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748509495] [2020-07-28 18:12:09,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:09,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:09,129 INFO L280 TraceCheckUtils]: 0: Hoare triple {64#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~i~0, main_~n~0, main_~sn~0;havoc main_~i~0;main_~n~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;main_~sn~0 := 0;main_~i~0 := 1; {66#(= 0 ULTIMATE.start_main_~sn~0)} is VALID [2020-07-28 18:12:09,133 INFO L280 TraceCheckUtils]: 1: Hoare triple {66#(= 0 ULTIMATE.start_main_~sn~0)} assume !(main_~i~0 <= main_~n~0); {66#(= 0 ULTIMATE.start_main_~sn~0)} is VALID [2020-07-28 18:12:09,134 INFO L280 TraceCheckUtils]: 2: Hoare triple {66#(= 0 ULTIMATE.start_main_~sn~0)} __VERIFIER_assert_#in~cond := (if main_~sn~0 == 2 * main_~n~0 || 0 == main_~sn~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {67#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2020-07-28 18:12:09,135 INFO L280 TraceCheckUtils]: 3: Hoare triple {67#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {65#false} is VALID [2020-07-28 18:12:09,136 INFO L280 TraceCheckUtils]: 4: Hoare triple {65#false} assume !false; {65#false} is VALID [2020-07-28 18:12:09,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:09,137 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748509495] [2020-07-28 18:12:09,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:12:09,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-28 18:12:09,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105032873] [2020-07-28 18:12:09,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-07-28 18:12:09,139 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:12:09,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 18:12:09,154 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:09,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 18:12:09,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:12:09,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 18:12:09,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-28 18:12:09,155 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 4 states. [2020-07-28 18:12:09,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:09,217 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2020-07-28 18:12:09,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 18:12:09,217 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-07-28 18:12:09,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:12:09,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:12:09,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2020-07-28 18:12:09,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:12:09,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2020-07-28 18:12:09,221 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 17 transitions. [2020-07-28 18:12:09,249 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:09,250 INFO L225 Difference]: With dead ends: 15 [2020-07-28 18:12:09,250 INFO L226 Difference]: Without dead ends: 11 [2020-07-28 18:12:09,252 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-07-28 18:12:09,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-07-28 18:12:09,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-07-28 18:12:09,257 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:12:09,257 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand 11 states. [2020-07-28 18:12:09,257 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2020-07-28 18:12:09,258 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2020-07-28 18:12:09,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:09,259 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2020-07-28 18:12:09,260 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2020-07-28 18:12:09,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:09,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:09,261 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2020-07-28 18:12:09,261 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2020-07-28 18:12:09,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:09,263 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2020-07-28 18:12:09,263 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2020-07-28 18:12:09,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:09,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:09,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:12:09,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:12:09,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-28 18:12:09,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2020-07-28 18:12:09,265 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 5 [2020-07-28 18:12:09,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:12:09,266 INFO L479 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2020-07-28 18:12:09,266 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 18:12:09,266 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2020-07-28 18:12:09,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-28 18:12:09,267 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:09,267 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:12:09,267 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 18:12:09,268 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:09,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:09,268 INFO L82 PathProgramCache]: Analyzing trace with hash -308490948, now seen corresponding path program 1 times [2020-07-28 18:12:09,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:09,269 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295342967] [2020-07-28 18:12:09,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:09,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:09,585 INFO L280 TraceCheckUtils]: 0: Hoare triple {124#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~i~0, main_~n~0, main_~sn~0;havoc main_~i~0;main_~n~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;main_~sn~0 := 0;main_~i~0 := 1; {126#(and (<= (+ ULTIMATE.start_main_~sn~0 2) (* 2 ULTIMATE.start_main_~i~0)) (<= (* 2 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_main_~sn~0 2)))} is VALID [2020-07-28 18:12:09,587 INFO L280 TraceCheckUtils]: 1: Hoare triple {126#(and (<= (+ ULTIMATE.start_main_~sn~0 2) (* 2 ULTIMATE.start_main_~i~0)) (<= (* 2 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_main_~sn~0 2)))} assume !!(main_~i~0 <= main_~n~0); {127#(and (<= (* 2 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_main_~sn~0 2)) (<= (+ ULTIMATE.start_main_~sn~0 2) (* 2 ULTIMATE.start_main_~n~0)))} is VALID [2020-07-28 18:12:09,589 INFO L280 TraceCheckUtils]: 2: Hoare triple {127#(and (<= (* 2 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_main_~sn~0 2)) (<= (+ ULTIMATE.start_main_~sn~0 2) (* 2 ULTIMATE.start_main_~n~0)))} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {128#(and (or (<= (* 2 ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~sn~0) (<= (* 2 ULTIMATE.start_main_~n~0) ULTIMATE.start_main_~sn~0)) (<= ULTIMATE.start_main_~sn~0 (* 2 ULTIMATE.start_main_~n~0)))} is VALID [2020-07-28 18:12:09,591 INFO L280 TraceCheckUtils]: 3: Hoare triple {128#(and (or (<= (* 2 ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~sn~0) (<= (* 2 ULTIMATE.start_main_~n~0) ULTIMATE.start_main_~sn~0)) (<= ULTIMATE.start_main_~sn~0 (* 2 ULTIMATE.start_main_~n~0)))} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {129#(and (or (<= (* 2 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_main_~sn~0 2)) (<= (* 2 ULTIMATE.start_main_~n~0) ULTIMATE.start_main_~sn~0)) (<= ULTIMATE.start_main_~sn~0 (* 2 ULTIMATE.start_main_~n~0)))} is VALID [2020-07-28 18:12:09,592 INFO L280 TraceCheckUtils]: 4: Hoare triple {129#(and (or (<= (* 2 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_main_~sn~0 2)) (<= (* 2 ULTIMATE.start_main_~n~0) ULTIMATE.start_main_~sn~0)) (<= ULTIMATE.start_main_~sn~0 (* 2 ULTIMATE.start_main_~n~0)))} assume !(main_~i~0 <= main_~n~0); {130#(and (<= (* 2 ULTIMATE.start_main_~n~0) ULTIMATE.start_main_~sn~0) (<= ULTIMATE.start_main_~sn~0 (* 2 ULTIMATE.start_main_~n~0)))} is VALID [2020-07-28 18:12:09,594 INFO L280 TraceCheckUtils]: 5: Hoare triple {130#(and (<= (* 2 ULTIMATE.start_main_~n~0) ULTIMATE.start_main_~sn~0) (<= ULTIMATE.start_main_~sn~0 (* 2 ULTIMATE.start_main_~n~0)))} __VERIFIER_assert_#in~cond := (if main_~sn~0 == 2 * main_~n~0 || 0 == main_~sn~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {131#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2020-07-28 18:12:09,595 INFO L280 TraceCheckUtils]: 6: Hoare triple {131#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {125#false} is VALID [2020-07-28 18:12:09,595 INFO L280 TraceCheckUtils]: 7: Hoare triple {125#false} assume !false; {125#false} is VALID [2020-07-28 18:12:09,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:09,597 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295342967] [2020-07-28 18:12:09,597 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188221309] [2020-07-28 18:12:09,598 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-07-28 18:12:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:09,628 WARN L261 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-28 18:12:09,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:09,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:12:09,964 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 18:12:09,998 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-28 18:12:10,058 INFO L280 TraceCheckUtils]: 0: Hoare triple {124#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~i~0, main_~n~0, main_~sn~0;havoc main_~i~0;main_~n~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;main_~sn~0 := 0;main_~i~0 := 1; {135#(and (= 1 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~sn~0))} is VALID [2020-07-28 18:12:10,059 INFO L280 TraceCheckUtils]: 1: Hoare triple {135#(and (= 1 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~sn~0))} assume !!(main_~i~0 <= main_~n~0); {139#(and (= 1 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0) (= 0 ULTIMATE.start_main_~sn~0))} is VALID [2020-07-28 18:12:10,061 INFO L280 TraceCheckUtils]: 2: Hoare triple {139#(and (= 1 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0) (= 0 ULTIMATE.start_main_~sn~0))} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {143#(and (= ULTIMATE.start_main_~sn~0 2) (= 1 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0))} is VALID [2020-07-28 18:12:10,062 INFO L280 TraceCheckUtils]: 3: Hoare triple {143#(and (= ULTIMATE.start_main_~sn~0 2) (= 1 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0))} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {147#(and (<= 1 ULTIMATE.start_main_~n~0) (<= ULTIMATE.start_main_~i~0 2) (= ULTIMATE.start_main_~sn~0 2))} is VALID [2020-07-28 18:12:10,063 INFO L280 TraceCheckUtils]: 4: Hoare triple {147#(and (<= 1 ULTIMATE.start_main_~n~0) (<= ULTIMATE.start_main_~i~0 2) (= ULTIMATE.start_main_~sn~0 2))} assume !(main_~i~0 <= main_~n~0); {151#(and (<= 1 ULTIMATE.start_main_~n~0) (= ULTIMATE.start_main_~sn~0 2) (<= ULTIMATE.start_main_~n~0 1))} is VALID [2020-07-28 18:12:10,065 INFO L280 TraceCheckUtils]: 5: Hoare triple {151#(and (<= 1 ULTIMATE.start_main_~n~0) (= ULTIMATE.start_main_~sn~0 2) (<= ULTIMATE.start_main_~n~0 1))} __VERIFIER_assert_#in~cond := (if main_~sn~0 == 2 * main_~n~0 || 0 == main_~sn~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {155#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2020-07-28 18:12:10,066 INFO L280 TraceCheckUtils]: 6: Hoare triple {155#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {125#false} is VALID [2020-07-28 18:12:10,066 INFO L280 TraceCheckUtils]: 7: Hoare triple {125#false} assume !false; {125#false} is VALID [2020-07-28 18:12:10,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:10,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:12:10,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2020-07-28 18:12:10,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412453818] [2020-07-28 18:12:10,069 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2020-07-28 18:12:10,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:12:10,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-28 18:12:10,094 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:10,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-28 18:12:10,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:12:10,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-28 18:12:10,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2020-07-28 18:12:10,095 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 14 states. [2020-07-28 18:12:10,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:10,533 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2020-07-28 18:12:10,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-28 18:12:10,533 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2020-07-28 18:12:10,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:12:10,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-28 18:12:10,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 35 transitions. [2020-07-28 18:12:10,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-28 18:12:10,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 35 transitions. [2020-07-28 18:12:10,538 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 35 transitions. [2020-07-28 18:12:10,589 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:10,591 INFO L225 Difference]: With dead ends: 31 [2020-07-28 18:12:10,591 INFO L226 Difference]: Without dead ends: 17 [2020-07-28 18:12:10,592 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2020-07-28 18:12:10,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-07-28 18:12:10,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2020-07-28 18:12:10,600 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:12:10,600 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 15 states. [2020-07-28 18:12:10,600 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 15 states. [2020-07-28 18:12:10,601 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 15 states. [2020-07-28 18:12:10,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:10,602 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2020-07-28 18:12:10,602 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2020-07-28 18:12:10,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:10,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:10,603 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 17 states. [2020-07-28 18:12:10,603 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 17 states. [2020-07-28 18:12:10,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:10,605 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2020-07-28 18:12:10,605 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2020-07-28 18:12:10,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:10,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:10,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:12:10,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:12:10,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-28 18:12:10,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2020-07-28 18:12:10,608 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 8 [2020-07-28 18:12:10,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:12:10,608 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-07-28 18:12:10,608 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-28 18:12:10,609 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2020-07-28 18:12:10,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-28 18:12:10,609 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:10,610 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1] [2020-07-28 18:12:10,824 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-28 18:12:10,824 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:10,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:10,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1111984220, now seen corresponding path program 2 times [2020-07-28 18:12:10,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:10,827 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427782302] [2020-07-28 18:12:10,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:10,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:11,103 INFO L280 TraceCheckUtils]: 0: Hoare triple {261#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~i~0, main_~n~0, main_~sn~0;havoc main_~i~0;main_~n~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;main_~sn~0 := 0;main_~i~0 := 1; {263#(and (<= (+ ULTIMATE.start_main_~sn~0 2) (* 2 ULTIMATE.start_main_~i~0)) (<= (* 2 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_main_~sn~0 2)))} is VALID [2020-07-28 18:12:11,104 INFO L280 TraceCheckUtils]: 1: Hoare triple {263#(and (<= (+ ULTIMATE.start_main_~sn~0 2) (* 2 ULTIMATE.start_main_~i~0)) (<= (* 2 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_main_~sn~0 2)))} assume !!(main_~i~0 <= main_~n~0); {263#(and (<= (+ ULTIMATE.start_main_~sn~0 2) (* 2 ULTIMATE.start_main_~i~0)) (<= (* 2 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_main_~sn~0 2)))} is VALID [2020-07-28 18:12:11,105 INFO L280 TraceCheckUtils]: 2: Hoare triple {263#(and (<= (+ ULTIMATE.start_main_~sn~0 2) (* 2 ULTIMATE.start_main_~i~0)) (<= (* 2 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_main_~sn~0 2)))} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {264#(and (<= (* 2 ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~sn~0) (<= ULTIMATE.start_main_~sn~0 (* 2 ULTIMATE.start_main_~i~0)))} is VALID [2020-07-28 18:12:11,107 INFO L280 TraceCheckUtils]: 3: Hoare triple {264#(and (<= (* 2 ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~sn~0) (<= ULTIMATE.start_main_~sn~0 (* 2 ULTIMATE.start_main_~i~0)))} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {263#(and (<= (+ ULTIMATE.start_main_~sn~0 2) (* 2 ULTIMATE.start_main_~i~0)) (<= (* 2 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_main_~sn~0 2)))} is VALID [2020-07-28 18:12:11,107 INFO L280 TraceCheckUtils]: 4: Hoare triple {263#(and (<= (+ ULTIMATE.start_main_~sn~0 2) (* 2 ULTIMATE.start_main_~i~0)) (<= (* 2 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_main_~sn~0 2)))} assume !!(main_~i~0 <= main_~n~0); {263#(and (<= (+ ULTIMATE.start_main_~sn~0 2) (* 2 ULTIMATE.start_main_~i~0)) (<= (* 2 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_main_~sn~0 2)))} is VALID [2020-07-28 18:12:11,109 INFO L280 TraceCheckUtils]: 5: Hoare triple {263#(and (<= (+ ULTIMATE.start_main_~sn~0 2) (* 2 ULTIMATE.start_main_~i~0)) (<= (* 2 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_main_~sn~0 2)))} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {264#(and (<= (* 2 ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~sn~0) (<= ULTIMATE.start_main_~sn~0 (* 2 ULTIMATE.start_main_~i~0)))} is VALID [2020-07-28 18:12:11,110 INFO L280 TraceCheckUtils]: 6: Hoare triple {264#(and (<= (* 2 ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~sn~0) (<= ULTIMATE.start_main_~sn~0 (* 2 ULTIMATE.start_main_~i~0)))} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {263#(and (<= (+ ULTIMATE.start_main_~sn~0 2) (* 2 ULTIMATE.start_main_~i~0)) (<= (* 2 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_main_~sn~0 2)))} is VALID [2020-07-28 18:12:11,111 INFO L280 TraceCheckUtils]: 7: Hoare triple {263#(and (<= (+ ULTIMATE.start_main_~sn~0 2) (* 2 ULTIMATE.start_main_~i~0)) (<= (* 2 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_main_~sn~0 2)))} assume !!(main_~i~0 <= main_~n~0); {265#(and (<= (* 2 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_main_~sn~0 2)) (<= (+ ULTIMATE.start_main_~sn~0 2) (* 2 ULTIMATE.start_main_~n~0)))} is VALID [2020-07-28 18:12:11,112 INFO L280 TraceCheckUtils]: 8: Hoare triple {265#(and (<= (* 2 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_main_~sn~0 2)) (<= (+ ULTIMATE.start_main_~sn~0 2) (* 2 ULTIMATE.start_main_~n~0)))} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {266#(and (or (<= (* 2 ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~sn~0) (<= (* 2 ULTIMATE.start_main_~n~0) ULTIMATE.start_main_~sn~0)) (<= ULTIMATE.start_main_~sn~0 (* 2 ULTIMATE.start_main_~n~0)))} is VALID [2020-07-28 18:12:11,114 INFO L280 TraceCheckUtils]: 9: Hoare triple {266#(and (or (<= (* 2 ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~sn~0) (<= (* 2 ULTIMATE.start_main_~n~0) ULTIMATE.start_main_~sn~0)) (<= ULTIMATE.start_main_~sn~0 (* 2 ULTIMATE.start_main_~n~0)))} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {267#(and (or (<= (* 2 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_main_~sn~0 2)) (<= (* 2 ULTIMATE.start_main_~n~0) ULTIMATE.start_main_~sn~0)) (<= ULTIMATE.start_main_~sn~0 (* 2 ULTIMATE.start_main_~n~0)))} is VALID [2020-07-28 18:12:11,115 INFO L280 TraceCheckUtils]: 10: Hoare triple {267#(and (or (<= (* 2 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_main_~sn~0 2)) (<= (* 2 ULTIMATE.start_main_~n~0) ULTIMATE.start_main_~sn~0)) (<= ULTIMATE.start_main_~sn~0 (* 2 ULTIMATE.start_main_~n~0)))} assume !(main_~i~0 <= main_~n~0); {268#(and (<= (* 2 ULTIMATE.start_main_~n~0) ULTIMATE.start_main_~sn~0) (<= ULTIMATE.start_main_~sn~0 (* 2 ULTIMATE.start_main_~n~0)))} is VALID [2020-07-28 18:12:11,116 INFO L280 TraceCheckUtils]: 11: Hoare triple {268#(and (<= (* 2 ULTIMATE.start_main_~n~0) ULTIMATE.start_main_~sn~0) (<= ULTIMATE.start_main_~sn~0 (* 2 ULTIMATE.start_main_~n~0)))} __VERIFIER_assert_#in~cond := (if main_~sn~0 == 2 * main_~n~0 || 0 == main_~sn~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {269#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2020-07-28 18:12:11,117 INFO L280 TraceCheckUtils]: 12: Hoare triple {269#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {262#false} is VALID [2020-07-28 18:12:11,117 INFO L280 TraceCheckUtils]: 13: Hoare triple {262#false} assume !false; {262#false} is VALID [2020-07-28 18:12:11,119 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-28 18:12:11,119 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427782302] [2020-07-28 18:12:11,119 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871266465] [2020-07-28 18:12:11,119 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) [2020-07-28 18:12:11,144 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-28 18:12:11,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 18:12:11,145 WARN L261 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 20 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:11,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:11,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:12:11,544 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 18:12:11,571 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-28 18:12:11,627 INFO L280 TraceCheckUtils]: 0: Hoare triple {261#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~i~0, main_~n~0, main_~sn~0;havoc main_~i~0;main_~n~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;main_~sn~0 := 0;main_~i~0 := 1; {273#(and (= 1 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~sn~0))} is VALID [2020-07-28 18:12:11,628 INFO L280 TraceCheckUtils]: 1: Hoare triple {273#(and (= 1 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~sn~0))} assume !!(main_~i~0 <= main_~n~0); {273#(and (= 1 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~sn~0))} is VALID [2020-07-28 18:12:11,629 INFO L280 TraceCheckUtils]: 2: Hoare triple {273#(and (= 1 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~sn~0))} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {280#(and (= ULTIMATE.start_main_~sn~0 2) (= 1 ULTIMATE.start_main_~i~0))} is VALID [2020-07-28 18:12:11,630 INFO L280 TraceCheckUtils]: 3: Hoare triple {280#(and (= ULTIMATE.start_main_~sn~0 2) (= 1 ULTIMATE.start_main_~i~0))} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {284#(and (= 2 ULTIMATE.start_main_~i~0) (= ULTIMATE.start_main_~sn~0 2))} is VALID [2020-07-28 18:12:11,631 INFO L280 TraceCheckUtils]: 4: Hoare triple {284#(and (= 2 ULTIMATE.start_main_~i~0) (= ULTIMATE.start_main_~sn~0 2))} assume !!(main_~i~0 <= main_~n~0); {284#(and (= 2 ULTIMATE.start_main_~i~0) (= ULTIMATE.start_main_~sn~0 2))} is VALID [2020-07-28 18:12:11,632 INFO L280 TraceCheckUtils]: 5: Hoare triple {284#(and (= 2 ULTIMATE.start_main_~i~0) (= ULTIMATE.start_main_~sn~0 2))} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {291#(and (= 2 ULTIMATE.start_main_~i~0) (= 4 ULTIMATE.start_main_~sn~0))} is VALID [2020-07-28 18:12:11,633 INFO L280 TraceCheckUtils]: 6: Hoare triple {291#(and (= 2 ULTIMATE.start_main_~i~0) (= 4 ULTIMATE.start_main_~sn~0))} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {295#(and (= 4 ULTIMATE.start_main_~sn~0) (= 3 ULTIMATE.start_main_~i~0))} is VALID [2020-07-28 18:12:11,633 INFO L280 TraceCheckUtils]: 7: Hoare triple {295#(and (= 4 ULTIMATE.start_main_~sn~0) (= 3 ULTIMATE.start_main_~i~0))} assume !!(main_~i~0 <= main_~n~0); {299#(and (<= ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0) (= 4 ULTIMATE.start_main_~sn~0) (= 3 ULTIMATE.start_main_~i~0))} is VALID [2020-07-28 18:12:11,634 INFO L280 TraceCheckUtils]: 8: Hoare triple {299#(and (<= ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0) (= 4 ULTIMATE.start_main_~sn~0) (= 3 ULTIMATE.start_main_~i~0))} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {303#(and (= ULTIMATE.start_main_~sn~0 6) (<= ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0) (= 3 ULTIMATE.start_main_~i~0))} is VALID [2020-07-28 18:12:11,635 INFO L280 TraceCheckUtils]: 9: Hoare triple {303#(and (= ULTIMATE.start_main_~sn~0 6) (<= ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0) (= 3 ULTIMATE.start_main_~i~0))} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {307#(and (<= ULTIMATE.start_main_~i~0 4) (= ULTIMATE.start_main_~sn~0 6) (<= 3 ULTIMATE.start_main_~n~0))} is VALID [2020-07-28 18:12:11,636 INFO L280 TraceCheckUtils]: 10: Hoare triple {307#(and (<= ULTIMATE.start_main_~i~0 4) (= ULTIMATE.start_main_~sn~0 6) (<= 3 ULTIMATE.start_main_~n~0))} assume !(main_~i~0 <= main_~n~0); {311#(and (= ULTIMATE.start_main_~sn~0 6) (<= 3 ULTIMATE.start_main_~n~0) (<= ULTIMATE.start_main_~n~0 3))} is VALID [2020-07-28 18:12:11,637 INFO L280 TraceCheckUtils]: 11: Hoare triple {311#(and (= ULTIMATE.start_main_~sn~0 6) (<= 3 ULTIMATE.start_main_~n~0) (<= ULTIMATE.start_main_~n~0 3))} __VERIFIER_assert_#in~cond := (if main_~sn~0 == 2 * main_~n~0 || 0 == main_~sn~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {315#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2020-07-28 18:12:11,640 INFO L280 TraceCheckUtils]: 12: Hoare triple {315#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {262#false} is VALID [2020-07-28 18:12:11,640 INFO L280 TraceCheckUtils]: 13: Hoare triple {262#false} assume !false; {262#false} is VALID [2020-07-28 18:12:11,642 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:11,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:12:11,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 18 [2020-07-28 18:12:11,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145816560] [2020-07-28 18:12:11,643 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 14 [2020-07-28 18:12:11,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:12:11,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2020-07-28 18:12:11,674 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:11,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-28 18:12:11,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:12:11,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-28 18:12:11,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2020-07-28 18:12:11,675 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 19 states. [2020-07-28 18:12:12,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:12,569 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2020-07-28 18:12:12,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-28 18:12:12,569 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 14 [2020-07-28 18:12:12,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:12:12,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-28 18:12:12,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 41 transitions. [2020-07-28 18:12:12,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-28 18:12:12,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 41 transitions. [2020-07-28 18:12:12,575 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 41 transitions. [2020-07-28 18:12:12,648 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:12,649 INFO L225 Difference]: With dead ends: 34 [2020-07-28 18:12:12,649 INFO L226 Difference]: Without dead ends: 23 [2020-07-28 18:12:12,652 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=177, Invalid=945, Unknown=0, NotChecked=0, Total=1122 [2020-07-28 18:12:12,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-28 18:12:12,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-07-28 18:12:12,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:12:12,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 22 states. [2020-07-28 18:12:12,668 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 22 states. [2020-07-28 18:12:12,668 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 22 states. [2020-07-28 18:12:12,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:12,671 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-07-28 18:12:12,672 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-28 18:12:12,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:12,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:12,673 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 23 states. [2020-07-28 18:12:12,673 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 23 states. [2020-07-28 18:12:12,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:12,675 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-07-28 18:12:12,675 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-28 18:12:12,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:12,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:12,676 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:12:12,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:12:12,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-28 18:12:12,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2020-07-28 18:12:12,680 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 14 [2020-07-28 18:12:12,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:12:12,680 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2020-07-28 18:12:12,680 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-28 18:12:12,681 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2020-07-28 18:12:12,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-28 18:12:12,681 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:12,681 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1] [2020-07-28 18:12:12,892 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:12,893 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:12,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:12,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1125442374, now seen corresponding path program 1 times [2020-07-28 18:12:12,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:12,895 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461838723] [2020-07-28 18:12:12,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:12,990 INFO L280 TraceCheckUtils]: 0: Hoare triple {466#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~i~0, main_~n~0, main_~sn~0;havoc main_~i~0;main_~n~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;main_~sn~0 := 0;main_~i~0 := 1; {468#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:12,995 INFO L280 TraceCheckUtils]: 1: Hoare triple {468#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 <= main_~n~0); {468#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:12,996 INFO L280 TraceCheckUtils]: 2: Hoare triple {468#(<= ULTIMATE.start_main_~i~0 1)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {468#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:12,997 INFO L280 TraceCheckUtils]: 3: Hoare triple {468#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {469#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:12:12,998 INFO L280 TraceCheckUtils]: 4: Hoare triple {469#(<= ULTIMATE.start_main_~i~0 2)} assume !!(main_~i~0 <= main_~n~0); {469#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:12:12,998 INFO L280 TraceCheckUtils]: 5: Hoare triple {469#(<= ULTIMATE.start_main_~i~0 2)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {469#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:12:12,999 INFO L280 TraceCheckUtils]: 6: Hoare triple {469#(<= ULTIMATE.start_main_~i~0 2)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {470#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-28 18:12:13,002 INFO L280 TraceCheckUtils]: 7: Hoare triple {470#(<= ULTIMATE.start_main_~i~0 3)} assume !!(main_~i~0 <= main_~n~0); {470#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-28 18:12:13,003 INFO L280 TraceCheckUtils]: 8: Hoare triple {470#(<= ULTIMATE.start_main_~i~0 3)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {470#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-28 18:12:13,004 INFO L280 TraceCheckUtils]: 9: Hoare triple {470#(<= ULTIMATE.start_main_~i~0 3)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {471#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-28 18:12:13,005 INFO L280 TraceCheckUtils]: 10: Hoare triple {471#(<= ULTIMATE.start_main_~i~0 4)} assume !!(main_~i~0 <= main_~n~0); {471#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-28 18:12:13,005 INFO L280 TraceCheckUtils]: 11: Hoare triple {471#(<= ULTIMATE.start_main_~i~0 4)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {471#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-28 18:12:13,006 INFO L280 TraceCheckUtils]: 12: Hoare triple {471#(<= ULTIMATE.start_main_~i~0 4)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {472#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-28 18:12:13,007 INFO L280 TraceCheckUtils]: 13: Hoare triple {472#(<= ULTIMATE.start_main_~i~0 5)} assume !!(main_~i~0 <= main_~n~0); {472#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-28 18:12:13,007 INFO L280 TraceCheckUtils]: 14: Hoare triple {472#(<= ULTIMATE.start_main_~i~0 5)} assume !(main_~i~0 < 10); {467#false} is VALID [2020-07-28 18:12:13,008 INFO L280 TraceCheckUtils]: 15: Hoare triple {467#false} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {467#false} is VALID [2020-07-28 18:12:13,008 INFO L280 TraceCheckUtils]: 16: Hoare triple {467#false} assume !(main_~i~0 <= main_~n~0); {467#false} is VALID [2020-07-28 18:12:13,008 INFO L280 TraceCheckUtils]: 17: Hoare triple {467#false} __VERIFIER_assert_#in~cond := (if main_~sn~0 == 2 * main_~n~0 || 0 == main_~sn~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {467#false} is VALID [2020-07-28 18:12:13,008 INFO L280 TraceCheckUtils]: 18: Hoare triple {467#false} assume 0 == __VERIFIER_assert_~cond; {467#false} is VALID [2020-07-28 18:12:13,009 INFO L280 TraceCheckUtils]: 19: Hoare triple {467#false} assume !false; {467#false} is VALID [2020-07-28 18:12:13,010 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:13,010 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461838723] [2020-07-28 18:12:13,010 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470938508] [2020-07-28 18:12:13,010 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-07-28 18:12:13,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:13,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-28 18:12:13,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:13,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:12:13,181 INFO L280 TraceCheckUtils]: 0: Hoare triple {466#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~i~0, main_~n~0, main_~sn~0;havoc main_~i~0;main_~n~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;main_~sn~0 := 0;main_~i~0 := 1; {468#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:13,182 INFO L280 TraceCheckUtils]: 1: Hoare triple {468#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 <= main_~n~0); {468#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:13,182 INFO L280 TraceCheckUtils]: 2: Hoare triple {468#(<= ULTIMATE.start_main_~i~0 1)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {468#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:13,183 INFO L280 TraceCheckUtils]: 3: Hoare triple {468#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {469#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:12:13,184 INFO L280 TraceCheckUtils]: 4: Hoare triple {469#(<= ULTIMATE.start_main_~i~0 2)} assume !!(main_~i~0 <= main_~n~0); {469#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:12:13,185 INFO L280 TraceCheckUtils]: 5: Hoare triple {469#(<= ULTIMATE.start_main_~i~0 2)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {469#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:12:13,185 INFO L280 TraceCheckUtils]: 6: Hoare triple {469#(<= ULTIMATE.start_main_~i~0 2)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {470#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-28 18:12:13,186 INFO L280 TraceCheckUtils]: 7: Hoare triple {470#(<= ULTIMATE.start_main_~i~0 3)} assume !!(main_~i~0 <= main_~n~0); {470#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-28 18:12:13,186 INFO L280 TraceCheckUtils]: 8: Hoare triple {470#(<= ULTIMATE.start_main_~i~0 3)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {470#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-28 18:12:13,190 INFO L280 TraceCheckUtils]: 9: Hoare triple {470#(<= ULTIMATE.start_main_~i~0 3)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {471#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-28 18:12:13,191 INFO L280 TraceCheckUtils]: 10: Hoare triple {471#(<= ULTIMATE.start_main_~i~0 4)} assume !!(main_~i~0 <= main_~n~0); {471#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-28 18:12:13,192 INFO L280 TraceCheckUtils]: 11: Hoare triple {471#(<= ULTIMATE.start_main_~i~0 4)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {471#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-28 18:12:13,193 INFO L280 TraceCheckUtils]: 12: Hoare triple {471#(<= ULTIMATE.start_main_~i~0 4)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {472#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-28 18:12:13,193 INFO L280 TraceCheckUtils]: 13: Hoare triple {472#(<= ULTIMATE.start_main_~i~0 5)} assume !!(main_~i~0 <= main_~n~0); {472#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-28 18:12:13,194 INFO L280 TraceCheckUtils]: 14: Hoare triple {472#(<= ULTIMATE.start_main_~i~0 5)} assume !(main_~i~0 < 10); {467#false} is VALID [2020-07-28 18:12:13,195 INFO L280 TraceCheckUtils]: 15: Hoare triple {467#false} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {467#false} is VALID [2020-07-28 18:12:13,195 INFO L280 TraceCheckUtils]: 16: Hoare triple {467#false} assume !(main_~i~0 <= main_~n~0); {467#false} is VALID [2020-07-28 18:12:13,195 INFO L280 TraceCheckUtils]: 17: Hoare triple {467#false} __VERIFIER_assert_#in~cond := (if main_~sn~0 == 2 * main_~n~0 || 0 == main_~sn~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {467#false} is VALID [2020-07-28 18:12:13,196 INFO L280 TraceCheckUtils]: 18: Hoare triple {467#false} assume 0 == __VERIFIER_assert_~cond; {467#false} is VALID [2020-07-28 18:12:13,196 INFO L280 TraceCheckUtils]: 19: Hoare triple {467#false} assume !false; {467#false} is VALID [2020-07-28 18:12:13,197 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:13,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:12:13,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2020-07-28 18:12:13,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150454263] [2020-07-28 18:12:13,198 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-07-28 18:12:13,198 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:12:13,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-28 18:12:13,226 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:13,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-28 18:12:13,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:12:13,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-28 18:12:13,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-07-28 18:12:13,227 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 7 states. [2020-07-28 18:12:13,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:13,341 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-07-28 18:12:13,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-28 18:12:13,341 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-07-28 18:12:13,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:12:13,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-28 18:12:13,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2020-07-28 18:12:13,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-28 18:12:13,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2020-07-28 18:12:13,344 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 33 transitions. [2020-07-28 18:12:13,375 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:13,376 INFO L225 Difference]: With dead ends: 33 [2020-07-28 18:12:13,376 INFO L226 Difference]: Without dead ends: 26 [2020-07-28 18:12:13,377 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-07-28 18:12:13,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-28 18:12:13,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2020-07-28 18:12:13,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:12:13,400 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 25 states. [2020-07-28 18:12:13,400 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 25 states. [2020-07-28 18:12:13,400 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 25 states. [2020-07-28 18:12:13,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:13,402 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-07-28 18:12:13,402 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-07-28 18:12:13,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:13,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:13,403 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 26 states. [2020-07-28 18:12:13,403 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 26 states. [2020-07-28 18:12:13,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:13,404 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-07-28 18:12:13,405 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-07-28 18:12:13,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:13,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:13,405 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:12:13,405 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:12:13,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-28 18:12:13,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2020-07-28 18:12:13,407 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 20 [2020-07-28 18:12:13,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:12:13,407 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2020-07-28 18:12:13,407 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-28 18:12:13,407 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-28 18:12:13,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-28 18:12:13,408 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:13,408 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1] [2020-07-28 18:12:13,618 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:13,619 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:13,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:13,619 INFO L82 PathProgramCache]: Analyzing trace with hash -622858099, now seen corresponding path program 2 times [2020-07-28 18:12:13,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:13,620 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734388473] [2020-07-28 18:12:13,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:13,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:13,745 INFO L280 TraceCheckUtils]: 0: Hoare triple {657#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~i~0, main_~n~0, main_~sn~0;havoc main_~i~0;main_~n~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;main_~sn~0 := 0;main_~i~0 := 1; {659#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:13,746 INFO L280 TraceCheckUtils]: 1: Hoare triple {659#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 <= main_~n~0); {659#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:13,747 INFO L280 TraceCheckUtils]: 2: Hoare triple {659#(<= ULTIMATE.start_main_~i~0 1)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {659#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:13,748 INFO L280 TraceCheckUtils]: 3: Hoare triple {659#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {660#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:12:13,748 INFO L280 TraceCheckUtils]: 4: Hoare triple {660#(<= ULTIMATE.start_main_~i~0 2)} assume !!(main_~i~0 <= main_~n~0); {660#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:12:13,749 INFO L280 TraceCheckUtils]: 5: Hoare triple {660#(<= ULTIMATE.start_main_~i~0 2)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {660#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:12:13,749 INFO L280 TraceCheckUtils]: 6: Hoare triple {660#(<= ULTIMATE.start_main_~i~0 2)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {661#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-28 18:12:13,750 INFO L280 TraceCheckUtils]: 7: Hoare triple {661#(<= ULTIMATE.start_main_~i~0 3)} assume !!(main_~i~0 <= main_~n~0); {661#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-28 18:12:13,750 INFO L280 TraceCheckUtils]: 8: Hoare triple {661#(<= ULTIMATE.start_main_~i~0 3)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {661#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-28 18:12:13,756 INFO L280 TraceCheckUtils]: 9: Hoare triple {661#(<= ULTIMATE.start_main_~i~0 3)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {662#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-28 18:12:13,756 INFO L280 TraceCheckUtils]: 10: Hoare triple {662#(<= ULTIMATE.start_main_~i~0 4)} assume !!(main_~i~0 <= main_~n~0); {662#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-28 18:12:13,757 INFO L280 TraceCheckUtils]: 11: Hoare triple {662#(<= ULTIMATE.start_main_~i~0 4)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {662#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-28 18:12:13,758 INFO L280 TraceCheckUtils]: 12: Hoare triple {662#(<= ULTIMATE.start_main_~i~0 4)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {663#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-28 18:12:13,762 INFO L280 TraceCheckUtils]: 13: Hoare triple {663#(<= ULTIMATE.start_main_~i~0 5)} assume !!(main_~i~0 <= main_~n~0); {663#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-28 18:12:13,763 INFO L280 TraceCheckUtils]: 14: Hoare triple {663#(<= ULTIMATE.start_main_~i~0 5)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {663#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-28 18:12:13,764 INFO L280 TraceCheckUtils]: 15: Hoare triple {663#(<= ULTIMATE.start_main_~i~0 5)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {664#(<= ULTIMATE.start_main_~i~0 6)} is VALID [2020-07-28 18:12:13,764 INFO L280 TraceCheckUtils]: 16: Hoare triple {664#(<= ULTIMATE.start_main_~i~0 6)} assume !!(main_~i~0 <= main_~n~0); {664#(<= ULTIMATE.start_main_~i~0 6)} is VALID [2020-07-28 18:12:13,765 INFO L280 TraceCheckUtils]: 17: Hoare triple {664#(<= ULTIMATE.start_main_~i~0 6)} assume !(main_~i~0 < 10); {658#false} is VALID [2020-07-28 18:12:13,765 INFO L280 TraceCheckUtils]: 18: Hoare triple {658#false} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {658#false} is VALID [2020-07-28 18:12:13,765 INFO L280 TraceCheckUtils]: 19: Hoare triple {658#false} assume !(main_~i~0 <= main_~n~0); {658#false} is VALID [2020-07-28 18:12:13,766 INFO L280 TraceCheckUtils]: 20: Hoare triple {658#false} __VERIFIER_assert_#in~cond := (if main_~sn~0 == 2 * main_~n~0 || 0 == main_~sn~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {658#false} is VALID [2020-07-28 18:12:13,766 INFO L280 TraceCheckUtils]: 21: Hoare triple {658#false} assume 0 == __VERIFIER_assert_~cond; {658#false} is VALID [2020-07-28 18:12:13,766 INFO L280 TraceCheckUtils]: 22: Hoare triple {658#false} assume !false; {658#false} is VALID [2020-07-28 18:12:13,767 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:13,767 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734388473] [2020-07-28 18:12:13,768 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122984641] [2020-07-28 18:12:13,768 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-07-28 18:12:13,790 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-28 18:12:13,790 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 18:12:13,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-28 18:12:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:13,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:12:13,983 INFO L280 TraceCheckUtils]: 0: Hoare triple {657#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~i~0, main_~n~0, main_~sn~0;havoc main_~i~0;main_~n~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;main_~sn~0 := 0;main_~i~0 := 1; {659#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:13,984 INFO L280 TraceCheckUtils]: 1: Hoare triple {659#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 <= main_~n~0); {659#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:13,985 INFO L280 TraceCheckUtils]: 2: Hoare triple {659#(<= ULTIMATE.start_main_~i~0 1)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {659#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:14,001 INFO L280 TraceCheckUtils]: 3: Hoare triple {659#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {660#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:12:14,002 INFO L280 TraceCheckUtils]: 4: Hoare triple {660#(<= ULTIMATE.start_main_~i~0 2)} assume !!(main_~i~0 <= main_~n~0); {660#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:12:14,003 INFO L280 TraceCheckUtils]: 5: Hoare triple {660#(<= ULTIMATE.start_main_~i~0 2)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {660#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:12:14,004 INFO L280 TraceCheckUtils]: 6: Hoare triple {660#(<= ULTIMATE.start_main_~i~0 2)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {661#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-28 18:12:14,005 INFO L280 TraceCheckUtils]: 7: Hoare triple {661#(<= ULTIMATE.start_main_~i~0 3)} assume !!(main_~i~0 <= main_~n~0); {661#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-28 18:12:14,006 INFO L280 TraceCheckUtils]: 8: Hoare triple {661#(<= ULTIMATE.start_main_~i~0 3)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {661#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-28 18:12:14,007 INFO L280 TraceCheckUtils]: 9: Hoare triple {661#(<= ULTIMATE.start_main_~i~0 3)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {662#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-28 18:12:14,008 INFO L280 TraceCheckUtils]: 10: Hoare triple {662#(<= ULTIMATE.start_main_~i~0 4)} assume !!(main_~i~0 <= main_~n~0); {662#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-28 18:12:14,012 INFO L280 TraceCheckUtils]: 11: Hoare triple {662#(<= ULTIMATE.start_main_~i~0 4)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {662#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-28 18:12:14,013 INFO L280 TraceCheckUtils]: 12: Hoare triple {662#(<= ULTIMATE.start_main_~i~0 4)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {663#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-28 18:12:14,016 INFO L280 TraceCheckUtils]: 13: Hoare triple {663#(<= ULTIMATE.start_main_~i~0 5)} assume !!(main_~i~0 <= main_~n~0); {663#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-28 18:12:14,019 INFO L280 TraceCheckUtils]: 14: Hoare triple {663#(<= ULTIMATE.start_main_~i~0 5)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {663#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-28 18:12:14,022 INFO L280 TraceCheckUtils]: 15: Hoare triple {663#(<= ULTIMATE.start_main_~i~0 5)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {664#(<= ULTIMATE.start_main_~i~0 6)} is VALID [2020-07-28 18:12:14,022 INFO L280 TraceCheckUtils]: 16: Hoare triple {664#(<= ULTIMATE.start_main_~i~0 6)} assume !!(main_~i~0 <= main_~n~0); {664#(<= ULTIMATE.start_main_~i~0 6)} is VALID [2020-07-28 18:12:14,023 INFO L280 TraceCheckUtils]: 17: Hoare triple {664#(<= ULTIMATE.start_main_~i~0 6)} assume !(main_~i~0 < 10); {658#false} is VALID [2020-07-28 18:12:14,023 INFO L280 TraceCheckUtils]: 18: Hoare triple {658#false} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {658#false} is VALID [2020-07-28 18:12:14,024 INFO L280 TraceCheckUtils]: 19: Hoare triple {658#false} assume !(main_~i~0 <= main_~n~0); {658#false} is VALID [2020-07-28 18:12:14,024 INFO L280 TraceCheckUtils]: 20: Hoare triple {658#false} __VERIFIER_assert_#in~cond := (if main_~sn~0 == 2 * main_~n~0 || 0 == main_~sn~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {658#false} is VALID [2020-07-28 18:12:14,024 INFO L280 TraceCheckUtils]: 21: Hoare triple {658#false} assume 0 == __VERIFIER_assert_~cond; {658#false} is VALID [2020-07-28 18:12:14,025 INFO L280 TraceCheckUtils]: 22: Hoare triple {658#false} assume !false; {658#false} is VALID [2020-07-28 18:12:14,026 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:14,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:12:14,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2020-07-28 18:12:14,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774165770] [2020-07-28 18:12:14,028 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2020-07-28 18:12:14,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:12:14,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-28 18:12:14,061 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:14,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-28 18:12:14,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:12:14,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-28 18:12:14,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-07-28 18:12:14,062 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 8 states. [2020-07-28 18:12:14,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:14,182 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2020-07-28 18:12:14,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-28 18:12:14,182 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2020-07-28 18:12:14,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:12:14,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 18:12:14,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2020-07-28 18:12:14,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 18:12:14,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2020-07-28 18:12:14,185 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 36 transitions. [2020-07-28 18:12:14,233 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:14,234 INFO L225 Difference]: With dead ends: 36 [2020-07-28 18:12:14,234 INFO L226 Difference]: Without dead ends: 29 [2020-07-28 18:12:14,235 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-07-28 18:12:14,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-28 18:12:14,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2020-07-28 18:12:14,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:12:14,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 28 states. [2020-07-28 18:12:14,262 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 28 states. [2020-07-28 18:12:14,262 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 28 states. [2020-07-28 18:12:14,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:14,265 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-07-28 18:12:14,265 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-28 18:12:14,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:14,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:14,266 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 29 states. [2020-07-28 18:12:14,266 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 29 states. [2020-07-28 18:12:14,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:14,268 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-07-28 18:12:14,268 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-28 18:12:14,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:14,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:14,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:12:14,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:12:14,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-28 18:12:14,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2020-07-28 18:12:14,271 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 23 [2020-07-28 18:12:14,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:12:14,271 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2020-07-28 18:12:14,271 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-28 18:12:14,271 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-28 18:12:14,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-28 18:12:14,272 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:14,272 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1] [2020-07-28 18:12:14,485 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:14,486 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:14,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:14,487 INFO L82 PathProgramCache]: Analyzing trace with hash -390715430, now seen corresponding path program 3 times [2020-07-28 18:12:14,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:14,488 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902212590] [2020-07-28 18:12:14,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:14,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:14,642 INFO L280 TraceCheckUtils]: 0: Hoare triple {872#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~i~0, main_~n~0, main_~sn~0;havoc main_~i~0;main_~n~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;main_~sn~0 := 0;main_~i~0 := 1; {874#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:14,643 INFO L280 TraceCheckUtils]: 1: Hoare triple {874#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 <= main_~n~0); {874#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:14,644 INFO L280 TraceCheckUtils]: 2: Hoare triple {874#(<= ULTIMATE.start_main_~i~0 1)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {874#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:14,645 INFO L280 TraceCheckUtils]: 3: Hoare triple {874#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {875#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:12:14,646 INFO L280 TraceCheckUtils]: 4: Hoare triple {875#(<= ULTIMATE.start_main_~i~0 2)} assume !!(main_~i~0 <= main_~n~0); {875#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:12:14,647 INFO L280 TraceCheckUtils]: 5: Hoare triple {875#(<= ULTIMATE.start_main_~i~0 2)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {875#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:12:14,648 INFO L280 TraceCheckUtils]: 6: Hoare triple {875#(<= ULTIMATE.start_main_~i~0 2)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {876#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-28 18:12:14,648 INFO L280 TraceCheckUtils]: 7: Hoare triple {876#(<= ULTIMATE.start_main_~i~0 3)} assume !!(main_~i~0 <= main_~n~0); {876#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-28 18:12:14,649 INFO L280 TraceCheckUtils]: 8: Hoare triple {876#(<= ULTIMATE.start_main_~i~0 3)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {876#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-28 18:12:14,650 INFO L280 TraceCheckUtils]: 9: Hoare triple {876#(<= ULTIMATE.start_main_~i~0 3)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {877#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-28 18:12:14,651 INFO L280 TraceCheckUtils]: 10: Hoare triple {877#(<= ULTIMATE.start_main_~i~0 4)} assume !!(main_~i~0 <= main_~n~0); {877#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-28 18:12:14,652 INFO L280 TraceCheckUtils]: 11: Hoare triple {877#(<= ULTIMATE.start_main_~i~0 4)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {877#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-28 18:12:14,653 INFO L280 TraceCheckUtils]: 12: Hoare triple {877#(<= ULTIMATE.start_main_~i~0 4)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {878#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-28 18:12:14,654 INFO L280 TraceCheckUtils]: 13: Hoare triple {878#(<= ULTIMATE.start_main_~i~0 5)} assume !!(main_~i~0 <= main_~n~0); {878#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-28 18:12:14,654 INFO L280 TraceCheckUtils]: 14: Hoare triple {878#(<= ULTIMATE.start_main_~i~0 5)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {878#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-28 18:12:14,655 INFO L280 TraceCheckUtils]: 15: Hoare triple {878#(<= ULTIMATE.start_main_~i~0 5)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {879#(<= ULTIMATE.start_main_~i~0 6)} is VALID [2020-07-28 18:12:14,656 INFO L280 TraceCheckUtils]: 16: Hoare triple {879#(<= ULTIMATE.start_main_~i~0 6)} assume !!(main_~i~0 <= main_~n~0); {879#(<= ULTIMATE.start_main_~i~0 6)} is VALID [2020-07-28 18:12:14,657 INFO L280 TraceCheckUtils]: 17: Hoare triple {879#(<= ULTIMATE.start_main_~i~0 6)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {879#(<= ULTIMATE.start_main_~i~0 6)} is VALID [2020-07-28 18:12:14,659 INFO L280 TraceCheckUtils]: 18: Hoare triple {879#(<= ULTIMATE.start_main_~i~0 6)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {880#(<= ULTIMATE.start_main_~i~0 7)} is VALID [2020-07-28 18:12:14,660 INFO L280 TraceCheckUtils]: 19: Hoare triple {880#(<= ULTIMATE.start_main_~i~0 7)} assume !!(main_~i~0 <= main_~n~0); {880#(<= ULTIMATE.start_main_~i~0 7)} is VALID [2020-07-28 18:12:14,662 INFO L280 TraceCheckUtils]: 20: Hoare triple {880#(<= ULTIMATE.start_main_~i~0 7)} assume !(main_~i~0 < 10); {873#false} is VALID [2020-07-28 18:12:14,662 INFO L280 TraceCheckUtils]: 21: Hoare triple {873#false} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {873#false} is VALID [2020-07-28 18:12:14,662 INFO L280 TraceCheckUtils]: 22: Hoare triple {873#false} assume !(main_~i~0 <= main_~n~0); {873#false} is VALID [2020-07-28 18:12:14,663 INFO L280 TraceCheckUtils]: 23: Hoare triple {873#false} __VERIFIER_assert_#in~cond := (if main_~sn~0 == 2 * main_~n~0 || 0 == main_~sn~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {873#false} is VALID [2020-07-28 18:12:14,663 INFO L280 TraceCheckUtils]: 24: Hoare triple {873#false} assume 0 == __VERIFIER_assert_~cond; {873#false} is VALID [2020-07-28 18:12:14,664 INFO L280 TraceCheckUtils]: 25: Hoare triple {873#false} assume !false; {873#false} is VALID [2020-07-28 18:12:14,667 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:14,667 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902212590] [2020-07-28 18:12:14,668 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135275150] [2020-07-28 18:12:14,668 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-07-28 18:12:14,719 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2020-07-28 18:12:14,719 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 18:12:14,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-28 18:12:14,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:14,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:12:14,928 INFO L280 TraceCheckUtils]: 0: Hoare triple {872#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~i~0, main_~n~0, main_~sn~0;havoc main_~i~0;main_~n~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;main_~sn~0 := 0;main_~i~0 := 1; {874#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:14,929 INFO L280 TraceCheckUtils]: 1: Hoare triple {874#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 <= main_~n~0); {874#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:14,930 INFO L280 TraceCheckUtils]: 2: Hoare triple {874#(<= ULTIMATE.start_main_~i~0 1)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {874#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:14,931 INFO L280 TraceCheckUtils]: 3: Hoare triple {874#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {875#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:12:14,931 INFO L280 TraceCheckUtils]: 4: Hoare triple {875#(<= ULTIMATE.start_main_~i~0 2)} assume !!(main_~i~0 <= main_~n~0); {875#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:12:14,932 INFO L280 TraceCheckUtils]: 5: Hoare triple {875#(<= ULTIMATE.start_main_~i~0 2)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {875#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:12:14,933 INFO L280 TraceCheckUtils]: 6: Hoare triple {875#(<= ULTIMATE.start_main_~i~0 2)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {876#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-28 18:12:14,933 INFO L280 TraceCheckUtils]: 7: Hoare triple {876#(<= ULTIMATE.start_main_~i~0 3)} assume !!(main_~i~0 <= main_~n~0); {876#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-28 18:12:14,934 INFO L280 TraceCheckUtils]: 8: Hoare triple {876#(<= ULTIMATE.start_main_~i~0 3)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {876#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-28 18:12:14,934 INFO L280 TraceCheckUtils]: 9: Hoare triple {876#(<= ULTIMATE.start_main_~i~0 3)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {877#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-28 18:12:14,935 INFO L280 TraceCheckUtils]: 10: Hoare triple {877#(<= ULTIMATE.start_main_~i~0 4)} assume !!(main_~i~0 <= main_~n~0); {877#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-28 18:12:14,936 INFO L280 TraceCheckUtils]: 11: Hoare triple {877#(<= ULTIMATE.start_main_~i~0 4)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {877#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-28 18:12:14,936 INFO L280 TraceCheckUtils]: 12: Hoare triple {877#(<= ULTIMATE.start_main_~i~0 4)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {878#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-28 18:12:14,937 INFO L280 TraceCheckUtils]: 13: Hoare triple {878#(<= ULTIMATE.start_main_~i~0 5)} assume !!(main_~i~0 <= main_~n~0); {878#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-28 18:12:14,938 INFO L280 TraceCheckUtils]: 14: Hoare triple {878#(<= ULTIMATE.start_main_~i~0 5)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {878#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-28 18:12:14,938 INFO L280 TraceCheckUtils]: 15: Hoare triple {878#(<= ULTIMATE.start_main_~i~0 5)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {879#(<= ULTIMATE.start_main_~i~0 6)} is VALID [2020-07-28 18:12:14,939 INFO L280 TraceCheckUtils]: 16: Hoare triple {879#(<= ULTIMATE.start_main_~i~0 6)} assume !!(main_~i~0 <= main_~n~0); {879#(<= ULTIMATE.start_main_~i~0 6)} is VALID [2020-07-28 18:12:14,939 INFO L280 TraceCheckUtils]: 17: Hoare triple {879#(<= ULTIMATE.start_main_~i~0 6)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {879#(<= ULTIMATE.start_main_~i~0 6)} is VALID [2020-07-28 18:12:14,940 INFO L280 TraceCheckUtils]: 18: Hoare triple {879#(<= ULTIMATE.start_main_~i~0 6)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {880#(<= ULTIMATE.start_main_~i~0 7)} is VALID [2020-07-28 18:12:14,941 INFO L280 TraceCheckUtils]: 19: Hoare triple {880#(<= ULTIMATE.start_main_~i~0 7)} assume !!(main_~i~0 <= main_~n~0); {880#(<= ULTIMATE.start_main_~i~0 7)} is VALID [2020-07-28 18:12:14,941 INFO L280 TraceCheckUtils]: 20: Hoare triple {880#(<= ULTIMATE.start_main_~i~0 7)} assume !(main_~i~0 < 10); {873#false} is VALID [2020-07-28 18:12:14,942 INFO L280 TraceCheckUtils]: 21: Hoare triple {873#false} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {873#false} is VALID [2020-07-28 18:12:14,942 INFO L280 TraceCheckUtils]: 22: Hoare triple {873#false} assume !(main_~i~0 <= main_~n~0); {873#false} is VALID [2020-07-28 18:12:14,942 INFO L280 TraceCheckUtils]: 23: Hoare triple {873#false} __VERIFIER_assert_#in~cond := (if main_~sn~0 == 2 * main_~n~0 || 0 == main_~sn~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {873#false} is VALID [2020-07-28 18:12:14,942 INFO L280 TraceCheckUtils]: 24: Hoare triple {873#false} assume 0 == __VERIFIER_assert_~cond; {873#false} is VALID [2020-07-28 18:12:14,943 INFO L280 TraceCheckUtils]: 25: Hoare triple {873#false} assume !false; {873#false} is VALID [2020-07-28 18:12:14,944 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:14,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:12:14,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2020-07-28 18:12:14,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076656559] [2020-07-28 18:12:14,947 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-07-28 18:12:14,947 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:12:14,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-28 18:12:14,975 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:14,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-28 18:12:14,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:12:14,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-28 18:12:14,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-07-28 18:12:14,977 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 9 states. [2020-07-28 18:12:15,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:15,059 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2020-07-28 18:12:15,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-28 18:12:15,060 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-07-28 18:12:15,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:12:15,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 18:12:15,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2020-07-28 18:12:15,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 18:12:15,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2020-07-28 18:12:15,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 39 transitions. [2020-07-28 18:12:15,103 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:15,104 INFO L225 Difference]: With dead ends: 39 [2020-07-28 18:12:15,104 INFO L226 Difference]: Without dead ends: 32 [2020-07-28 18:12:15,105 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-07-28 18:12:15,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-28 18:12:15,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2020-07-28 18:12:15,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:12:15,130 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2020-07-28 18:12:15,131 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2020-07-28 18:12:15,131 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2020-07-28 18:12:15,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:15,132 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2020-07-28 18:12:15,132 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-28 18:12:15,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:15,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:15,133 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2020-07-28 18:12:15,133 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2020-07-28 18:12:15,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:15,135 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2020-07-28 18:12:15,136 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-28 18:12:15,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:15,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:15,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:12:15,137 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:12:15,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-28 18:12:15,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2020-07-28 18:12:15,139 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 26 [2020-07-28 18:12:15,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:12:15,143 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2020-07-28 18:12:15,143 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-28 18:12:15,143 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-07-28 18:12:15,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-28 18:12:15,144 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:15,144 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1] [2020-07-28 18:12:15,345 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-28 18:12:15,346 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:15,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:15,346 INFO L82 PathProgramCache]: Analyzing trace with hash 474190189, now seen corresponding path program 4 times [2020-07-28 18:12:15,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:15,347 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421924235] [2020-07-28 18:12:15,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:15,450 INFO L280 TraceCheckUtils]: 0: Hoare triple {1111#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~i~0, main_~n~0, main_~sn~0;havoc main_~i~0;main_~n~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;main_~sn~0 := 0;main_~i~0 := 1; {1113#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:15,451 INFO L280 TraceCheckUtils]: 1: Hoare triple {1113#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 <= main_~n~0); {1113#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:15,451 INFO L280 TraceCheckUtils]: 2: Hoare triple {1113#(<= ULTIMATE.start_main_~i~0 1)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {1113#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:15,452 INFO L280 TraceCheckUtils]: 3: Hoare triple {1113#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {1114#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:12:15,453 INFO L280 TraceCheckUtils]: 4: Hoare triple {1114#(<= ULTIMATE.start_main_~i~0 2)} assume !!(main_~i~0 <= main_~n~0); {1114#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:12:15,453 INFO L280 TraceCheckUtils]: 5: Hoare triple {1114#(<= ULTIMATE.start_main_~i~0 2)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {1114#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:12:15,454 INFO L280 TraceCheckUtils]: 6: Hoare triple {1114#(<= ULTIMATE.start_main_~i~0 2)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {1115#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-28 18:12:15,454 INFO L280 TraceCheckUtils]: 7: Hoare triple {1115#(<= ULTIMATE.start_main_~i~0 3)} assume !!(main_~i~0 <= main_~n~0); {1115#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-28 18:12:15,455 INFO L280 TraceCheckUtils]: 8: Hoare triple {1115#(<= ULTIMATE.start_main_~i~0 3)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {1115#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-28 18:12:15,456 INFO L280 TraceCheckUtils]: 9: Hoare triple {1115#(<= ULTIMATE.start_main_~i~0 3)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {1116#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-28 18:12:15,456 INFO L280 TraceCheckUtils]: 10: Hoare triple {1116#(<= ULTIMATE.start_main_~i~0 4)} assume !!(main_~i~0 <= main_~n~0); {1116#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-28 18:12:15,457 INFO L280 TraceCheckUtils]: 11: Hoare triple {1116#(<= ULTIMATE.start_main_~i~0 4)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {1116#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-28 18:12:15,457 INFO L280 TraceCheckUtils]: 12: Hoare triple {1116#(<= ULTIMATE.start_main_~i~0 4)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {1117#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-28 18:12:15,459 INFO L280 TraceCheckUtils]: 13: Hoare triple {1117#(<= ULTIMATE.start_main_~i~0 5)} assume !!(main_~i~0 <= main_~n~0); {1117#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-28 18:12:15,465 INFO L280 TraceCheckUtils]: 14: Hoare triple {1117#(<= ULTIMATE.start_main_~i~0 5)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {1117#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-28 18:12:15,467 INFO L280 TraceCheckUtils]: 15: Hoare triple {1117#(<= ULTIMATE.start_main_~i~0 5)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {1118#(<= ULTIMATE.start_main_~i~0 6)} is VALID [2020-07-28 18:12:15,468 INFO L280 TraceCheckUtils]: 16: Hoare triple {1118#(<= ULTIMATE.start_main_~i~0 6)} assume !!(main_~i~0 <= main_~n~0); {1118#(<= ULTIMATE.start_main_~i~0 6)} is VALID [2020-07-28 18:12:15,468 INFO L280 TraceCheckUtils]: 17: Hoare triple {1118#(<= ULTIMATE.start_main_~i~0 6)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {1118#(<= ULTIMATE.start_main_~i~0 6)} is VALID [2020-07-28 18:12:15,469 INFO L280 TraceCheckUtils]: 18: Hoare triple {1118#(<= ULTIMATE.start_main_~i~0 6)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {1119#(<= ULTIMATE.start_main_~i~0 7)} is VALID [2020-07-28 18:12:15,470 INFO L280 TraceCheckUtils]: 19: Hoare triple {1119#(<= ULTIMATE.start_main_~i~0 7)} assume !!(main_~i~0 <= main_~n~0); {1119#(<= ULTIMATE.start_main_~i~0 7)} is VALID [2020-07-28 18:12:15,471 INFO L280 TraceCheckUtils]: 20: Hoare triple {1119#(<= ULTIMATE.start_main_~i~0 7)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {1119#(<= ULTIMATE.start_main_~i~0 7)} is VALID [2020-07-28 18:12:15,472 INFO L280 TraceCheckUtils]: 21: Hoare triple {1119#(<= ULTIMATE.start_main_~i~0 7)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {1120#(<= ULTIMATE.start_main_~i~0 8)} is VALID [2020-07-28 18:12:15,473 INFO L280 TraceCheckUtils]: 22: Hoare triple {1120#(<= ULTIMATE.start_main_~i~0 8)} assume !!(main_~i~0 <= main_~n~0); {1120#(<= ULTIMATE.start_main_~i~0 8)} is VALID [2020-07-28 18:12:15,473 INFO L280 TraceCheckUtils]: 23: Hoare triple {1120#(<= ULTIMATE.start_main_~i~0 8)} assume !(main_~i~0 < 10); {1112#false} is VALID [2020-07-28 18:12:15,474 INFO L280 TraceCheckUtils]: 24: Hoare triple {1112#false} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {1112#false} is VALID [2020-07-28 18:12:15,474 INFO L280 TraceCheckUtils]: 25: Hoare triple {1112#false} assume !(main_~i~0 <= main_~n~0); {1112#false} is VALID [2020-07-28 18:12:15,474 INFO L280 TraceCheckUtils]: 26: Hoare triple {1112#false} __VERIFIER_assert_#in~cond := (if main_~sn~0 == 2 * main_~n~0 || 0 == main_~sn~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1112#false} is VALID [2020-07-28 18:12:15,475 INFO L280 TraceCheckUtils]: 27: Hoare triple {1112#false} assume 0 == __VERIFIER_assert_~cond; {1112#false} is VALID [2020-07-28 18:12:15,475 INFO L280 TraceCheckUtils]: 28: Hoare triple {1112#false} assume !false; {1112#false} is VALID [2020-07-28 18:12:15,476 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 15 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:15,477 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421924235] [2020-07-28 18:12:15,477 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073172784] [2020-07-28 18:12:15,477 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-28 18:12:15,504 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-28 18:12:15,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:15,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-28 18:12:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:15,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:12:15,712 INFO L280 TraceCheckUtils]: 0: Hoare triple {1111#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~i~0, main_~n~0, main_~sn~0;havoc main_~i~0;main_~n~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;main_~sn~0 := 0;main_~i~0 := 1; {1113#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:15,713 INFO L280 TraceCheckUtils]: 1: Hoare triple {1113#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 <= main_~n~0); {1113#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:15,713 INFO L280 TraceCheckUtils]: 2: Hoare triple {1113#(<= ULTIMATE.start_main_~i~0 1)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {1113#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:15,714 INFO L280 TraceCheckUtils]: 3: Hoare triple {1113#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {1114#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:12:15,715 INFO L280 TraceCheckUtils]: 4: Hoare triple {1114#(<= ULTIMATE.start_main_~i~0 2)} assume !!(main_~i~0 <= main_~n~0); {1114#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:12:15,715 INFO L280 TraceCheckUtils]: 5: Hoare triple {1114#(<= ULTIMATE.start_main_~i~0 2)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {1114#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:12:15,716 INFO L280 TraceCheckUtils]: 6: Hoare triple {1114#(<= ULTIMATE.start_main_~i~0 2)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {1115#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-28 18:12:15,721 INFO L280 TraceCheckUtils]: 7: Hoare triple {1115#(<= ULTIMATE.start_main_~i~0 3)} assume !!(main_~i~0 <= main_~n~0); {1115#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-28 18:12:15,722 INFO L280 TraceCheckUtils]: 8: Hoare triple {1115#(<= ULTIMATE.start_main_~i~0 3)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {1115#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-28 18:12:15,723 INFO L280 TraceCheckUtils]: 9: Hoare triple {1115#(<= ULTIMATE.start_main_~i~0 3)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {1116#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-28 18:12:15,724 INFO L280 TraceCheckUtils]: 10: Hoare triple {1116#(<= ULTIMATE.start_main_~i~0 4)} assume !!(main_~i~0 <= main_~n~0); {1116#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-28 18:12:15,724 INFO L280 TraceCheckUtils]: 11: Hoare triple {1116#(<= ULTIMATE.start_main_~i~0 4)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {1116#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-28 18:12:15,725 INFO L280 TraceCheckUtils]: 12: Hoare triple {1116#(<= ULTIMATE.start_main_~i~0 4)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {1117#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-28 18:12:15,725 INFO L280 TraceCheckUtils]: 13: Hoare triple {1117#(<= ULTIMATE.start_main_~i~0 5)} assume !!(main_~i~0 <= main_~n~0); {1117#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-28 18:12:15,726 INFO L280 TraceCheckUtils]: 14: Hoare triple {1117#(<= ULTIMATE.start_main_~i~0 5)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {1117#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-28 18:12:15,726 INFO L280 TraceCheckUtils]: 15: Hoare triple {1117#(<= ULTIMATE.start_main_~i~0 5)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {1118#(<= ULTIMATE.start_main_~i~0 6)} is VALID [2020-07-28 18:12:15,727 INFO L280 TraceCheckUtils]: 16: Hoare triple {1118#(<= ULTIMATE.start_main_~i~0 6)} assume !!(main_~i~0 <= main_~n~0); {1118#(<= ULTIMATE.start_main_~i~0 6)} is VALID [2020-07-28 18:12:15,727 INFO L280 TraceCheckUtils]: 17: Hoare triple {1118#(<= ULTIMATE.start_main_~i~0 6)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {1118#(<= ULTIMATE.start_main_~i~0 6)} is VALID [2020-07-28 18:12:15,728 INFO L280 TraceCheckUtils]: 18: Hoare triple {1118#(<= ULTIMATE.start_main_~i~0 6)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {1119#(<= ULTIMATE.start_main_~i~0 7)} is VALID [2020-07-28 18:12:15,728 INFO L280 TraceCheckUtils]: 19: Hoare triple {1119#(<= ULTIMATE.start_main_~i~0 7)} assume !!(main_~i~0 <= main_~n~0); {1119#(<= ULTIMATE.start_main_~i~0 7)} is VALID [2020-07-28 18:12:15,729 INFO L280 TraceCheckUtils]: 20: Hoare triple {1119#(<= ULTIMATE.start_main_~i~0 7)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {1119#(<= ULTIMATE.start_main_~i~0 7)} is VALID [2020-07-28 18:12:15,729 INFO L280 TraceCheckUtils]: 21: Hoare triple {1119#(<= ULTIMATE.start_main_~i~0 7)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {1120#(<= ULTIMATE.start_main_~i~0 8)} is VALID [2020-07-28 18:12:15,730 INFO L280 TraceCheckUtils]: 22: Hoare triple {1120#(<= ULTIMATE.start_main_~i~0 8)} assume !!(main_~i~0 <= main_~n~0); {1120#(<= ULTIMATE.start_main_~i~0 8)} is VALID [2020-07-28 18:12:15,730 INFO L280 TraceCheckUtils]: 23: Hoare triple {1120#(<= ULTIMATE.start_main_~i~0 8)} assume !(main_~i~0 < 10); {1112#false} is VALID [2020-07-28 18:12:15,730 INFO L280 TraceCheckUtils]: 24: Hoare triple {1112#false} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {1112#false} is VALID [2020-07-28 18:12:15,731 INFO L280 TraceCheckUtils]: 25: Hoare triple {1112#false} assume !(main_~i~0 <= main_~n~0); {1112#false} is VALID [2020-07-28 18:12:15,731 INFO L280 TraceCheckUtils]: 26: Hoare triple {1112#false} __VERIFIER_assert_#in~cond := (if main_~sn~0 == 2 * main_~n~0 || 0 == main_~sn~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1112#false} is VALID [2020-07-28 18:12:15,731 INFO L280 TraceCheckUtils]: 27: Hoare triple {1112#false} assume 0 == __VERIFIER_assert_~cond; {1112#false} is VALID [2020-07-28 18:12:15,731 INFO L280 TraceCheckUtils]: 28: Hoare triple {1112#false} assume !false; {1112#false} is VALID [2020-07-28 18:12:15,735 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 15 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:15,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:12:15,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2020-07-28 18:12:15,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493757372] [2020-07-28 18:12:15,736 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2020-07-28 18:12:15,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:12:15,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-28 18:12:15,776 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:15,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-28 18:12:15,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:12:15,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-28 18:12:15,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-07-28 18:12:15,777 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 10 states. [2020-07-28 18:12:15,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:15,868 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2020-07-28 18:12:15,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-28 18:12:15,869 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2020-07-28 18:12:15,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:12:15,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 18:12:15,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2020-07-28 18:12:15,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 18:12:15,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2020-07-28 18:12:15,872 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 42 transitions. [2020-07-28 18:12:15,911 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:15,912 INFO L225 Difference]: With dead ends: 42 [2020-07-28 18:12:15,912 INFO L226 Difference]: Without dead ends: 35 [2020-07-28 18:12:15,913 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-07-28 18:12:15,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-28 18:12:15,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2020-07-28 18:12:15,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:12:15,940 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 34 states. [2020-07-28 18:12:15,940 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 34 states. [2020-07-28 18:12:15,940 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 34 states. [2020-07-28 18:12:15,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:15,942 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2020-07-28 18:12:15,943 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-28 18:12:15,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:15,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:15,944 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 35 states. [2020-07-28 18:12:15,944 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 35 states. [2020-07-28 18:12:15,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:15,945 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2020-07-28 18:12:15,945 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-28 18:12:15,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:15,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:15,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:12:15,946 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:12:15,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-28 18:12:15,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2020-07-28 18:12:15,947 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 29 [2020-07-28 18:12:15,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:12:15,948 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2020-07-28 18:12:15,948 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-28 18:12:15,948 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2020-07-28 18:12:15,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-28 18:12:15,948 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:15,949 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1] [2020-07-28 18:12:16,150 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:16,151 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:16,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:16,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1368677114, now seen corresponding path program 5 times [2020-07-28 18:12:16,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:16,152 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46308041] [2020-07-28 18:12:16,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:16,331 INFO L280 TraceCheckUtils]: 0: Hoare triple {1374#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~i~0, main_~n~0, main_~sn~0;havoc main_~i~0;main_~n~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;main_~sn~0 := 0;main_~i~0 := 1; {1376#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:16,333 INFO L280 TraceCheckUtils]: 1: Hoare triple {1376#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 <= main_~n~0); {1376#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:16,333 INFO L280 TraceCheckUtils]: 2: Hoare triple {1376#(<= ULTIMATE.start_main_~i~0 1)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {1376#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:16,335 INFO L280 TraceCheckUtils]: 3: Hoare triple {1376#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {1377#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:12:16,337 INFO L280 TraceCheckUtils]: 4: Hoare triple {1377#(<= ULTIMATE.start_main_~i~0 2)} assume !!(main_~i~0 <= main_~n~0); {1377#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:12:16,340 INFO L280 TraceCheckUtils]: 5: Hoare triple {1377#(<= ULTIMATE.start_main_~i~0 2)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {1377#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:12:16,342 INFO L280 TraceCheckUtils]: 6: Hoare triple {1377#(<= ULTIMATE.start_main_~i~0 2)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {1378#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-28 18:12:16,343 INFO L280 TraceCheckUtils]: 7: Hoare triple {1378#(<= ULTIMATE.start_main_~i~0 3)} assume !!(main_~i~0 <= main_~n~0); {1378#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-28 18:12:16,347 INFO L280 TraceCheckUtils]: 8: Hoare triple {1378#(<= ULTIMATE.start_main_~i~0 3)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {1378#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-28 18:12:16,348 INFO L280 TraceCheckUtils]: 9: Hoare triple {1378#(<= ULTIMATE.start_main_~i~0 3)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {1379#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-28 18:12:16,348 INFO L280 TraceCheckUtils]: 10: Hoare triple {1379#(<= ULTIMATE.start_main_~i~0 4)} assume !!(main_~i~0 <= main_~n~0); {1379#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-28 18:12:16,349 INFO L280 TraceCheckUtils]: 11: Hoare triple {1379#(<= ULTIMATE.start_main_~i~0 4)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {1379#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-28 18:12:16,349 INFO L280 TraceCheckUtils]: 12: Hoare triple {1379#(<= ULTIMATE.start_main_~i~0 4)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {1380#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-28 18:12:16,350 INFO L280 TraceCheckUtils]: 13: Hoare triple {1380#(<= ULTIMATE.start_main_~i~0 5)} assume !!(main_~i~0 <= main_~n~0); {1380#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-28 18:12:16,350 INFO L280 TraceCheckUtils]: 14: Hoare triple {1380#(<= ULTIMATE.start_main_~i~0 5)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {1380#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-28 18:12:16,351 INFO L280 TraceCheckUtils]: 15: Hoare triple {1380#(<= ULTIMATE.start_main_~i~0 5)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {1381#(<= ULTIMATE.start_main_~i~0 6)} is VALID [2020-07-28 18:12:16,351 INFO L280 TraceCheckUtils]: 16: Hoare triple {1381#(<= ULTIMATE.start_main_~i~0 6)} assume !!(main_~i~0 <= main_~n~0); {1381#(<= ULTIMATE.start_main_~i~0 6)} is VALID [2020-07-28 18:12:16,351 INFO L280 TraceCheckUtils]: 17: Hoare triple {1381#(<= ULTIMATE.start_main_~i~0 6)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {1381#(<= ULTIMATE.start_main_~i~0 6)} is VALID [2020-07-28 18:12:16,352 INFO L280 TraceCheckUtils]: 18: Hoare triple {1381#(<= ULTIMATE.start_main_~i~0 6)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {1382#(<= ULTIMATE.start_main_~i~0 7)} is VALID [2020-07-28 18:12:16,352 INFO L280 TraceCheckUtils]: 19: Hoare triple {1382#(<= ULTIMATE.start_main_~i~0 7)} assume !!(main_~i~0 <= main_~n~0); {1382#(<= ULTIMATE.start_main_~i~0 7)} is VALID [2020-07-28 18:12:16,353 INFO L280 TraceCheckUtils]: 20: Hoare triple {1382#(<= ULTIMATE.start_main_~i~0 7)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {1382#(<= ULTIMATE.start_main_~i~0 7)} is VALID [2020-07-28 18:12:16,353 INFO L280 TraceCheckUtils]: 21: Hoare triple {1382#(<= ULTIMATE.start_main_~i~0 7)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {1383#(<= ULTIMATE.start_main_~i~0 8)} is VALID [2020-07-28 18:12:16,354 INFO L280 TraceCheckUtils]: 22: Hoare triple {1383#(<= ULTIMATE.start_main_~i~0 8)} assume !!(main_~i~0 <= main_~n~0); {1383#(<= ULTIMATE.start_main_~i~0 8)} is VALID [2020-07-28 18:12:16,354 INFO L280 TraceCheckUtils]: 23: Hoare triple {1383#(<= ULTIMATE.start_main_~i~0 8)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {1383#(<= ULTIMATE.start_main_~i~0 8)} is VALID [2020-07-28 18:12:16,355 INFO L280 TraceCheckUtils]: 24: Hoare triple {1383#(<= ULTIMATE.start_main_~i~0 8)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {1384#(<= ULTIMATE.start_main_~i~0 9)} is VALID [2020-07-28 18:12:16,355 INFO L280 TraceCheckUtils]: 25: Hoare triple {1384#(<= ULTIMATE.start_main_~i~0 9)} assume !!(main_~i~0 <= main_~n~0); {1384#(<= ULTIMATE.start_main_~i~0 9)} is VALID [2020-07-28 18:12:16,356 INFO L280 TraceCheckUtils]: 26: Hoare triple {1384#(<= ULTIMATE.start_main_~i~0 9)} assume !(main_~i~0 < 10); {1375#false} is VALID [2020-07-28 18:12:16,356 INFO L280 TraceCheckUtils]: 27: Hoare triple {1375#false} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {1375#false} is VALID [2020-07-28 18:12:16,356 INFO L280 TraceCheckUtils]: 28: Hoare triple {1375#false} assume !(main_~i~0 <= main_~n~0); {1375#false} is VALID [2020-07-28 18:12:16,356 INFO L280 TraceCheckUtils]: 29: Hoare triple {1375#false} __VERIFIER_assert_#in~cond := (if main_~sn~0 == 2 * main_~n~0 || 0 == main_~sn~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1375#false} is VALID [2020-07-28 18:12:16,356 INFO L280 TraceCheckUtils]: 30: Hoare triple {1375#false} assume 0 == __VERIFIER_assert_~cond; {1375#false} is VALID [2020-07-28 18:12:16,356 INFO L280 TraceCheckUtils]: 31: Hoare triple {1375#false} assume !false; {1375#false} is VALID [2020-07-28 18:12:16,358 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 17 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:16,358 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46308041] [2020-07-28 18:12:16,358 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938784749] [2020-07-28 18:12:16,358 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:16,397 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2020-07-28 18:12:16,398 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 18:12:16,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-28 18:12:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:16,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:12:16,655 INFO L280 TraceCheckUtils]: 0: Hoare triple {1374#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~i~0, main_~n~0, main_~sn~0;havoc main_~i~0;main_~n~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;main_~sn~0 := 0;main_~i~0 := 1; {1376#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:16,656 INFO L280 TraceCheckUtils]: 1: Hoare triple {1376#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 <= main_~n~0); {1376#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:16,656 INFO L280 TraceCheckUtils]: 2: Hoare triple {1376#(<= ULTIMATE.start_main_~i~0 1)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {1376#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:16,657 INFO L280 TraceCheckUtils]: 3: Hoare triple {1376#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {1377#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:12:16,657 INFO L280 TraceCheckUtils]: 4: Hoare triple {1377#(<= ULTIMATE.start_main_~i~0 2)} assume !!(main_~i~0 <= main_~n~0); {1377#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:12:16,658 INFO L280 TraceCheckUtils]: 5: Hoare triple {1377#(<= ULTIMATE.start_main_~i~0 2)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {1377#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:12:16,658 INFO L280 TraceCheckUtils]: 6: Hoare triple {1377#(<= ULTIMATE.start_main_~i~0 2)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {1378#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-28 18:12:16,659 INFO L280 TraceCheckUtils]: 7: Hoare triple {1378#(<= ULTIMATE.start_main_~i~0 3)} assume !!(main_~i~0 <= main_~n~0); {1378#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-28 18:12:16,659 INFO L280 TraceCheckUtils]: 8: Hoare triple {1378#(<= ULTIMATE.start_main_~i~0 3)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {1378#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-28 18:12:16,660 INFO L280 TraceCheckUtils]: 9: Hoare triple {1378#(<= ULTIMATE.start_main_~i~0 3)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {1379#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-28 18:12:16,660 INFO L280 TraceCheckUtils]: 10: Hoare triple {1379#(<= ULTIMATE.start_main_~i~0 4)} assume !!(main_~i~0 <= main_~n~0); {1379#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-28 18:12:16,661 INFO L280 TraceCheckUtils]: 11: Hoare triple {1379#(<= ULTIMATE.start_main_~i~0 4)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {1379#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-28 18:12:16,662 INFO L280 TraceCheckUtils]: 12: Hoare triple {1379#(<= ULTIMATE.start_main_~i~0 4)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {1380#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-28 18:12:16,662 INFO L280 TraceCheckUtils]: 13: Hoare triple {1380#(<= ULTIMATE.start_main_~i~0 5)} assume !!(main_~i~0 <= main_~n~0); {1380#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-28 18:12:16,663 INFO L280 TraceCheckUtils]: 14: Hoare triple {1380#(<= ULTIMATE.start_main_~i~0 5)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {1380#(<= ULTIMATE.start_main_~i~0 5)} is VALID [2020-07-28 18:12:16,663 INFO L280 TraceCheckUtils]: 15: Hoare triple {1380#(<= ULTIMATE.start_main_~i~0 5)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {1381#(<= ULTIMATE.start_main_~i~0 6)} is VALID [2020-07-28 18:12:16,664 INFO L280 TraceCheckUtils]: 16: Hoare triple {1381#(<= ULTIMATE.start_main_~i~0 6)} assume !!(main_~i~0 <= main_~n~0); {1381#(<= ULTIMATE.start_main_~i~0 6)} is VALID [2020-07-28 18:12:16,664 INFO L280 TraceCheckUtils]: 17: Hoare triple {1381#(<= ULTIMATE.start_main_~i~0 6)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {1381#(<= ULTIMATE.start_main_~i~0 6)} is VALID [2020-07-28 18:12:16,665 INFO L280 TraceCheckUtils]: 18: Hoare triple {1381#(<= ULTIMATE.start_main_~i~0 6)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {1382#(<= ULTIMATE.start_main_~i~0 7)} is VALID [2020-07-28 18:12:16,665 INFO L280 TraceCheckUtils]: 19: Hoare triple {1382#(<= ULTIMATE.start_main_~i~0 7)} assume !!(main_~i~0 <= main_~n~0); {1382#(<= ULTIMATE.start_main_~i~0 7)} is VALID [2020-07-28 18:12:16,666 INFO L280 TraceCheckUtils]: 20: Hoare triple {1382#(<= ULTIMATE.start_main_~i~0 7)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {1382#(<= ULTIMATE.start_main_~i~0 7)} is VALID [2020-07-28 18:12:16,667 INFO L280 TraceCheckUtils]: 21: Hoare triple {1382#(<= ULTIMATE.start_main_~i~0 7)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {1383#(<= ULTIMATE.start_main_~i~0 8)} is VALID [2020-07-28 18:12:16,667 INFO L280 TraceCheckUtils]: 22: Hoare triple {1383#(<= ULTIMATE.start_main_~i~0 8)} assume !!(main_~i~0 <= main_~n~0); {1383#(<= ULTIMATE.start_main_~i~0 8)} is VALID [2020-07-28 18:12:16,668 INFO L280 TraceCheckUtils]: 23: Hoare triple {1383#(<= ULTIMATE.start_main_~i~0 8)} assume main_~i~0 < 10;main_~sn~0 := 2 + main_~sn~0; {1383#(<= ULTIMATE.start_main_~i~0 8)} is VALID [2020-07-28 18:12:16,668 INFO L280 TraceCheckUtils]: 24: Hoare triple {1383#(<= ULTIMATE.start_main_~i~0 8)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {1384#(<= ULTIMATE.start_main_~i~0 9)} is VALID [2020-07-28 18:12:16,669 INFO L280 TraceCheckUtils]: 25: Hoare triple {1384#(<= ULTIMATE.start_main_~i~0 9)} assume !!(main_~i~0 <= main_~n~0); {1384#(<= ULTIMATE.start_main_~i~0 9)} is VALID [2020-07-28 18:12:16,670 INFO L280 TraceCheckUtils]: 26: Hoare triple {1384#(<= ULTIMATE.start_main_~i~0 9)} assume !(main_~i~0 < 10); {1375#false} is VALID [2020-07-28 18:12:16,670 INFO L280 TraceCheckUtils]: 27: Hoare triple {1375#false} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {1375#false} is VALID [2020-07-28 18:12:16,670 INFO L280 TraceCheckUtils]: 28: Hoare triple {1375#false} assume !(main_~i~0 <= main_~n~0); {1375#false} is VALID [2020-07-28 18:12:16,671 INFO L280 TraceCheckUtils]: 29: Hoare triple {1375#false} __VERIFIER_assert_#in~cond := (if main_~sn~0 == 2 * main_~n~0 || 0 == main_~sn~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1375#false} is VALID [2020-07-28 18:12:16,671 INFO L280 TraceCheckUtils]: 30: Hoare triple {1375#false} assume 0 == __VERIFIER_assert_~cond; {1375#false} is VALID [2020-07-28 18:12:16,671 INFO L280 TraceCheckUtils]: 31: Hoare triple {1375#false} assume !false; {1375#false} is VALID [2020-07-28 18:12:16,673 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 17 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:16,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:12:16,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2020-07-28 18:12:16,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243677093] [2020-07-28 18:12:16,674 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2020-07-28 18:12:16,674 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:12:16,674 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-28 18:12:16,723 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:16,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-28 18:12:16,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:12:16,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-28 18:12:16,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-07-28 18:12:16,724 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 11 states. [2020-07-28 18:12:16,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:16,862 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2020-07-28 18:12:16,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-28 18:12:16,862 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2020-07-28 18:12:16,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:12:16,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-28 18:12:16,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 45 transitions. [2020-07-28 18:12:16,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-28 18:12:16,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 45 transitions. [2020-07-28 18:12:16,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 45 transitions. [2020-07-28 18:12:16,924 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:16,925 INFO L225 Difference]: With dead ends: 45 [2020-07-28 18:12:16,926 INFO L226 Difference]: Without dead ends: 38 [2020-07-28 18:12:16,927 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-07-28 18:12:16,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-28 18:12:16,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2020-07-28 18:12:16,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:12:16,957 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 37 states. [2020-07-28 18:12:16,957 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 37 states. [2020-07-28 18:12:16,957 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 37 states. [2020-07-28 18:12:16,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:16,959 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2020-07-28 18:12:16,959 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2020-07-28 18:12:16,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:16,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:16,961 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 38 states. [2020-07-28 18:12:16,961 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 38 states. [2020-07-28 18:12:16,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:16,962 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2020-07-28 18:12:16,962 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2020-07-28 18:12:16,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:16,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:16,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:12:16,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:12:16,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-28 18:12:16,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2020-07-28 18:12:16,964 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 32 [2020-07-28 18:12:16,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:12:16,964 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2020-07-28 18:12:16,964 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-28 18:12:16,964 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-28 18:12:16,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-28 18:12:16,965 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:16,965 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1] [2020-07-28 18:12:17,173 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:17,174 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:17,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:17,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1243411891, now seen corresponding path program 6 times [2020-07-28 18:12:17,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:17,176 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201988577] [2020-07-28 18:12:17,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:17,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 18:12:17,205 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 18:12:17,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 18:12:17,236 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 18:12:17,258 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-28 18:12:17,258 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-28 18:12:17,259 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-28 18:12:17,297 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 18:12:17,297 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-28 18:12:17,297 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-28 18:12:17,297 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-28 18:12:17,297 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2020-07-28 18:12:17,297 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-28 18:12:17,297 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-28 18:12:17,297 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-28 18:12:17,297 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-28 18:12:17,298 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2020-07-28 18:12:17,298 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-28 18:12:17,298 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-28 18:12:17,298 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-28 18:12:17,298 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:12:17,298 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 18:12:17,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 06:12:17 BoogieIcfgContainer [2020-07-28 18:12:17,301 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 18:12:17,301 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 18:12:17,301 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 18:12:17,301 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 18:12:17,302 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:12:08" (3/4) ... [2020-07-28 18:12:17,304 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-07-28 18:12:17,408 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 18:12:17,408 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 18:12:17,412 INFO L168 Benchmark]: Toolchain (without parser) took 9566.91 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 284.2 MB). Free memory was 954.9 MB in the beginning and 939.5 MB in the end (delta: 15.3 MB). Peak memory consumption was 299.5 MB. Max. memory is 11.5 GB. [2020-07-28 18:12:17,412 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:12:17,413 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.11 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 944.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:12:17,413 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 944.1 MB in the beginning and 1.1 GB in the end (delta: -193.1 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2020-07-28 18:12:17,414 INFO L168 Benchmark]: Boogie Preprocessor took 24.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2020-07-28 18:12:17,414 INFO L168 Benchmark]: RCFGBuilder took 275.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 11.5 GB. [2020-07-28 18:12:17,415 INFO L168 Benchmark]: TraceAbstraction took 8759.29 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 143.7 MB). Free memory was 1.1 GB in the beginning and 939.5 MB in the end (delta: 172.0 MB). Peak memory consumption was 315.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:12:17,415 INFO L168 Benchmark]: Witness Printer took 107.16 ms. Allocated memory is still 1.3 GB. Free memory was 939.5 MB in the beginning and 939.5 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2020-07-28 18:12:17,418 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 303.11 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 944.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 89.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 944.1 MB in the beginning and 1.1 GB in the end (delta: -193.1 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 275.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8759.29 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 143.7 MB). Free memory was 1.1 GB in the beginning and 939.5 MB in the end (delta: 172.0 MB). Peak memory consumption was 315.7 MB. Max. memory is 11.5 GB. * Witness Printer took 107.16 ms. Allocated memory is still 1.3 GB. Free memory was 939.5 MB in the beginning and 939.5 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L13] i=1 [L13] COND TRUE i<=n [L14] COND TRUE i<10 [L15] sn = sn + (2) [L13] i++ [L13] COND TRUE i<=n [L14] COND TRUE i<10 [L15] sn = sn + (2) [L13] i++ [L13] COND TRUE i<=n [L14] COND TRUE i<10 [L15] sn = sn + (2) [L13] i++ [L13] COND TRUE i<=n [L14] COND TRUE i<10 [L15] sn = sn + (2) [L13] i++ [L13] COND TRUE i<=n [L14] COND TRUE i<10 [L15] sn = sn + (2) [L13] i++ [L13] COND TRUE i<=n [L14] COND TRUE i<10 [L15] sn = sn + (2) [L13] i++ [L13] COND TRUE i<=n [L14] COND TRUE i<10 [L15] sn = sn + (2) [L13] i++ [L13] COND TRUE i<=n [L14] COND TRUE i<10 [L15] sn = sn + (2) [L13] i++ [L13] COND TRUE i<=n [L14] COND TRUE i<10 [L15] sn = sn + (2) [L13] i++ [L13] COND TRUE i<=n [L14] COND FALSE !(i<10) [L13] i++ [L13] COND FALSE !(i<=n) [L4] COND TRUE !(cond) [L5] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8.6s, OverallIterations: 10, TraceHistogramMax: 10, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 56 SDtfs, 73 SDslu, 103 SDs, 0 SdLazy, 388 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 229 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 8 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 349 NumberOfCodeBlocks, 349 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 298 ConstructedInterpolants, 0 QuantifiedInterpolants, 21122 SizeOfPredicates, 15 NumberOfNonLiveVariables, 336 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 16 InterpolantComputations, 2 PerfectInterpolantSequences, 135/756 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 incorrect! Received shutdown request...