/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/sum04-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:50:32,141 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:50:32,144 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:50:32,163 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:50:32,164 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:50:32,166 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:50:32,168 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:50:32,182 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:50:32,184 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:50:32,185 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:50:32,186 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:50:32,187 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:50:32,187 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:50:32,188 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:50:32,189 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:50:32,190 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:50:32,191 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:50:32,192 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:50:32,194 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:50:32,196 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:50:32,197 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:50:32,198 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:50:32,199 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:50:32,200 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:50:32,202 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:50:32,202 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:50:32,203 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:50:32,204 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:50:32,204 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:50:32,205 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:50:32,205 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:50:32,206 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:50:32,207 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:50:32,207 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:50:32,208 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:50:32,209 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:50:32,209 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:50:32,210 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:50:32,210 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:50:32,211 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:50:32,212 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:50:32,212 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:50:32,227 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:50:32,227 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:50:32,228 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:50:32,229 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:50:32,229 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:50:32,229 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:50:32,229 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:50:32,230 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:50:32,230 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:50:32,230 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:50:32,230 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:50:32,230 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:50:32,231 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:50:32,231 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:50:32,231 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:50:32,231 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:50:32,231 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:50:32,232 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:50:32,232 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:50:32,232 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:50:32,232 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:50:32,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:50:32,233 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:50:32,233 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:50:32,233 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:50:32,233 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:50:32,233 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:50:32,234 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:50:32,234 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:50:32,234 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:50:32,564 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:50:32,577 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:50:32,579 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:50:32,580 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:50:32,581 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:50:32,581 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum04-2.i [2020-07-17 22:50:32,644 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef3e1a2f5/55d5caaa7b7f4f0b9adfd71658c7191b/FLAG263e7f254 [2020-07-17 22:50:33,087 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:50:33,089 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04-2.i [2020-07-17 22:50:33,096 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef3e1a2f5/55d5caaa7b7f4f0b9adfd71658c7191b/FLAG263e7f254 [2020-07-17 22:50:33,473 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef3e1a2f5/55d5caaa7b7f4f0b9adfd71658c7191b [2020-07-17 22:50:33,486 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:50:33,490 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:50:33,491 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:50:33,491 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:50:33,495 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:50:33,497 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:50:33" (1/1) ... [2020-07-17 22:50:33,500 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77eacc4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:33, skipping insertion in model container [2020-07-17 22:50:33,500 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:50:33" (1/1) ... [2020-07-17 22:50:33,510 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:50:33,532 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:50:33,759 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:50:33,763 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:50:33,779 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:50:33,794 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:50:33,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:33 WrapperNode [2020-07-17 22:50:33,794 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:50:33,795 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:50:33,795 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:50:33,795 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:50:33,810 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:33" (1/1) ... [2020-07-17 22:50:33,810 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:33" (1/1) ... [2020-07-17 22:50:33,815 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:33" (1/1) ... [2020-07-17 22:50:33,816 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:33" (1/1) ... [2020-07-17 22:50:33,821 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:33" (1/1) ... [2020-07-17 22:50:33,826 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:33" (1/1) ... [2020-07-17 22:50:33,827 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:33" (1/1) ... [2020-07-17 22:50:33,909 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:50:33,910 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:50:33,910 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:50:33,910 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:50:33,911 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:33" (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-17 22:50:33,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:50:33,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:50:33,974 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:50:33,974 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:50:33,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:50:33,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:50:33,975 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:50:33,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:50:33,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:50:34,189 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:50:34,189 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-17 22:50:34,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:50:34 BoogieIcfgContainer [2020-07-17 22:50:34,193 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:50:34,194 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:50:34,194 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:50:34,197 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:50:34,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:50:33" (1/3) ... [2020-07-17 22:50:34,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@533aeb6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:50:34, skipping insertion in model container [2020-07-17 22:50:34,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:33" (2/3) ... [2020-07-17 22:50:34,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@533aeb6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:50:34, skipping insertion in model container [2020-07-17 22:50:34,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:50:34" (3/3) ... [2020-07-17 22:50:34,200 INFO L109 eAbstractionObserver]: Analyzing ICFG sum04-2.i [2020-07-17 22:50:34,209 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:50:34,214 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:50:34,226 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:50:34,248 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:50:34,248 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:50:34,248 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:50:34,248 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:50:34,248 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:50:34,249 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:50:34,249 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:50:34,249 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:50:34,266 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-07-17 22:50:34,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-17 22:50:34,270 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:34,271 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:34,271 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:34,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:34,276 INFO L82 PathProgramCache]: Analyzing trace with hash -10373566, now seen corresponding path program 1 times [2020-07-17 22:50:34,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:34,285 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981911383] [2020-07-17 22:50:34,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:34,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:34,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:34,437 INFO L280 TraceCheckUtils]: 0: Hoare triple {21#true} assume true; {21#true} is VALID [2020-07-17 22:50:34,441 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {21#true} {21#true} #32#return; {21#true} is VALID [2020-07-17 22:50:34,446 INFO L263 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {21#true} is VALID [2020-07-17 22:50:34,450 INFO L280 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2020-07-17 22:50:34,451 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #32#return; {21#true} is VALID [2020-07-17 22:50:34,451 INFO L263 TraceCheckUtils]: 3: Hoare triple {21#true} call #t~ret1 := main(); {21#true} is VALID [2020-07-17 22:50:34,452 INFO L280 TraceCheckUtils]: 4: Hoare triple {21#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {21#true} is VALID [2020-07-17 22:50:34,470 INFO L280 TraceCheckUtils]: 5: Hoare triple {21#true} assume !true; {22#false} is VALID [2020-07-17 22:50:34,471 INFO L263 TraceCheckUtils]: 6: Hoare triple {22#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {22#false} is VALID [2020-07-17 22:50:34,471 INFO L280 TraceCheckUtils]: 7: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2020-07-17 22:50:34,472 INFO L280 TraceCheckUtils]: 8: Hoare triple {22#false} assume 0 == ~cond; {22#false} is VALID [2020-07-17 22:50:34,472 INFO L280 TraceCheckUtils]: 9: Hoare triple {22#false} assume !false; {22#false} is VALID [2020-07-17 22:50:34,473 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-17 22:50:34,474 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981911383] [2020-07-17 22:50:34,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:50:34,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-17 22:50:34,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36540784] [2020-07-17 22:50:34,484 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-17 22:50:34,489 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:34,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-17 22:50:34,549 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:34,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-17 22:50:34,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:34,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-17 22:50:34,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-17 22:50:34,562 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2020-07-17 22:50:34,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:34,628 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2020-07-17 22:50:34,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-17 22:50:34,629 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-17 22:50:34,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:34,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-17 22:50:34,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2020-07-17 22:50:34,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-17 22:50:34,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2020-07-17 22:50:34,654 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 32 transitions. [2020-07-17 22:50:34,748 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-17 22:50:34,759 INFO L225 Difference]: With dead ends: 29 [2020-07-17 22:50:34,760 INFO L226 Difference]: Without dead ends: 12 [2020-07-17 22:50:34,764 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 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-17 22:50:34,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-07-17 22:50:34,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-07-17 22:50:34,810 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:34,811 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2020-07-17 22:50:34,811 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2020-07-17 22:50:34,812 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2020-07-17 22:50:34,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:34,815 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2020-07-17 22:50:34,815 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2020-07-17 22:50:34,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:34,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:34,817 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2020-07-17 22:50:34,817 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2020-07-17 22:50:34,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:34,820 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2020-07-17 22:50:34,821 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2020-07-17 22:50:34,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:34,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:34,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:34,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:34,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-17 22:50:34,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2020-07-17 22:50:34,826 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2020-07-17 22:50:34,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:34,827 INFO L479 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2020-07-17 22:50:34,827 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-17 22:50:34,827 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2020-07-17 22:50:34,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-17 22:50:34,828 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:34,828 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:34,829 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:50:34,829 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:34,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:34,830 INFO L82 PathProgramCache]: Analyzing trace with hash -15914692, now seen corresponding path program 1 times [2020-07-17 22:50:34,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:34,830 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789799574] [2020-07-17 22:50:34,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:34,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:34,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:34,890 INFO L280 TraceCheckUtils]: 0: Hoare triple {108#true} assume true; {108#true} is VALID [2020-07-17 22:50:34,891 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {108#true} {108#true} #32#return; {108#true} is VALID [2020-07-17 22:50:34,891 INFO L263 TraceCheckUtils]: 0: Hoare triple {108#true} call ULTIMATE.init(); {108#true} is VALID [2020-07-17 22:50:34,891 INFO L280 TraceCheckUtils]: 1: Hoare triple {108#true} assume true; {108#true} is VALID [2020-07-17 22:50:34,892 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {108#true} {108#true} #32#return; {108#true} is VALID [2020-07-17 22:50:34,892 INFO L263 TraceCheckUtils]: 3: Hoare triple {108#true} call #t~ret1 := main(); {108#true} is VALID [2020-07-17 22:50:34,894 INFO L280 TraceCheckUtils]: 4: Hoare triple {108#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {112#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:34,895 INFO L280 TraceCheckUtils]: 5: Hoare triple {112#(<= main_~i~0 1)} assume !(~i~0 <= 8); {109#false} is VALID [2020-07-17 22:50:34,896 INFO L263 TraceCheckUtils]: 6: Hoare triple {109#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {109#false} is VALID [2020-07-17 22:50:34,896 INFO L280 TraceCheckUtils]: 7: Hoare triple {109#false} ~cond := #in~cond; {109#false} is VALID [2020-07-17 22:50:34,896 INFO L280 TraceCheckUtils]: 8: Hoare triple {109#false} assume 0 == ~cond; {109#false} is VALID [2020-07-17 22:50:34,897 INFO L280 TraceCheckUtils]: 9: Hoare triple {109#false} assume !false; {109#false} is VALID [2020-07-17 22:50:34,898 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-17 22:50:34,898 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789799574] [2020-07-17 22:50:34,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:50:34,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:50:34,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080697544] [2020-07-17 22:50:34,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-17 22:50:34,901 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:34,901 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:50:34,919 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:34,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:50:34,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:34,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:50:34,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:50:34,921 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2020-07-17 22:50:34,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:34,968 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2020-07-17 22:50:34,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:50:34,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-17 22:50:34,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:34,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:50:34,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2020-07-17 22:50:34,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:50:34,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2020-07-17 22:50:34,973 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 19 transitions. [2020-07-17 22:50:35,002 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:35,003 INFO L225 Difference]: With dead ends: 19 [2020-07-17 22:50:35,004 INFO L226 Difference]: Without dead ends: 14 [2020-07-17 22:50:35,005 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:50:35,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-17 22:50:35,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2020-07-17 22:50:35,013 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:35,014 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 13 states. [2020-07-17 22:50:35,014 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 13 states. [2020-07-17 22:50:35,014 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 13 states. [2020-07-17 22:50:35,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:35,016 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2020-07-17 22:50:35,016 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-07-17 22:50:35,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:35,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:35,017 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 14 states. [2020-07-17 22:50:35,017 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 14 states. [2020-07-17 22:50:35,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:35,019 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2020-07-17 22:50:35,019 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-07-17 22:50:35,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:35,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:35,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:35,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:35,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-17 22:50:35,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2020-07-17 22:50:35,022 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2020-07-17 22:50:35,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:35,022 INFO L479 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2020-07-17 22:50:35,022 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:50:35,023 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2020-07-17 22:50:35,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-17 22:50:35,023 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:35,023 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:35,024 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:50:35,024 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:35,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:35,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1244203718, now seen corresponding path program 1 times [2020-07-17 22:50:35,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:35,025 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642638734] [2020-07-17 22:50:35,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:35,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:35,099 INFO L280 TraceCheckUtils]: 0: Hoare triple {193#true} assume true; {193#true} is VALID [2020-07-17 22:50:35,099 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {193#true} {193#true} #32#return; {193#true} is VALID [2020-07-17 22:50:35,100 INFO L263 TraceCheckUtils]: 0: Hoare triple {193#true} call ULTIMATE.init(); {193#true} is VALID [2020-07-17 22:50:35,100 INFO L280 TraceCheckUtils]: 1: Hoare triple {193#true} assume true; {193#true} is VALID [2020-07-17 22:50:35,101 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {193#true} {193#true} #32#return; {193#true} is VALID [2020-07-17 22:50:35,101 INFO L263 TraceCheckUtils]: 3: Hoare triple {193#true} call #t~ret1 := main(); {193#true} is VALID [2020-07-17 22:50:35,105 INFO L280 TraceCheckUtils]: 4: Hoare triple {193#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {197#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:35,106 INFO L280 TraceCheckUtils]: 5: Hoare triple {197#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {197#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:35,109 INFO L280 TraceCheckUtils]: 6: Hoare triple {197#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {198#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:35,110 INFO L280 TraceCheckUtils]: 7: Hoare triple {198#(<= main_~i~0 2)} assume !(~i~0 <= 8); {194#false} is VALID [2020-07-17 22:50:35,110 INFO L263 TraceCheckUtils]: 8: Hoare triple {194#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {194#false} is VALID [2020-07-17 22:50:35,111 INFO L280 TraceCheckUtils]: 9: Hoare triple {194#false} ~cond := #in~cond; {194#false} is VALID [2020-07-17 22:50:35,111 INFO L280 TraceCheckUtils]: 10: Hoare triple {194#false} assume 0 == ~cond; {194#false} is VALID [2020-07-17 22:50:35,112 INFO L280 TraceCheckUtils]: 11: Hoare triple {194#false} assume !false; {194#false} is VALID [2020-07-17 22:50:35,115 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-17 22:50:35,115 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642638734] [2020-07-17 22:50:35,116 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086569350] [2020-07-17 22:50:35,116 INFO L94 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-17 22:50:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:35,157 INFO L264 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-17 22:50:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:35,170 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:35,235 INFO L263 TraceCheckUtils]: 0: Hoare triple {193#true} call ULTIMATE.init(); {193#true} is VALID [2020-07-17 22:50:35,236 INFO L280 TraceCheckUtils]: 1: Hoare triple {193#true} assume true; {193#true} is VALID [2020-07-17 22:50:35,236 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {193#true} {193#true} #32#return; {193#true} is VALID [2020-07-17 22:50:35,237 INFO L263 TraceCheckUtils]: 3: Hoare triple {193#true} call #t~ret1 := main(); {193#true} is VALID [2020-07-17 22:50:35,238 INFO L280 TraceCheckUtils]: 4: Hoare triple {193#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {197#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:35,239 INFO L280 TraceCheckUtils]: 5: Hoare triple {197#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {197#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:35,240 INFO L280 TraceCheckUtils]: 6: Hoare triple {197#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {198#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:35,242 INFO L280 TraceCheckUtils]: 7: Hoare triple {198#(<= main_~i~0 2)} assume !(~i~0 <= 8); {194#false} is VALID [2020-07-17 22:50:35,242 INFO L263 TraceCheckUtils]: 8: Hoare triple {194#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {194#false} is VALID [2020-07-17 22:50:35,242 INFO L280 TraceCheckUtils]: 9: Hoare triple {194#false} ~cond := #in~cond; {194#false} is VALID [2020-07-17 22:50:35,243 INFO L280 TraceCheckUtils]: 10: Hoare triple {194#false} assume 0 == ~cond; {194#false} is VALID [2020-07-17 22:50:35,243 INFO L280 TraceCheckUtils]: 11: Hoare triple {194#false} assume !false; {194#false} is VALID [2020-07-17 22:50:35,244 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-17 22:50:35,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:50:35,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-07-17 22:50:35,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854736170] [2020-07-17 22:50:35,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-07-17 22:50:35,246 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:35,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:50:35,264 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:35,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:50:35,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:35,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:50:35,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:50:35,266 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 4 states. [2020-07-17 22:50:35,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:35,333 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2020-07-17 22:50:35,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:50:35,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-07-17 22:50:35,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:35,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:50:35,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2020-07-17 22:50:35,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:50:35,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2020-07-17 22:50:35,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 21 transitions. [2020-07-17 22:50:35,366 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-17 22:50:35,367 INFO L225 Difference]: With dead ends: 21 [2020-07-17 22:50:35,367 INFO L226 Difference]: Without dead ends: 16 [2020-07-17 22:50:35,368 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:50:35,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-17 22:50:35,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-07-17 22:50:35,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:35,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 15 states. [2020-07-17 22:50:35,384 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 15 states. [2020-07-17 22:50:35,384 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 15 states. [2020-07-17 22:50:35,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:35,386 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-07-17 22:50:35,386 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-17 22:50:35,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:35,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:35,387 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 16 states. [2020-07-17 22:50:35,387 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 16 states. [2020-07-17 22:50:35,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:35,389 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-07-17 22:50:35,389 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-17 22:50:35,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:35,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:35,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:35,390 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:35,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-17 22:50:35,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2020-07-17 22:50:35,391 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2020-07-17 22:50:35,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:35,391 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2020-07-17 22:50:35,392 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:50:35,392 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2020-07-17 22:50:35,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-17 22:50:35,392 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:35,393 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:35,605 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-17 22:50:35,605 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:35,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:35,606 INFO L82 PathProgramCache]: Analyzing trace with hash -513951304, now seen corresponding path program 2 times [2020-07-17 22:50:35,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:35,607 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033855280] [2020-07-17 22:50:35,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:35,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:35,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:35,675 INFO L280 TraceCheckUtils]: 0: Hoare triple {322#true} assume true; {322#true} is VALID [2020-07-17 22:50:35,675 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {322#true} {322#true} #32#return; {322#true} is VALID [2020-07-17 22:50:35,675 INFO L263 TraceCheckUtils]: 0: Hoare triple {322#true} call ULTIMATE.init(); {322#true} is VALID [2020-07-17 22:50:35,676 INFO L280 TraceCheckUtils]: 1: Hoare triple {322#true} assume true; {322#true} is VALID [2020-07-17 22:50:35,676 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {322#true} {322#true} #32#return; {322#true} is VALID [2020-07-17 22:50:35,676 INFO L263 TraceCheckUtils]: 3: Hoare triple {322#true} call #t~ret1 := main(); {322#true} is VALID [2020-07-17 22:50:35,677 INFO L280 TraceCheckUtils]: 4: Hoare triple {322#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {326#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:35,679 INFO L280 TraceCheckUtils]: 5: Hoare triple {326#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {326#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:35,682 INFO L280 TraceCheckUtils]: 6: Hoare triple {326#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {327#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:35,683 INFO L280 TraceCheckUtils]: 7: Hoare triple {327#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {327#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:35,685 INFO L280 TraceCheckUtils]: 8: Hoare triple {327#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {328#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:35,686 INFO L280 TraceCheckUtils]: 9: Hoare triple {328#(<= main_~i~0 3)} assume !(~i~0 <= 8); {323#false} is VALID [2020-07-17 22:50:35,686 INFO L263 TraceCheckUtils]: 10: Hoare triple {323#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {323#false} is VALID [2020-07-17 22:50:35,686 INFO L280 TraceCheckUtils]: 11: Hoare triple {323#false} ~cond := #in~cond; {323#false} is VALID [2020-07-17 22:50:35,687 INFO L280 TraceCheckUtils]: 12: Hoare triple {323#false} assume 0 == ~cond; {323#false} is VALID [2020-07-17 22:50:35,687 INFO L280 TraceCheckUtils]: 13: Hoare triple {323#false} assume !false; {323#false} is VALID [2020-07-17 22:50:35,687 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:35,688 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033855280] [2020-07-17 22:50:35,688 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228382665] [2020-07-17 22:50:35,688 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:35,722 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:50:35,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:50:35,723 INFO L264 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-17 22:50:35,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:35,730 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:35,774 INFO L263 TraceCheckUtils]: 0: Hoare triple {322#true} call ULTIMATE.init(); {322#true} is VALID [2020-07-17 22:50:35,774 INFO L280 TraceCheckUtils]: 1: Hoare triple {322#true} assume true; {322#true} is VALID [2020-07-17 22:50:35,774 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {322#true} {322#true} #32#return; {322#true} is VALID [2020-07-17 22:50:35,775 INFO L263 TraceCheckUtils]: 3: Hoare triple {322#true} call #t~ret1 := main(); {322#true} is VALID [2020-07-17 22:50:35,776 INFO L280 TraceCheckUtils]: 4: Hoare triple {322#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {326#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:35,777 INFO L280 TraceCheckUtils]: 5: Hoare triple {326#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {326#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:35,778 INFO L280 TraceCheckUtils]: 6: Hoare triple {326#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {327#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:35,779 INFO L280 TraceCheckUtils]: 7: Hoare triple {327#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {327#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:35,781 INFO L280 TraceCheckUtils]: 8: Hoare triple {327#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {328#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:35,782 INFO L280 TraceCheckUtils]: 9: Hoare triple {328#(<= main_~i~0 3)} assume !(~i~0 <= 8); {323#false} is VALID [2020-07-17 22:50:35,782 INFO L263 TraceCheckUtils]: 10: Hoare triple {323#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {323#false} is VALID [2020-07-17 22:50:35,783 INFO L280 TraceCheckUtils]: 11: Hoare triple {323#false} ~cond := #in~cond; {323#false} is VALID [2020-07-17 22:50:35,783 INFO L280 TraceCheckUtils]: 12: Hoare triple {323#false} assume 0 == ~cond; {323#false} is VALID [2020-07-17 22:50:35,783 INFO L280 TraceCheckUtils]: 13: Hoare triple {323#false} assume !false; {323#false} is VALID [2020-07-17 22:50:35,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:35,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:50:35,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-07-17 22:50:35,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51437869] [2020-07-17 22:50:35,785 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-17 22:50:35,785 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:35,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:50:35,805 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:35,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:50:35,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:35,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:50:35,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:50:35,806 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 5 states. [2020-07-17 22:50:35,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:35,871 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2020-07-17 22:50:35,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:50:35,871 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-17 22:50:35,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:35,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:50:35,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2020-07-17 22:50:35,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:50:35,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2020-07-17 22:50:35,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 23 transitions. [2020-07-17 22:50:35,914 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-17 22:50:35,915 INFO L225 Difference]: With dead ends: 23 [2020-07-17 22:50:35,916 INFO L226 Difference]: Without dead ends: 18 [2020-07-17 22:50:35,916 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:50:35,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-17 22:50:35,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2020-07-17 22:50:35,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:35,928 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 17 states. [2020-07-17 22:50:35,928 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 17 states. [2020-07-17 22:50:35,928 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 17 states. [2020-07-17 22:50:35,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:35,930 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2020-07-17 22:50:35,930 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2020-07-17 22:50:35,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:35,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:35,931 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 18 states. [2020-07-17 22:50:35,931 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 18 states. [2020-07-17 22:50:35,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:35,933 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2020-07-17 22:50:35,933 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2020-07-17 22:50:35,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:35,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:35,934 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:35,934 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:35,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-17 22:50:35,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2020-07-17 22:50:35,936 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2020-07-17 22:50:35,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:35,936 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2020-07-17 22:50:35,936 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:50:35,936 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2020-07-17 22:50:35,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-17 22:50:35,937 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:35,937 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:36,138 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:36,138 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:36,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:36,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1178949302, now seen corresponding path program 3 times [2020-07-17 22:50:36,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:36,139 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501044956] [2020-07-17 22:50:36,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:36,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:36,214 INFO L280 TraceCheckUtils]: 0: Hoare triple {468#true} assume true; {468#true} is VALID [2020-07-17 22:50:36,214 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {468#true} {468#true} #32#return; {468#true} is VALID [2020-07-17 22:50:36,214 INFO L263 TraceCheckUtils]: 0: Hoare triple {468#true} call ULTIMATE.init(); {468#true} is VALID [2020-07-17 22:50:36,215 INFO L280 TraceCheckUtils]: 1: Hoare triple {468#true} assume true; {468#true} is VALID [2020-07-17 22:50:36,215 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {468#true} {468#true} #32#return; {468#true} is VALID [2020-07-17 22:50:36,215 INFO L263 TraceCheckUtils]: 3: Hoare triple {468#true} call #t~ret1 := main(); {468#true} is VALID [2020-07-17 22:50:36,216 INFO L280 TraceCheckUtils]: 4: Hoare triple {468#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {472#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:36,217 INFO L280 TraceCheckUtils]: 5: Hoare triple {472#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {472#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:36,218 INFO L280 TraceCheckUtils]: 6: Hoare triple {472#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {473#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:36,219 INFO L280 TraceCheckUtils]: 7: Hoare triple {473#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {473#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:36,220 INFO L280 TraceCheckUtils]: 8: Hoare triple {473#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {474#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:36,221 INFO L280 TraceCheckUtils]: 9: Hoare triple {474#(<= main_~i~0 3)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {474#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:36,223 INFO L280 TraceCheckUtils]: 10: Hoare triple {474#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {475#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:36,224 INFO L280 TraceCheckUtils]: 11: Hoare triple {475#(<= main_~i~0 4)} assume !(~i~0 <= 8); {469#false} is VALID [2020-07-17 22:50:36,224 INFO L263 TraceCheckUtils]: 12: Hoare triple {469#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {469#false} is VALID [2020-07-17 22:50:36,225 INFO L280 TraceCheckUtils]: 13: Hoare triple {469#false} ~cond := #in~cond; {469#false} is VALID [2020-07-17 22:50:36,225 INFO L280 TraceCheckUtils]: 14: Hoare triple {469#false} assume 0 == ~cond; {469#false} is VALID [2020-07-17 22:50:36,225 INFO L280 TraceCheckUtils]: 15: Hoare triple {469#false} assume !false; {469#false} is VALID [2020-07-17 22:50:36,226 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:36,227 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501044956] [2020-07-17 22:50:36,227 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046489461] [2020-07-17 22:50:36,227 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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) [2020-07-17 22:50:36,250 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-07-17 22:50:36,251 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:50:36,251 INFO L264 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:36,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:36,261 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:36,315 INFO L263 TraceCheckUtils]: 0: Hoare triple {468#true} call ULTIMATE.init(); {468#true} is VALID [2020-07-17 22:50:36,315 INFO L280 TraceCheckUtils]: 1: Hoare triple {468#true} assume true; {468#true} is VALID [2020-07-17 22:50:36,315 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {468#true} {468#true} #32#return; {468#true} is VALID [2020-07-17 22:50:36,316 INFO L263 TraceCheckUtils]: 3: Hoare triple {468#true} call #t~ret1 := main(); {468#true} is VALID [2020-07-17 22:50:36,317 INFO L280 TraceCheckUtils]: 4: Hoare triple {468#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {472#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:36,318 INFO L280 TraceCheckUtils]: 5: Hoare triple {472#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {472#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:36,319 INFO L280 TraceCheckUtils]: 6: Hoare triple {472#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {473#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:36,320 INFO L280 TraceCheckUtils]: 7: Hoare triple {473#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {473#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:36,321 INFO L280 TraceCheckUtils]: 8: Hoare triple {473#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {474#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:36,322 INFO L280 TraceCheckUtils]: 9: Hoare triple {474#(<= main_~i~0 3)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {474#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:36,323 INFO L280 TraceCheckUtils]: 10: Hoare triple {474#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {475#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:36,324 INFO L280 TraceCheckUtils]: 11: Hoare triple {475#(<= main_~i~0 4)} assume !(~i~0 <= 8); {469#false} is VALID [2020-07-17 22:50:36,324 INFO L263 TraceCheckUtils]: 12: Hoare triple {469#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {469#false} is VALID [2020-07-17 22:50:36,324 INFO L280 TraceCheckUtils]: 13: Hoare triple {469#false} ~cond := #in~cond; {469#false} is VALID [2020-07-17 22:50:36,324 INFO L280 TraceCheckUtils]: 14: Hoare triple {469#false} assume 0 == ~cond; {469#false} is VALID [2020-07-17 22:50:36,325 INFO L280 TraceCheckUtils]: 15: Hoare triple {469#false} assume !false; {469#false} is VALID [2020-07-17 22:50:36,325 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:36,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:50:36,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2020-07-17 22:50:36,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674600210] [2020-07-17 22:50:36,327 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-17 22:50:36,327 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:36,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:50:36,347 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:36,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:50:36,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:36,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:50:36,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:50:36,348 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 6 states. [2020-07-17 22:50:36,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:36,436 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2020-07-17 22:50:36,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:50:36,436 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-17 22:50:36,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:36,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:50:36,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2020-07-17 22:50:36,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:50:36,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2020-07-17 22:50:36,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 25 transitions. [2020-07-17 22:50:36,472 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:36,474 INFO L225 Difference]: With dead ends: 25 [2020-07-17 22:50:36,474 INFO L226 Difference]: Without dead ends: 20 [2020-07-17 22:50:36,475 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:50:36,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-17 22:50:36,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2020-07-17 22:50:36,486 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:36,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 19 states. [2020-07-17 22:50:36,487 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 19 states. [2020-07-17 22:50:36,487 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 19 states. [2020-07-17 22:50:36,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:36,489 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2020-07-17 22:50:36,489 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2020-07-17 22:50:36,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:36,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:36,490 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 20 states. [2020-07-17 22:50:36,490 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 20 states. [2020-07-17 22:50:36,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:36,492 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2020-07-17 22:50:36,492 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2020-07-17 22:50:36,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:36,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:36,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:36,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:36,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-17 22:50:36,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2020-07-17 22:50:36,495 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2020-07-17 22:50:36,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:36,496 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2020-07-17 22:50:36,496 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:50:36,496 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2020-07-17 22:50:36,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-17 22:50:36,497 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:36,497 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:36,710 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:36,710 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:36,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:36,711 INFO L82 PathProgramCache]: Analyzing trace with hash 263826484, now seen corresponding path program 4 times [2020-07-17 22:50:36,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:36,712 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631608757] [2020-07-17 22:50:36,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:36,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:36,808 INFO L280 TraceCheckUtils]: 0: Hoare triple {631#true} assume true; {631#true} is VALID [2020-07-17 22:50:36,808 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {631#true} {631#true} #32#return; {631#true} is VALID [2020-07-17 22:50:36,808 INFO L263 TraceCheckUtils]: 0: Hoare triple {631#true} call ULTIMATE.init(); {631#true} is VALID [2020-07-17 22:50:36,809 INFO L280 TraceCheckUtils]: 1: Hoare triple {631#true} assume true; {631#true} is VALID [2020-07-17 22:50:36,809 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {631#true} {631#true} #32#return; {631#true} is VALID [2020-07-17 22:50:36,809 INFO L263 TraceCheckUtils]: 3: Hoare triple {631#true} call #t~ret1 := main(); {631#true} is VALID [2020-07-17 22:50:36,811 INFO L280 TraceCheckUtils]: 4: Hoare triple {631#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {635#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:36,811 INFO L280 TraceCheckUtils]: 5: Hoare triple {635#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {635#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:36,813 INFO L280 TraceCheckUtils]: 6: Hoare triple {635#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {636#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:36,814 INFO L280 TraceCheckUtils]: 7: Hoare triple {636#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {636#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:36,815 INFO L280 TraceCheckUtils]: 8: Hoare triple {636#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {637#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:36,816 INFO L280 TraceCheckUtils]: 9: Hoare triple {637#(<= main_~i~0 3)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {637#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:36,817 INFO L280 TraceCheckUtils]: 10: Hoare triple {637#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {638#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:36,818 INFO L280 TraceCheckUtils]: 11: Hoare triple {638#(<= main_~i~0 4)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {638#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:36,820 INFO L280 TraceCheckUtils]: 12: Hoare triple {638#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {639#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:36,821 INFO L280 TraceCheckUtils]: 13: Hoare triple {639#(<= main_~i~0 5)} assume !(~i~0 <= 8); {632#false} is VALID [2020-07-17 22:50:36,821 INFO L263 TraceCheckUtils]: 14: Hoare triple {632#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {632#false} is VALID [2020-07-17 22:50:36,822 INFO L280 TraceCheckUtils]: 15: Hoare triple {632#false} ~cond := #in~cond; {632#false} is VALID [2020-07-17 22:50:36,822 INFO L280 TraceCheckUtils]: 16: Hoare triple {632#false} assume 0 == ~cond; {632#false} is VALID [2020-07-17 22:50:36,822 INFO L280 TraceCheckUtils]: 17: Hoare triple {632#false} assume !false; {632#false} is VALID [2020-07-17 22:50:36,823 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:36,824 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631608757] [2020-07-17 22:50:36,824 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660246083] [2020-07-17 22:50:36,824 INFO L92 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 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-17 22:50:36,862 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-17 22:50:36,862 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:50:36,863 INFO L264 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-17 22:50:36,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:36,872 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:36,939 INFO L263 TraceCheckUtils]: 0: Hoare triple {631#true} call ULTIMATE.init(); {631#true} is VALID [2020-07-17 22:50:36,939 INFO L280 TraceCheckUtils]: 1: Hoare triple {631#true} assume true; {631#true} is VALID [2020-07-17 22:50:36,939 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {631#true} {631#true} #32#return; {631#true} is VALID [2020-07-17 22:50:36,940 INFO L263 TraceCheckUtils]: 3: Hoare triple {631#true} call #t~ret1 := main(); {631#true} is VALID [2020-07-17 22:50:36,940 INFO L280 TraceCheckUtils]: 4: Hoare triple {631#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {635#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:36,941 INFO L280 TraceCheckUtils]: 5: Hoare triple {635#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {635#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:36,942 INFO L280 TraceCheckUtils]: 6: Hoare triple {635#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {636#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:36,943 INFO L280 TraceCheckUtils]: 7: Hoare triple {636#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {636#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:36,944 INFO L280 TraceCheckUtils]: 8: Hoare triple {636#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {637#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:36,945 INFO L280 TraceCheckUtils]: 9: Hoare triple {637#(<= main_~i~0 3)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {637#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:36,946 INFO L280 TraceCheckUtils]: 10: Hoare triple {637#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {638#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:36,947 INFO L280 TraceCheckUtils]: 11: Hoare triple {638#(<= main_~i~0 4)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {638#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:36,948 INFO L280 TraceCheckUtils]: 12: Hoare triple {638#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {639#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:36,949 INFO L280 TraceCheckUtils]: 13: Hoare triple {639#(<= main_~i~0 5)} assume !(~i~0 <= 8); {632#false} is VALID [2020-07-17 22:50:36,949 INFO L263 TraceCheckUtils]: 14: Hoare triple {632#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {632#false} is VALID [2020-07-17 22:50:36,949 INFO L280 TraceCheckUtils]: 15: Hoare triple {632#false} ~cond := #in~cond; {632#false} is VALID [2020-07-17 22:50:36,949 INFO L280 TraceCheckUtils]: 16: Hoare triple {632#false} assume 0 == ~cond; {632#false} is VALID [2020-07-17 22:50:36,950 INFO L280 TraceCheckUtils]: 17: Hoare triple {632#false} assume !false; {632#false} is VALID [2020-07-17 22:50:36,950 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:36,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:50:36,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2020-07-17 22:50:36,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723654527] [2020-07-17 22:50:36,951 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-07-17 22:50:36,952 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:36,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:50:36,992 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:36,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:50:36,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:36,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:50:36,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:50:36,993 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 7 states. [2020-07-17 22:50:37,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:37,085 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2020-07-17 22:50:37,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:50:37,085 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-07-17 22:50:37,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:37,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:50:37,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2020-07-17 22:50:37,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:50:37,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2020-07-17 22:50:37,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 27 transitions. [2020-07-17 22:50:37,120 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:37,121 INFO L225 Difference]: With dead ends: 27 [2020-07-17 22:50:37,122 INFO L226 Difference]: Without dead ends: 22 [2020-07-17 22:50:37,122 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 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-17 22:50:37,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-17 22:50:37,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2020-07-17 22:50:37,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:37,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 21 states. [2020-07-17 22:50:37,134 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 21 states. [2020-07-17 22:50:37,134 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 21 states. [2020-07-17 22:50:37,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:37,137 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2020-07-17 22:50:37,137 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2020-07-17 22:50:37,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:37,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:37,138 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 22 states. [2020-07-17 22:50:37,138 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 22 states. [2020-07-17 22:50:37,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:37,140 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2020-07-17 22:50:37,140 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2020-07-17 22:50:37,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:37,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:37,141 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:37,141 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:37,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-17 22:50:37,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2020-07-17 22:50:37,142 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2020-07-17 22:50:37,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:37,143 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2020-07-17 22:50:37,143 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:50:37,143 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2020-07-17 22:50:37,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-17 22:50:37,144 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:37,144 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:37,356 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:37,357 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:37,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:37,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1299094066, now seen corresponding path program 5 times [2020-07-17 22:50:37,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:37,359 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102657902] [2020-07-17 22:50:37,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:37,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:37,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:37,467 INFO L280 TraceCheckUtils]: 0: Hoare triple {811#true} assume true; {811#true} is VALID [2020-07-17 22:50:37,468 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {811#true} {811#true} #32#return; {811#true} is VALID [2020-07-17 22:50:37,468 INFO L263 TraceCheckUtils]: 0: Hoare triple {811#true} call ULTIMATE.init(); {811#true} is VALID [2020-07-17 22:50:37,468 INFO L280 TraceCheckUtils]: 1: Hoare triple {811#true} assume true; {811#true} is VALID [2020-07-17 22:50:37,468 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {811#true} {811#true} #32#return; {811#true} is VALID [2020-07-17 22:50:37,469 INFO L263 TraceCheckUtils]: 3: Hoare triple {811#true} call #t~ret1 := main(); {811#true} is VALID [2020-07-17 22:50:37,469 INFO L280 TraceCheckUtils]: 4: Hoare triple {811#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {815#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:37,470 INFO L280 TraceCheckUtils]: 5: Hoare triple {815#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {815#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:37,471 INFO L280 TraceCheckUtils]: 6: Hoare triple {815#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {816#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:37,472 INFO L280 TraceCheckUtils]: 7: Hoare triple {816#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {816#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:37,473 INFO L280 TraceCheckUtils]: 8: Hoare triple {816#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {817#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:37,473 INFO L280 TraceCheckUtils]: 9: Hoare triple {817#(<= main_~i~0 3)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {817#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:37,474 INFO L280 TraceCheckUtils]: 10: Hoare triple {817#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {818#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:37,474 INFO L280 TraceCheckUtils]: 11: Hoare triple {818#(<= main_~i~0 4)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {818#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:37,475 INFO L280 TraceCheckUtils]: 12: Hoare triple {818#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {819#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:37,478 INFO L280 TraceCheckUtils]: 13: Hoare triple {819#(<= main_~i~0 5)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {819#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:37,481 INFO L280 TraceCheckUtils]: 14: Hoare triple {819#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {820#(<= main_~i~0 6)} is VALID [2020-07-17 22:50:37,483 INFO L280 TraceCheckUtils]: 15: Hoare triple {820#(<= main_~i~0 6)} assume !(~i~0 <= 8); {812#false} is VALID [2020-07-17 22:50:37,483 INFO L263 TraceCheckUtils]: 16: Hoare triple {812#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {812#false} is VALID [2020-07-17 22:50:37,484 INFO L280 TraceCheckUtils]: 17: Hoare triple {812#false} ~cond := #in~cond; {812#false} is VALID [2020-07-17 22:50:37,484 INFO L280 TraceCheckUtils]: 18: Hoare triple {812#false} assume 0 == ~cond; {812#false} is VALID [2020-07-17 22:50:37,484 INFO L280 TraceCheckUtils]: 19: Hoare triple {812#false} assume !false; {812#false} is VALID [2020-07-17 22:50:37,485 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:37,485 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102657902] [2020-07-17 22:50:37,485 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43407607] [2020-07-17 22:50:37,486 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 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-17 22:50:37,512 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-07-17 22:50:37,512 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:50:37,513 INFO L264 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-17 22:50:37,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:37,523 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:37,611 INFO L263 TraceCheckUtils]: 0: Hoare triple {811#true} call ULTIMATE.init(); {811#true} is VALID [2020-07-17 22:50:37,612 INFO L280 TraceCheckUtils]: 1: Hoare triple {811#true} assume true; {811#true} is VALID [2020-07-17 22:50:37,612 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {811#true} {811#true} #32#return; {811#true} is VALID [2020-07-17 22:50:37,612 INFO L263 TraceCheckUtils]: 3: Hoare triple {811#true} call #t~ret1 := main(); {811#true} is VALID [2020-07-17 22:50:37,613 INFO L280 TraceCheckUtils]: 4: Hoare triple {811#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {815#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:37,614 INFO L280 TraceCheckUtils]: 5: Hoare triple {815#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {815#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:37,614 INFO L280 TraceCheckUtils]: 6: Hoare triple {815#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {816#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:37,615 INFO L280 TraceCheckUtils]: 7: Hoare triple {816#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {816#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:37,615 INFO L280 TraceCheckUtils]: 8: Hoare triple {816#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {817#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:37,616 INFO L280 TraceCheckUtils]: 9: Hoare triple {817#(<= main_~i~0 3)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {817#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:37,618 INFO L280 TraceCheckUtils]: 10: Hoare triple {817#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {818#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:37,618 INFO L280 TraceCheckUtils]: 11: Hoare triple {818#(<= main_~i~0 4)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {818#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:37,625 INFO L280 TraceCheckUtils]: 12: Hoare triple {818#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {819#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:37,626 INFO L280 TraceCheckUtils]: 13: Hoare triple {819#(<= main_~i~0 5)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {819#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:37,627 INFO L280 TraceCheckUtils]: 14: Hoare triple {819#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {820#(<= main_~i~0 6)} is VALID [2020-07-17 22:50:37,628 INFO L280 TraceCheckUtils]: 15: Hoare triple {820#(<= main_~i~0 6)} assume !(~i~0 <= 8); {812#false} is VALID [2020-07-17 22:50:37,628 INFO L263 TraceCheckUtils]: 16: Hoare triple {812#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {812#false} is VALID [2020-07-17 22:50:37,629 INFO L280 TraceCheckUtils]: 17: Hoare triple {812#false} ~cond := #in~cond; {812#false} is VALID [2020-07-17 22:50:37,629 INFO L280 TraceCheckUtils]: 18: Hoare triple {812#false} assume 0 == ~cond; {812#false} is VALID [2020-07-17 22:50:37,629 INFO L280 TraceCheckUtils]: 19: Hoare triple {812#false} assume !false; {812#false} is VALID [2020-07-17 22:50:37,630 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:37,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:50:37,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2020-07-17 22:50:37,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588350530] [2020-07-17 22:50:37,635 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2020-07-17 22:50:37,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:37,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-17 22:50:37,660 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-17 22:50:37,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 22:50:37,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:37,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 22:50:37,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:50:37,662 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 8 states. [2020-07-17 22:50:37,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:37,754 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2020-07-17 22:50:37,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 22:50:37,755 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2020-07-17 22:50:37,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:37,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:50:37,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2020-07-17 22:50:37,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:50:37,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2020-07-17 22:50:37,758 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 29 transitions. [2020-07-17 22:50:37,799 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-17 22:50:37,801 INFO L225 Difference]: With dead ends: 29 [2020-07-17 22:50:37,801 INFO L226 Difference]: Without dead ends: 24 [2020-07-17 22:50:37,801 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-17 22:50:37,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-17 22:50:37,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2020-07-17 22:50:37,814 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:37,814 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 23 states. [2020-07-17 22:50:37,814 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 23 states. [2020-07-17 22:50:37,814 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 23 states. [2020-07-17 22:50:37,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:37,816 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2020-07-17 22:50:37,817 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2020-07-17 22:50:37,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:37,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:37,817 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states. [2020-07-17 22:50:37,817 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states. [2020-07-17 22:50:37,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:37,819 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2020-07-17 22:50:37,819 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2020-07-17 22:50:37,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:37,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:37,820 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:37,820 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:37,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-17 22:50:37,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2020-07-17 22:50:37,822 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2020-07-17 22:50:37,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:37,822 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2020-07-17 22:50:37,822 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 22:50:37,822 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2020-07-17 22:50:37,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:50:37,823 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:37,823 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:38,033 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-17 22:50:38,034 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:38,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:38,035 INFO L82 PathProgramCache]: Analyzing trace with hash -241172304, now seen corresponding path program 6 times [2020-07-17 22:50:38,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:38,036 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765496993] [2020-07-17 22:50:38,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:38,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:38,144 INFO L280 TraceCheckUtils]: 0: Hoare triple {1008#true} assume true; {1008#true} is VALID [2020-07-17 22:50:38,144 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1008#true} {1008#true} #32#return; {1008#true} is VALID [2020-07-17 22:50:38,145 INFO L263 TraceCheckUtils]: 0: Hoare triple {1008#true} call ULTIMATE.init(); {1008#true} is VALID [2020-07-17 22:50:38,145 INFO L280 TraceCheckUtils]: 1: Hoare triple {1008#true} assume true; {1008#true} is VALID [2020-07-17 22:50:38,145 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1008#true} {1008#true} #32#return; {1008#true} is VALID [2020-07-17 22:50:38,145 INFO L263 TraceCheckUtils]: 3: Hoare triple {1008#true} call #t~ret1 := main(); {1008#true} is VALID [2020-07-17 22:50:38,146 INFO L280 TraceCheckUtils]: 4: Hoare triple {1008#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1012#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:38,157 INFO L280 TraceCheckUtils]: 5: Hoare triple {1012#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1012#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:38,159 INFO L280 TraceCheckUtils]: 6: Hoare triple {1012#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1013#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:38,164 INFO L280 TraceCheckUtils]: 7: Hoare triple {1013#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1013#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:38,165 INFO L280 TraceCheckUtils]: 8: Hoare triple {1013#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1014#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:38,166 INFO L280 TraceCheckUtils]: 9: Hoare triple {1014#(<= main_~i~0 3)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1014#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:38,168 INFO L280 TraceCheckUtils]: 10: Hoare triple {1014#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1015#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:38,168 INFO L280 TraceCheckUtils]: 11: Hoare triple {1015#(<= main_~i~0 4)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1015#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:38,169 INFO L280 TraceCheckUtils]: 12: Hoare triple {1015#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1016#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:38,169 INFO L280 TraceCheckUtils]: 13: Hoare triple {1016#(<= main_~i~0 5)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1016#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:38,170 INFO L280 TraceCheckUtils]: 14: Hoare triple {1016#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1017#(<= main_~i~0 6)} is VALID [2020-07-17 22:50:38,171 INFO L280 TraceCheckUtils]: 15: Hoare triple {1017#(<= main_~i~0 6)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1017#(<= main_~i~0 6)} is VALID [2020-07-17 22:50:38,172 INFO L280 TraceCheckUtils]: 16: Hoare triple {1017#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1018#(<= main_~i~0 7)} is VALID [2020-07-17 22:50:38,172 INFO L280 TraceCheckUtils]: 17: Hoare triple {1018#(<= main_~i~0 7)} assume !(~i~0 <= 8); {1009#false} is VALID [2020-07-17 22:50:38,173 INFO L263 TraceCheckUtils]: 18: Hoare triple {1009#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1009#false} is VALID [2020-07-17 22:50:38,173 INFO L280 TraceCheckUtils]: 19: Hoare triple {1009#false} ~cond := #in~cond; {1009#false} is VALID [2020-07-17 22:50:38,173 INFO L280 TraceCheckUtils]: 20: Hoare triple {1009#false} assume 0 == ~cond; {1009#false} is VALID [2020-07-17 22:50:38,173 INFO L280 TraceCheckUtils]: 21: Hoare triple {1009#false} assume !false; {1009#false} is VALID [2020-07-17 22:50:38,174 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:38,174 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765496993] [2020-07-17 22:50:38,174 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273783257] [2020-07-17 22:50:38,175 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE 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) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:38,210 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2020-07-17 22:50:38,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:50:38,211 INFO L264 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-17 22:50:38,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:38,220 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:38,292 INFO L263 TraceCheckUtils]: 0: Hoare triple {1008#true} call ULTIMATE.init(); {1008#true} is VALID [2020-07-17 22:50:38,292 INFO L280 TraceCheckUtils]: 1: Hoare triple {1008#true} assume true; {1008#true} is VALID [2020-07-17 22:50:38,292 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1008#true} {1008#true} #32#return; {1008#true} is VALID [2020-07-17 22:50:38,293 INFO L263 TraceCheckUtils]: 3: Hoare triple {1008#true} call #t~ret1 := main(); {1008#true} is VALID [2020-07-17 22:50:38,293 INFO L280 TraceCheckUtils]: 4: Hoare triple {1008#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1012#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:38,294 INFO L280 TraceCheckUtils]: 5: Hoare triple {1012#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1012#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:38,294 INFO L280 TraceCheckUtils]: 6: Hoare triple {1012#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1013#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:38,295 INFO L280 TraceCheckUtils]: 7: Hoare triple {1013#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1013#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:38,295 INFO L280 TraceCheckUtils]: 8: Hoare triple {1013#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1014#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:38,296 INFO L280 TraceCheckUtils]: 9: Hoare triple {1014#(<= main_~i~0 3)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1014#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:38,296 INFO L280 TraceCheckUtils]: 10: Hoare triple {1014#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1015#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:38,297 INFO L280 TraceCheckUtils]: 11: Hoare triple {1015#(<= main_~i~0 4)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1015#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:38,298 INFO L280 TraceCheckUtils]: 12: Hoare triple {1015#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1016#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:38,298 INFO L280 TraceCheckUtils]: 13: Hoare triple {1016#(<= main_~i~0 5)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1016#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:38,299 INFO L280 TraceCheckUtils]: 14: Hoare triple {1016#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1017#(<= main_~i~0 6)} is VALID [2020-07-17 22:50:38,305 INFO L280 TraceCheckUtils]: 15: Hoare triple {1017#(<= main_~i~0 6)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1017#(<= main_~i~0 6)} is VALID [2020-07-17 22:50:38,306 INFO L280 TraceCheckUtils]: 16: Hoare triple {1017#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1018#(<= main_~i~0 7)} is VALID [2020-07-17 22:50:38,307 INFO L280 TraceCheckUtils]: 17: Hoare triple {1018#(<= main_~i~0 7)} assume !(~i~0 <= 8); {1009#false} is VALID [2020-07-17 22:50:38,307 INFO L263 TraceCheckUtils]: 18: Hoare triple {1009#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1009#false} is VALID [2020-07-17 22:50:38,308 INFO L280 TraceCheckUtils]: 19: Hoare triple {1009#false} ~cond := #in~cond; {1009#false} is VALID [2020-07-17 22:50:38,308 INFO L280 TraceCheckUtils]: 20: Hoare triple {1009#false} assume 0 == ~cond; {1009#false} is VALID [2020-07-17 22:50:38,308 INFO L280 TraceCheckUtils]: 21: Hoare triple {1009#false} assume !false; {1009#false} is VALID [2020-07-17 22:50:38,309 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:38,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:50:38,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2020-07-17 22:50:38,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777685455] [2020-07-17 22:50:38,311 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-07-17 22:50:38,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:38,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-17 22:50:38,344 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:38,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-17 22:50:38,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:38,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-17 22:50:38,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:50:38,345 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 9 states. [2020-07-17 22:50:38,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:38,478 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2020-07-17 22:50:38,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-17 22:50:38,478 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-07-17 22:50:38,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:38,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:50:38,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 31 transitions. [2020-07-17 22:50:38,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:50:38,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 31 transitions. [2020-07-17 22:50:38,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 31 transitions. [2020-07-17 22:50:38,517 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:38,519 INFO L225 Difference]: With dead ends: 31 [2020-07-17 22:50:38,519 INFO L226 Difference]: Without dead ends: 26 [2020-07-17 22:50:38,520 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 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-17 22:50:38,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-17 22:50:38,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2020-07-17 22:50:38,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:38,534 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 25 states. [2020-07-17 22:50:38,534 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 25 states. [2020-07-17 22:50:38,535 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 25 states. [2020-07-17 22:50:38,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:38,537 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2020-07-17 22:50:38,538 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2020-07-17 22:50:38,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:38,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:38,538 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 26 states. [2020-07-17 22:50:38,538 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 26 states. [2020-07-17 22:50:38,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:38,540 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2020-07-17 22:50:38,540 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2020-07-17 22:50:38,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:38,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:38,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:38,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:38,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-17 22:50:38,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2020-07-17 22:50:38,543 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2020-07-17 22:50:38,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:38,543 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2020-07-17 22:50:38,543 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-17 22:50:38,543 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2020-07-17 22:50:38,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-17 22:50:38,544 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:38,544 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:38,756 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:38,757 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:38,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:38,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1326563246, now seen corresponding path program 7 times [2020-07-17 22:50:38,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:38,759 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065924885] [2020-07-17 22:50:38,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:38,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:38,886 INFO L280 TraceCheckUtils]: 0: Hoare triple {1222#true} assume true; {1222#true} is VALID [2020-07-17 22:50:38,887 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1222#true} {1222#true} #32#return; {1222#true} is VALID [2020-07-17 22:50:38,887 INFO L263 TraceCheckUtils]: 0: Hoare triple {1222#true} call ULTIMATE.init(); {1222#true} is VALID [2020-07-17 22:50:38,887 INFO L280 TraceCheckUtils]: 1: Hoare triple {1222#true} assume true; {1222#true} is VALID [2020-07-17 22:50:38,887 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1222#true} {1222#true} #32#return; {1222#true} is VALID [2020-07-17 22:50:38,887 INFO L263 TraceCheckUtils]: 3: Hoare triple {1222#true} call #t~ret1 := main(); {1222#true} is VALID [2020-07-17 22:50:38,888 INFO L280 TraceCheckUtils]: 4: Hoare triple {1222#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1226#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:38,888 INFO L280 TraceCheckUtils]: 5: Hoare triple {1226#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1226#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:38,892 INFO L280 TraceCheckUtils]: 6: Hoare triple {1226#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1227#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:38,893 INFO L280 TraceCheckUtils]: 7: Hoare triple {1227#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1227#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:38,894 INFO L280 TraceCheckUtils]: 8: Hoare triple {1227#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1228#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:38,896 INFO L280 TraceCheckUtils]: 9: Hoare triple {1228#(<= main_~i~0 3)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1228#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:38,896 INFO L280 TraceCheckUtils]: 10: Hoare triple {1228#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1229#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:38,898 INFO L280 TraceCheckUtils]: 11: Hoare triple {1229#(<= main_~i~0 4)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1229#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:38,902 INFO L280 TraceCheckUtils]: 12: Hoare triple {1229#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1230#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:38,905 INFO L280 TraceCheckUtils]: 13: Hoare triple {1230#(<= main_~i~0 5)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1230#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:38,906 INFO L280 TraceCheckUtils]: 14: Hoare triple {1230#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1231#(<= main_~i~0 6)} is VALID [2020-07-17 22:50:38,907 INFO L280 TraceCheckUtils]: 15: Hoare triple {1231#(<= main_~i~0 6)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1231#(<= main_~i~0 6)} is VALID [2020-07-17 22:50:38,908 INFO L280 TraceCheckUtils]: 16: Hoare triple {1231#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1232#(<= main_~i~0 7)} is VALID [2020-07-17 22:50:38,908 INFO L280 TraceCheckUtils]: 17: Hoare triple {1232#(<= main_~i~0 7)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1232#(<= main_~i~0 7)} is VALID [2020-07-17 22:50:38,909 INFO L280 TraceCheckUtils]: 18: Hoare triple {1232#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1233#(<= main_~i~0 8)} is VALID [2020-07-17 22:50:38,910 INFO L280 TraceCheckUtils]: 19: Hoare triple {1233#(<= main_~i~0 8)} assume !(~i~0 <= 8); {1223#false} is VALID [2020-07-17 22:50:38,910 INFO L263 TraceCheckUtils]: 20: Hoare triple {1223#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1223#false} is VALID [2020-07-17 22:50:38,910 INFO L280 TraceCheckUtils]: 21: Hoare triple {1223#false} ~cond := #in~cond; {1223#false} is VALID [2020-07-17 22:50:38,910 INFO L280 TraceCheckUtils]: 22: Hoare triple {1223#false} assume 0 == ~cond; {1223#false} is VALID [2020-07-17 22:50:38,911 INFO L280 TraceCheckUtils]: 23: Hoare triple {1223#false} assume !false; {1223#false} is VALID [2020-07-17 22:50:38,911 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:38,912 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065924885] [2020-07-17 22:50:38,912 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238221051] [2020-07-17 22:50:38,912 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 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-17 22:50:38,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:38,933 INFO L264 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-17 22:50:38,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:38,941 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:39,041 INFO L263 TraceCheckUtils]: 0: Hoare triple {1222#true} call ULTIMATE.init(); {1222#true} is VALID [2020-07-17 22:50:39,041 INFO L280 TraceCheckUtils]: 1: Hoare triple {1222#true} assume true; {1222#true} is VALID [2020-07-17 22:50:39,042 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1222#true} {1222#true} #32#return; {1222#true} is VALID [2020-07-17 22:50:39,042 INFO L263 TraceCheckUtils]: 3: Hoare triple {1222#true} call #t~ret1 := main(); {1222#true} is VALID [2020-07-17 22:50:39,042 INFO L280 TraceCheckUtils]: 4: Hoare triple {1222#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1226#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:39,043 INFO L280 TraceCheckUtils]: 5: Hoare triple {1226#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1226#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:39,043 INFO L280 TraceCheckUtils]: 6: Hoare triple {1226#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1227#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:39,044 INFO L280 TraceCheckUtils]: 7: Hoare triple {1227#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1227#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:39,044 INFO L280 TraceCheckUtils]: 8: Hoare triple {1227#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1228#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:39,053 INFO L280 TraceCheckUtils]: 9: Hoare triple {1228#(<= main_~i~0 3)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1228#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:39,055 INFO L280 TraceCheckUtils]: 10: Hoare triple {1228#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1229#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:39,056 INFO L280 TraceCheckUtils]: 11: Hoare triple {1229#(<= main_~i~0 4)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1229#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:39,056 INFO L280 TraceCheckUtils]: 12: Hoare triple {1229#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1230#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:39,057 INFO L280 TraceCheckUtils]: 13: Hoare triple {1230#(<= main_~i~0 5)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1230#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:39,058 INFO L280 TraceCheckUtils]: 14: Hoare triple {1230#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1231#(<= main_~i~0 6)} is VALID [2020-07-17 22:50:39,059 INFO L280 TraceCheckUtils]: 15: Hoare triple {1231#(<= main_~i~0 6)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1231#(<= main_~i~0 6)} is VALID [2020-07-17 22:50:39,060 INFO L280 TraceCheckUtils]: 16: Hoare triple {1231#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1232#(<= main_~i~0 7)} is VALID [2020-07-17 22:50:39,060 INFO L280 TraceCheckUtils]: 17: Hoare triple {1232#(<= main_~i~0 7)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1232#(<= main_~i~0 7)} is VALID [2020-07-17 22:50:39,061 INFO L280 TraceCheckUtils]: 18: Hoare triple {1232#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1233#(<= main_~i~0 8)} is VALID [2020-07-17 22:50:39,062 INFO L280 TraceCheckUtils]: 19: Hoare triple {1233#(<= main_~i~0 8)} assume !(~i~0 <= 8); {1223#false} is VALID [2020-07-17 22:50:39,062 INFO L263 TraceCheckUtils]: 20: Hoare triple {1223#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1223#false} is VALID [2020-07-17 22:50:39,062 INFO L280 TraceCheckUtils]: 21: Hoare triple {1223#false} ~cond := #in~cond; {1223#false} is VALID [2020-07-17 22:50:39,062 INFO L280 TraceCheckUtils]: 22: Hoare triple {1223#false} assume 0 == ~cond; {1223#false} is VALID [2020-07-17 22:50:39,063 INFO L280 TraceCheckUtils]: 23: Hoare triple {1223#false} assume !false; {1223#false} is VALID [2020-07-17 22:50:39,063 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:39,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:50:39,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2020-07-17 22:50:39,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183766167] [2020-07-17 22:50:39,065 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-07-17 22:50:39,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:39,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-17 22:50:39,096 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-17 22:50:39,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 22:50:39,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:39,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 22:50:39,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:50:39,098 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 10 states. [2020-07-17 22:50:39,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:39,174 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2020-07-17 22:50:39,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-17 22:50:39,175 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-07-17 22:50:39,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:39,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:50:39,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2020-07-17 22:50:39,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:50:39,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2020-07-17 22:50:39,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 32 transitions. [2020-07-17 22:50:39,229 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-17 22:50:39,230 INFO L225 Difference]: With dead ends: 32 [2020-07-17 22:50:39,230 INFO L226 Difference]: Without dead ends: 27 [2020-07-17 22:50:39,231 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 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-17 22:50:39,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-17 22:50:39,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-17 22:50:39,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:39,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2020-07-17 22:50:39,253 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-17 22:50:39,253 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-17 22:50:39,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:39,255 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2020-07-17 22:50:39,255 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-07-17 22:50:39,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:39,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:39,255 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-17 22:50:39,255 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-17 22:50:39,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:39,257 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2020-07-17 22:50:39,257 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-07-17 22:50:39,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:39,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:39,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:39,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:39,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-17 22:50:39,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2020-07-17 22:50:39,266 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2020-07-17 22:50:39,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:39,267 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2020-07-17 22:50:39,267 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 22:50:39,267 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-07-17 22:50:39,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-17 22:50:39,268 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:39,268 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:39,479 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:39,480 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:39,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:39,481 INFO L82 PathProgramCache]: Analyzing trace with hash 386905900, now seen corresponding path program 8 times [2020-07-17 22:50:39,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:39,481 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592975559] [2020-07-17 22:50:39,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:39,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:39,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:39,764 INFO L280 TraceCheckUtils]: 0: Hoare triple {1450#true} assume true; {1450#true} is VALID [2020-07-17 22:50:39,764 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1450#true} {1450#true} #32#return; {1450#true} is VALID [2020-07-17 22:50:39,765 INFO L263 TraceCheckUtils]: 0: Hoare triple {1450#true} call ULTIMATE.init(); {1450#true} is VALID [2020-07-17 22:50:39,765 INFO L280 TraceCheckUtils]: 1: Hoare triple {1450#true} assume true; {1450#true} is VALID [2020-07-17 22:50:39,765 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1450#true} {1450#true} #32#return; {1450#true} is VALID [2020-07-17 22:50:39,765 INFO L263 TraceCheckUtils]: 3: Hoare triple {1450#true} call #t~ret1 := main(); {1450#true} is VALID [2020-07-17 22:50:39,766 INFO L280 TraceCheckUtils]: 4: Hoare triple {1450#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1454#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-17 22:50:39,767 INFO L280 TraceCheckUtils]: 5: Hoare triple {1454#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1455#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2020-07-17 22:50:39,767 INFO L280 TraceCheckUtils]: 6: Hoare triple {1455#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1455#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2020-07-17 22:50:39,768 INFO L280 TraceCheckUtils]: 7: Hoare triple {1455#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1456#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2020-07-17 22:50:39,769 INFO L280 TraceCheckUtils]: 8: Hoare triple {1456#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1456#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2020-07-17 22:50:39,769 INFO L280 TraceCheckUtils]: 9: Hoare triple {1456#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1457#(and (<= main_~sn~0 6) (<= 6 main_~sn~0))} is VALID [2020-07-17 22:50:39,770 INFO L280 TraceCheckUtils]: 10: Hoare triple {1457#(and (<= main_~sn~0 6) (<= 6 main_~sn~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1457#(and (<= main_~sn~0 6) (<= 6 main_~sn~0))} is VALID [2020-07-17 22:50:39,771 INFO L280 TraceCheckUtils]: 11: Hoare triple {1457#(and (<= main_~sn~0 6) (<= 6 main_~sn~0))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1458#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} is VALID [2020-07-17 22:50:39,775 INFO L280 TraceCheckUtils]: 12: Hoare triple {1458#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1458#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} is VALID [2020-07-17 22:50:39,779 INFO L280 TraceCheckUtils]: 13: Hoare triple {1458#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1459#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} is VALID [2020-07-17 22:50:39,781 INFO L280 TraceCheckUtils]: 14: Hoare triple {1459#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1459#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} is VALID [2020-07-17 22:50:39,782 INFO L280 TraceCheckUtils]: 15: Hoare triple {1459#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1460#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} is VALID [2020-07-17 22:50:39,783 INFO L280 TraceCheckUtils]: 16: Hoare triple {1460#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1460#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} is VALID [2020-07-17 22:50:39,783 INFO L280 TraceCheckUtils]: 17: Hoare triple {1460#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1461#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} is VALID [2020-07-17 22:50:39,785 INFO L280 TraceCheckUtils]: 18: Hoare triple {1461#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1461#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} is VALID [2020-07-17 22:50:39,786 INFO L280 TraceCheckUtils]: 19: Hoare triple {1461#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1462#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} is VALID [2020-07-17 22:50:39,789 INFO L280 TraceCheckUtils]: 20: Hoare triple {1462#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1462#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} is VALID [2020-07-17 22:50:39,792 INFO L280 TraceCheckUtils]: 21: Hoare triple {1462#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} assume !(~i~0 <= 8); {1462#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} is VALID [2020-07-17 22:50:39,793 INFO L263 TraceCheckUtils]: 22: Hoare triple {1462#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1463#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:50:39,794 INFO L280 TraceCheckUtils]: 23: Hoare triple {1463#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1464#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:50:39,794 INFO L280 TraceCheckUtils]: 24: Hoare triple {1464#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1451#false} is VALID [2020-07-17 22:50:39,794 INFO L280 TraceCheckUtils]: 25: Hoare triple {1451#false} assume !false; {1451#false} is VALID [2020-07-17 22:50:39,797 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:39,797 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592975559] [2020-07-17 22:50:39,797 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926893264] [2020-07-17 22:50:39,798 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:39,824 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:50:39,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:50:39,825 INFO L264 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 21 conjunts are in the unsatisfiable core [2020-07-17 22:50:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:39,835 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:39,946 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:50:40,016 INFO L263 TraceCheckUtils]: 0: Hoare triple {1450#true} call ULTIMATE.init(); {1450#true} is VALID [2020-07-17 22:50:40,016 INFO L280 TraceCheckUtils]: 1: Hoare triple {1450#true} assume true; {1450#true} is VALID [2020-07-17 22:50:40,016 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1450#true} {1450#true} #32#return; {1450#true} is VALID [2020-07-17 22:50:40,016 INFO L263 TraceCheckUtils]: 3: Hoare triple {1450#true} call #t~ret1 := main(); {1450#true} is VALID [2020-07-17 22:50:40,017 INFO L280 TraceCheckUtils]: 4: Hoare triple {1450#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1454#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-17 22:50:40,018 INFO L280 TraceCheckUtils]: 5: Hoare triple {1454#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1455#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2020-07-17 22:50:40,019 INFO L280 TraceCheckUtils]: 6: Hoare triple {1455#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1455#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2020-07-17 22:50:40,020 INFO L280 TraceCheckUtils]: 7: Hoare triple {1455#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1456#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2020-07-17 22:50:40,021 INFO L280 TraceCheckUtils]: 8: Hoare triple {1456#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1456#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2020-07-17 22:50:40,022 INFO L280 TraceCheckUtils]: 9: Hoare triple {1456#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1457#(and (<= main_~sn~0 6) (<= 6 main_~sn~0))} is VALID [2020-07-17 22:50:40,022 INFO L280 TraceCheckUtils]: 10: Hoare triple {1457#(and (<= main_~sn~0 6) (<= 6 main_~sn~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1457#(and (<= main_~sn~0 6) (<= 6 main_~sn~0))} is VALID [2020-07-17 22:50:40,023 INFO L280 TraceCheckUtils]: 11: Hoare triple {1457#(and (<= main_~sn~0 6) (<= 6 main_~sn~0))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1458#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} is VALID [2020-07-17 22:50:40,024 INFO L280 TraceCheckUtils]: 12: Hoare triple {1458#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1458#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} is VALID [2020-07-17 22:50:40,025 INFO L280 TraceCheckUtils]: 13: Hoare triple {1458#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1459#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} is VALID [2020-07-17 22:50:40,026 INFO L280 TraceCheckUtils]: 14: Hoare triple {1459#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1459#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} is VALID [2020-07-17 22:50:40,027 INFO L280 TraceCheckUtils]: 15: Hoare triple {1459#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1460#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} is VALID [2020-07-17 22:50:40,027 INFO L280 TraceCheckUtils]: 16: Hoare triple {1460#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1460#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} is VALID [2020-07-17 22:50:40,028 INFO L280 TraceCheckUtils]: 17: Hoare triple {1460#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1461#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} is VALID [2020-07-17 22:50:40,029 INFO L280 TraceCheckUtils]: 18: Hoare triple {1461#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1461#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} is VALID [2020-07-17 22:50:40,030 INFO L280 TraceCheckUtils]: 19: Hoare triple {1461#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1462#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} is VALID [2020-07-17 22:50:40,031 INFO L280 TraceCheckUtils]: 20: Hoare triple {1462#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1462#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} is VALID [2020-07-17 22:50:40,032 INFO L280 TraceCheckUtils]: 21: Hoare triple {1462#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} assume !(~i~0 <= 8); {1462#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} is VALID [2020-07-17 22:50:40,033 INFO L263 TraceCheckUtils]: 22: Hoare triple {1462#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1534#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:50:40,034 INFO L280 TraceCheckUtils]: 23: Hoare triple {1534#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1538#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:50:40,034 INFO L280 TraceCheckUtils]: 24: Hoare triple {1538#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1451#false} is VALID [2020-07-17 22:50:40,034 INFO L280 TraceCheckUtils]: 25: Hoare triple {1451#false} assume !false; {1451#false} is VALID [2020-07-17 22:50:40,036 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:40,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:50:40,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2020-07-17 22:50:40,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977499502] [2020-07-17 22:50:40,037 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2020-07-17 22:50:40,038 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:40,038 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-17 22:50:40,072 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-17 22:50:40,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-17 22:50:40,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:40,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-17 22:50:40,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2020-07-17 22:50:40,073 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 15 states. [2020-07-17 22:50:40,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:40,539 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2020-07-17 22:50:40,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-17 22:50:40,540 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2020-07-17 22:50:40,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:40,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-17 22:50:40,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 34 transitions. [2020-07-17 22:50:40,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-17 22:50:40,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 34 transitions. [2020-07-17 22:50:40,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 34 transitions. [2020-07-17 22:50:40,597 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:40,597 INFO L225 Difference]: With dead ends: 34 [2020-07-17 22:50:40,598 INFO L226 Difference]: Without dead ends: 29 [2020-07-17 22:50:40,599 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2020-07-17 22:50:40,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-17 22:50:40,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-17 22:50:40,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:40,625 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2020-07-17 22:50:40,625 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-17 22:50:40,625 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-17 22:50:40,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:40,627 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2020-07-17 22:50:40,627 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2020-07-17 22:50:40,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:40,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:40,627 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-17 22:50:40,628 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-17 22:50:40,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:40,629 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2020-07-17 22:50:40,629 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2020-07-17 22:50:40,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:40,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:40,630 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:40,630 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:40,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-17 22:50:40,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2020-07-17 22:50:40,631 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2020-07-17 22:50:40,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:40,631 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2020-07-17 22:50:40,631 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-17 22:50:40,632 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2020-07-17 22:50:40,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-17 22:50:40,632 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:40,632 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:40,841 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-17 22:50:40,842 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:40,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:40,843 INFO L82 PathProgramCache]: Analyzing trace with hash -680671446, now seen corresponding path program 9 times [2020-07-17 22:50:40,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:40,844 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650974017] [2020-07-17 22:50:40,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:40,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:40,970 INFO L280 TraceCheckUtils]: 0: Hoare triple {1701#true} assume true; {1701#true} is VALID [2020-07-17 22:50:40,970 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1701#true} {1701#true} #32#return; {1701#true} is VALID [2020-07-17 22:50:40,971 INFO L263 TraceCheckUtils]: 0: Hoare triple {1701#true} call ULTIMATE.init(); {1701#true} is VALID [2020-07-17 22:50:40,971 INFO L280 TraceCheckUtils]: 1: Hoare triple {1701#true} assume true; {1701#true} is VALID [2020-07-17 22:50:40,971 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1701#true} {1701#true} #32#return; {1701#true} is VALID [2020-07-17 22:50:40,972 INFO L263 TraceCheckUtils]: 3: Hoare triple {1701#true} call #t~ret1 := main(); {1701#true} is VALID [2020-07-17 22:50:40,973 INFO L280 TraceCheckUtils]: 4: Hoare triple {1701#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1705#(<= 1 main_~i~0)} is VALID [2020-07-17 22:50:40,974 INFO L280 TraceCheckUtils]: 5: Hoare triple {1705#(<= 1 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1705#(<= 1 main_~i~0)} is VALID [2020-07-17 22:50:40,975 INFO L280 TraceCheckUtils]: 6: Hoare triple {1705#(<= 1 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1706#(<= 2 main_~i~0)} is VALID [2020-07-17 22:50:40,976 INFO L280 TraceCheckUtils]: 7: Hoare triple {1706#(<= 2 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1706#(<= 2 main_~i~0)} is VALID [2020-07-17 22:50:40,977 INFO L280 TraceCheckUtils]: 8: Hoare triple {1706#(<= 2 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1707#(<= 3 main_~i~0)} is VALID [2020-07-17 22:50:40,978 INFO L280 TraceCheckUtils]: 9: Hoare triple {1707#(<= 3 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1707#(<= 3 main_~i~0)} is VALID [2020-07-17 22:50:40,979 INFO L280 TraceCheckUtils]: 10: Hoare triple {1707#(<= 3 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1708#(<= 4 main_~i~0)} is VALID [2020-07-17 22:50:40,980 INFO L280 TraceCheckUtils]: 11: Hoare triple {1708#(<= 4 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1708#(<= 4 main_~i~0)} is VALID [2020-07-17 22:50:40,981 INFO L280 TraceCheckUtils]: 12: Hoare triple {1708#(<= 4 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1709#(<= 5 main_~i~0)} is VALID [2020-07-17 22:50:40,981 INFO L280 TraceCheckUtils]: 13: Hoare triple {1709#(<= 5 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1709#(<= 5 main_~i~0)} is VALID [2020-07-17 22:50:40,982 INFO L280 TraceCheckUtils]: 14: Hoare triple {1709#(<= 5 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1710#(<= 6 main_~i~0)} is VALID [2020-07-17 22:50:40,983 INFO L280 TraceCheckUtils]: 15: Hoare triple {1710#(<= 6 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1710#(<= 6 main_~i~0)} is VALID [2020-07-17 22:50:40,984 INFO L280 TraceCheckUtils]: 16: Hoare triple {1710#(<= 6 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1711#(<= 7 main_~i~0)} is VALID [2020-07-17 22:50:40,984 INFO L280 TraceCheckUtils]: 17: Hoare triple {1711#(<= 7 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1711#(<= 7 main_~i~0)} is VALID [2020-07-17 22:50:40,985 INFO L280 TraceCheckUtils]: 18: Hoare triple {1711#(<= 7 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1712#(<= 8 main_~i~0)} is VALID [2020-07-17 22:50:40,986 INFO L280 TraceCheckUtils]: 19: Hoare triple {1712#(<= 8 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1712#(<= 8 main_~i~0)} is VALID [2020-07-17 22:50:40,987 INFO L280 TraceCheckUtils]: 20: Hoare triple {1712#(<= 8 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1713#(<= 9 main_~i~0)} is VALID [2020-07-17 22:50:40,988 INFO L280 TraceCheckUtils]: 21: Hoare triple {1713#(<= 9 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1702#false} is VALID [2020-07-17 22:50:40,988 INFO L280 TraceCheckUtils]: 22: Hoare triple {1702#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1702#false} is VALID [2020-07-17 22:50:40,988 INFO L280 TraceCheckUtils]: 23: Hoare triple {1702#false} assume !(~i~0 <= 8); {1702#false} is VALID [2020-07-17 22:50:40,988 INFO L263 TraceCheckUtils]: 24: Hoare triple {1702#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1702#false} is VALID [2020-07-17 22:50:40,989 INFO L280 TraceCheckUtils]: 25: Hoare triple {1702#false} ~cond := #in~cond; {1702#false} is VALID [2020-07-17 22:50:40,989 INFO L280 TraceCheckUtils]: 26: Hoare triple {1702#false} assume 0 == ~cond; {1702#false} is VALID [2020-07-17 22:50:40,989 INFO L280 TraceCheckUtils]: 27: Hoare triple {1702#false} assume !false; {1702#false} is VALID [2020-07-17 22:50:40,991 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:40,991 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650974017] [2020-07-17 22:50:40,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:50:40,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-17 22:50:40,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838334022] [2020-07-17 22:50:40,993 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-07-17 22:50:40,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:40,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-17 22:50:41,032 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:41,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-17 22:50:41,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:41,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-17 22:50:41,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-07-17 22:50:41,034 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 11 states. [2020-07-17 22:50:41,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:41,166 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2020-07-17 22:50:41,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-17 22:50:41,167 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-07-17 22:50:41,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:41,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:50:41,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 29 transitions. [2020-07-17 22:50:41,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:50:41,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 29 transitions. [2020-07-17 22:50:41,169 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 29 transitions. [2020-07-17 22:50:41,202 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-17 22:50:41,202 INFO L225 Difference]: With dead ends: 29 [2020-07-17 22:50:41,202 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 22:50:41,203 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 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-17 22:50:41,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 22:50:41,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 22:50:41,203 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:41,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-17 22:50:41,204 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:50:41,204 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:50:41,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:41,204 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:50:41,204 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:50:41,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:41,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:41,205 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:50:41,205 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:50:41,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:41,205 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:50:41,205 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:50:41,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:41,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:41,206 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:41,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:41,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 22:50:41,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 22:50:41,206 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2020-07-17 22:50:41,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:41,206 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 22:50:41,207 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-17 22:50:41,207 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:50:41,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:41,207 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-17 22:50:41,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 22:50:41,332 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-17 22:50:41,332 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:50:41,332 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:50:41,332 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 22:50:41,332 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 22:50:41,332 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:50:41,333 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 11 17) the Hoare annotation is: true [2020-07-17 22:50:41,333 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 11 17) no Hoare annotation was computed. [2020-07-17 22:50:41,333 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 11 17) no Hoare annotation was computed. [2020-07-17 22:50:41,333 INFO L268 CegarLoopResult]: For program point L13-2(lines 13 15) no Hoare annotation was computed. [2020-07-17 22:50:41,333 INFO L264 CegarLoopResult]: At program point L13-3(lines 13 15) the Hoare annotation is: (or (and (<= 8 main_~sn~0) (<= 5 main_~i~0) (<= main_~sn~0 8) (<= main_~i~0 5)) (and (<= main_~i~0 3) (<= 4 main_~sn~0) (<= 3 main_~i~0) (<= main_~sn~0 4)) (and (<= main_~sn~0 0) (<= 0 main_~sn~0) (<= main_~i~0 1) (<= 1 main_~i~0)) (and (<= main_~sn~0 6) (<= main_~i~0 4) (<= 6 main_~sn~0) (<= 4 main_~i~0)) (and (<= 14 main_~sn~0) (<= main_~i~0 8) (<= 8 main_~i~0) (<= main_~sn~0 14)) (and (<= main_~sn~0 16) (<= 9 main_~i~0) (<= 16 main_~sn~0)) (and (<= main_~sn~0 10) (<= 10 main_~sn~0) (<= 6 main_~i~0) (<= main_~i~0 6)) (and (<= 2 main_~i~0) (<= main_~i~0 2) (<= main_~sn~0 2) (<= 2 main_~sn~0)) (and (<= 12 main_~sn~0) (<= main_~i~0 7) (<= 7 main_~i~0) (<= main_~sn~0 12))) [2020-07-17 22:50:41,333 INFO L264 CegarLoopResult]: At program point L13-4(lines 13 15) the Hoare annotation is: (and (<= main_~sn~0 16) (<= 16 main_~sn~0)) [2020-07-17 22:50:41,333 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2020-07-17 22:50:41,334 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2020-07-17 22:50:41,334 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-17 22:50:41,334 INFO L268 CegarLoopResult]: For program point L4(lines 4 6) no Hoare annotation was computed. [2020-07-17 22:50:41,334 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2020-07-17 22:50:41,334 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2020-07-17 22:50:41,339 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:50:41,341 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:50:41,341 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:50:41,341 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:50:41,344 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2020-07-17 22:50:41,344 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:50:41,344 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:50:41,344 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:50:41,344 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:50:41,345 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2020-07-17 22:50:41,345 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-17 22:50:41,345 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-17 22:50:41,345 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-17 22:50:41,345 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:50:41,345 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:50:41,345 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:50:41,345 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:50:41,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:50:41 BoogieIcfgContainer [2020-07-17 22:50:41,359 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:50:41,362 INFO L168 Benchmark]: Toolchain (without parser) took 7873.55 ms. Allocated memory was 146.3 MB in the beginning and 273.7 MB in the end (delta: 127.4 MB). Free memory was 102.4 MB in the beginning and 136.9 MB in the end (delta: -34.6 MB). Peak memory consumption was 92.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:41,363 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 146.3 MB. Free memory was 121.2 MB in the beginning and 121.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-17 22:50:41,363 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.99 ms. Allocated memory is still 146.3 MB. Free memory was 102.1 MB in the beginning and 92.6 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:41,364 INFO L168 Benchmark]: Boogie Preprocessor took 114.64 ms. Allocated memory was 146.3 MB in the beginning and 201.9 MB in the end (delta: 55.6 MB). Free memory was 92.6 MB in the beginning and 181.9 MB in the end (delta: -89.3 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:41,364 INFO L168 Benchmark]: RCFGBuilder took 282.68 ms. Allocated memory is still 201.9 MB. Free memory was 181.9 MB in the beginning and 167.5 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:41,365 INFO L168 Benchmark]: TraceAbstraction took 7165.06 ms. Allocated memory was 201.9 MB in the beginning and 273.7 MB in the end (delta: 71.8 MB). Free memory was 166.9 MB in the beginning and 136.9 MB in the end (delta: 30.0 MB). Peak memory consumption was 101.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:41,368 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.20 ms. Allocated memory is still 146.3 MB. Free memory was 121.2 MB in the beginning and 121.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 303.99 ms. Allocated memory is still 146.3 MB. Free memory was 102.1 MB in the beginning and 92.6 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 114.64 ms. Allocated memory was 146.3 MB in the beginning and 201.9 MB in the end (delta: 55.6 MB). Free memory was 92.6 MB in the beginning and 181.9 MB in the end (delta: -89.3 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 282.68 ms. Allocated memory is still 201.9 MB. Free memory was 181.9 MB in the beginning and 167.5 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7165.06 ms. Allocated memory was 201.9 MB in the beginning and 273.7 MB in the end (delta: 71.8 MB). Free memory was 166.9 MB in the beginning and 136.9 MB in the end (delta: 30.0 MB). Peak memory consumption was 101.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: ((((((((((8 <= sn && 5 <= i) && sn <= 8) && i <= 5) || (((i <= 3 && 4 <= sn) && 3 <= i) && sn <= 4)) || (((sn <= 0 && 0 <= sn) && i <= 1) && 1 <= i)) || (((sn <= 6 && i <= 4) && 6 <= sn) && 4 <= i)) || (((14 <= sn && i <= 8) && 8 <= i) && sn <= 14)) || ((sn <= 16 && 9 <= i) && 16 <= sn)) || (((sn <= 10 && 10 <= sn) && 6 <= i) && i <= 6)) || (((2 <= i && i <= 2) && sn <= 2) && 2 <= sn)) || (((12 <= sn && i <= 7) && 7 <= i) && sn <= 12) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 6.9s, OverallIterations: 11, TraceHistogramMax: 9, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 120 SDtfs, 38 SDslu, 424 SDs, 0 SdLazy, 293 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 245 GetRequests, 185 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=10, 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, 11 MinimizatonAttempts, 7 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 17 PreInvPairs, 27 NumberOfFragments, 127 HoareAnnotationTreeSize, 17 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 352 NumberOfCodeBlocks, 351 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 333 ConstructedInterpolants, 0 QuantifiedInterpolants, 17729 SizeOfPredicates, 8 NumberOfNonLiveVariables, 368 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 19 InterpolantComputations, 3 PerfectInterpolantSequences, 81/489 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...