/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-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:27:43,519 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:27:43,522 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:27:43,543 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:27:43,543 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:27:43,546 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:27:43,548 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:27:43,552 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:27:43,554 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:27:43,555 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:27:43,556 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:27:43,557 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:27:43,557 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:27:43,558 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:27:43,559 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:27:43,560 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:27:43,562 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:27:43,563 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:27:43,564 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:27:43,566 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:27:43,568 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:27:43,569 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:27:43,570 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:27:43,570 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:27:43,573 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:27:43,573 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:27:43,574 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:27:43,574 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:27:43,575 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:27:43,576 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:27:43,576 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:27:43,577 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:27:43,578 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:27:43,578 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:27:43,579 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:27:43,580 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:27:43,580 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:27:43,581 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:27:43,581 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:27:43,582 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:27:43,582 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:27:43,583 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-10 15:27:43,598 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:27:43,598 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:27:43,599 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:27:43,600 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:27:43,600 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:27:43,600 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:27:43,600 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:27:43,600 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:27:43,601 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:27:43,601 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:27:43,601 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:27:43,601 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:27:43,601 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:27:43,602 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:27:43,602 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:27:43,602 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:27:43,602 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:27:43,602 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:27:43,603 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:27:43,603 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:27:43,603 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:27:43,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:27:43,603 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:27:43,604 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:27:43,604 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:27:43,604 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:27:43,604 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:27:43,604 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:27:43,605 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:27:43,605 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:27:43,881 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:27:43,894 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:27:43,897 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:27:43,899 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:27:43,899 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:27:43,900 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum04-1.i [2020-07-10 15:27:43,965 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd5280b4d/2d48f7761ce74adf90d02a9b4d35b105/FLAGbc426f831 [2020-07-10 15:27:44,387 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:27:44,389 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04-1.i [2020-07-10 15:27:44,395 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd5280b4d/2d48f7761ce74adf90d02a9b4d35b105/FLAGbc426f831 [2020-07-10 15:27:44,416 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd5280b4d/2d48f7761ce74adf90d02a9b4d35b105 [2020-07-10 15:27:44,428 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:27:44,430 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:27:44,433 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:27:44,433 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:27:44,437 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:27:44,439 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:27:44" (1/1) ... [2020-07-10 15:27:44,443 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a233bc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:44, skipping insertion in model container [2020-07-10 15:27:44,443 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:27:44" (1/1) ... [2020-07-10 15:27:44,454 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:27:44,476 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:27:44,688 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:27:44,693 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:27:44,710 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:27:44,726 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:27:44,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:44 WrapperNode [2020-07-10 15:27:44,727 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:27:44,728 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:27:44,728 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:27:44,728 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:27:44,743 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:44" (1/1) ... [2020-07-10 15:27:44,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:44" (1/1) ... [2020-07-10 15:27:44,748 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:44" (1/1) ... [2020-07-10 15:27:44,749 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:44" (1/1) ... [2020-07-10 15:27:44,837 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:44" (1/1) ... [2020-07-10 15:27:44,843 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:44" (1/1) ... [2020-07-10 15:27:44,844 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:44" (1/1) ... [2020-07-10 15:27:44,845 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:27:44,846 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:27:44,846 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:27:44,846 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:27:44,847 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:44" (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-10 15:27:44,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:27:44,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:27:44,925 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:27:44,925 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:27:44,926 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:27:44,926 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:27:44,926 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:27:44,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:27:44,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:27:45,145 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:27:45,146 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 15:27:45,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:27:45 BoogieIcfgContainer [2020-07-10 15:27:45,150 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:27:45,151 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:27:45,152 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:27:45,155 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:27:45,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:27:44" (1/3) ... [2020-07-10 15:27:45,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ce547c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:27:45, skipping insertion in model container [2020-07-10 15:27:45,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:44" (2/3) ... [2020-07-10 15:27:45,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ce547c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:27:45, skipping insertion in model container [2020-07-10 15:27:45,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:27:45" (3/3) ... [2020-07-10 15:27:45,159 INFO L109 eAbstractionObserver]: Analyzing ICFG sum04-1.i [2020-07-10 15:27:45,171 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:27:45,178 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:27:45,194 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:27:45,218 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:27:45,218 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:27:45,218 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:27:45,218 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:27:45,219 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:27:45,219 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:27:45,219 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:27:45,219 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:27:45,238 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-07-10 15:27:45,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-10 15:27:45,244 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:45,245 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:45,246 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:45,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:45,251 INFO L82 PathProgramCache]: Analyzing trace with hash -721501374, now seen corresponding path program 1 times [2020-07-10 15:27:45,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:45,261 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227241910] [2020-07-10 15:27:45,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:45,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:45,387 INFO L280 TraceCheckUtils]: 0: Hoare triple {22#true} assume true; {22#true} is VALID [2020-07-10 15:27:45,388 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {22#true} {22#true} #37#return; {22#true} is VALID [2020-07-10 15:27:45,390 INFO L263 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2020-07-10 15:27:45,391 INFO L280 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2020-07-10 15:27:45,392 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #37#return; {22#true} is VALID [2020-07-10 15:27:45,392 INFO L263 TraceCheckUtils]: 3: Hoare triple {22#true} call #t~ret1 := main(); {22#true} is VALID [2020-07-10 15:27:45,393 INFO L280 TraceCheckUtils]: 4: Hoare triple {22#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {22#true} is VALID [2020-07-10 15:27:45,394 INFO L280 TraceCheckUtils]: 5: Hoare triple {22#true} assume !true; {23#false} is VALID [2020-07-10 15:27:45,395 INFO L263 TraceCheckUtils]: 6: Hoare triple {23#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {23#false} is VALID [2020-07-10 15:27:45,395 INFO L280 TraceCheckUtils]: 7: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2020-07-10 15:27:45,395 INFO L280 TraceCheckUtils]: 8: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2020-07-10 15:27:45,396 INFO L280 TraceCheckUtils]: 9: Hoare triple {23#false} assume !false; {23#false} is VALID [2020-07-10 15:27:45,397 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-10 15:27:45,398 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227241910] [2020-07-10 15:27:45,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:27:45,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-10 15:27:45,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093581457] [2020-07-10 15:27:45,406 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-10 15:27:45,409 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:45,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-10 15:27:45,441 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-10 15:27:45,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-10 15:27:45,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:45,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-10 15:27:45,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-10 15:27:45,455 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2020-07-10 15:27:45,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:45,530 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2020-07-10 15:27:45,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-10 15:27:45,531 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-10 15:27:45,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:45,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 15:27:45,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2020-07-10 15:27:45,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 15:27:45,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2020-07-10 15:27:45,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 34 transitions. [2020-07-10 15:27:45,699 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-10 15:27:45,711 INFO L225 Difference]: With dead ends: 30 [2020-07-10 15:27:45,711 INFO L226 Difference]: Without dead ends: 13 [2020-07-10 15:27:45,716 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-10 15:27:45,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-07-10 15:27:45,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-07-10 15:27:45,757 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:45,758 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2020-07-10 15:27:45,759 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2020-07-10 15:27:45,759 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2020-07-10 15:27:45,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:45,763 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2020-07-10 15:27:45,763 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2020-07-10 15:27:45,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:45,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:45,764 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2020-07-10 15:27:45,765 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2020-07-10 15:27:45,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:45,768 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2020-07-10 15:27:45,769 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2020-07-10 15:27:45,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:45,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:45,770 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:45,770 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:45,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 15:27:45,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2020-07-10 15:27:45,774 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2020-07-10 15:27:45,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:45,775 INFO L479 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2020-07-10 15:27:45,775 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-10 15:27:45,775 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2020-07-10 15:27:45,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-10 15:27:45,776 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:45,776 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:45,777 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:27:45,777 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:45,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:45,778 INFO L82 PathProgramCache]: Analyzing trace with hash -731660105, now seen corresponding path program 1 times [2020-07-10 15:27:45,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:45,780 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635912717] [2020-07-10 15:27:45,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:45,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:45,861 INFO L280 TraceCheckUtils]: 0: Hoare triple {113#true} assume true; {113#true} is VALID [2020-07-10 15:27:45,861 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {113#true} {113#true} #37#return; {113#true} is VALID [2020-07-10 15:27:45,862 INFO L263 TraceCheckUtils]: 0: Hoare triple {113#true} call ULTIMATE.init(); {113#true} is VALID [2020-07-10 15:27:45,862 INFO L280 TraceCheckUtils]: 1: Hoare triple {113#true} assume true; {113#true} is VALID [2020-07-10 15:27:45,862 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {113#true} {113#true} #37#return; {113#true} is VALID [2020-07-10 15:27:45,863 INFO L263 TraceCheckUtils]: 3: Hoare triple {113#true} call #t~ret1 := main(); {113#true} is VALID [2020-07-10 15:27:45,866 INFO L280 TraceCheckUtils]: 4: Hoare triple {113#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {117#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:45,867 INFO L280 TraceCheckUtils]: 5: Hoare triple {117#(<= main_~i~0 1)} assume !(~i~0 <= 8); {114#false} is VALID [2020-07-10 15:27:45,868 INFO L263 TraceCheckUtils]: 6: Hoare triple {114#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {114#false} is VALID [2020-07-10 15:27:45,868 INFO L280 TraceCheckUtils]: 7: Hoare triple {114#false} ~cond := #in~cond; {114#false} is VALID [2020-07-10 15:27:45,869 INFO L280 TraceCheckUtils]: 8: Hoare triple {114#false} assume 0 == ~cond; {114#false} is VALID [2020-07-10 15:27:45,869 INFO L280 TraceCheckUtils]: 9: Hoare triple {114#false} assume !false; {114#false} is VALID [2020-07-10 15:27:45,870 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-10 15:27:45,871 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635912717] [2020-07-10 15:27:45,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:27:45,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:27:45,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240653779] [2020-07-10 15:27:45,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-10 15:27:45,878 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:45,878 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:27:45,906 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-10 15:27:45,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:27:45,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:45,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:27:45,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:27:45,908 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2020-07-10 15:27:45,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:45,970 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2020-07-10 15:27:45,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:27:45,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-10 15:27:45,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:45,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:27:45,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2020-07-10 15:27:45,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:27:45,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2020-07-10 15:27:45,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 28 transitions. [2020-07-10 15:27:46,018 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-10 15:27:46,020 INFO L225 Difference]: With dead ends: 24 [2020-07-10 15:27:46,020 INFO L226 Difference]: Without dead ends: 16 [2020-07-10 15:27:46,021 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-10 15:27:46,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-10 15:27:46,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-07-10 15:27:46,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:46,033 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 15 states. [2020-07-10 15:27:46,033 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 15 states. [2020-07-10 15:27:46,033 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 15 states. [2020-07-10 15:27:46,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:46,036 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2020-07-10 15:27:46,036 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2020-07-10 15:27:46,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:46,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:46,037 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 16 states. [2020-07-10 15:27:46,037 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 16 states. [2020-07-10 15:27:46,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:46,040 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2020-07-10 15:27:46,040 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2020-07-10 15:27:46,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:46,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:46,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:46,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:46,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 15:27:46,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2020-07-10 15:27:46,044 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2020-07-10 15:27:46,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:46,044 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-07-10 15:27:46,044 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:27:46,044 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2020-07-10 15:27:46,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-10 15:27:46,045 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:46,045 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:46,046 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:27:46,046 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:46,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:46,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1637338477, now seen corresponding path program 1 times [2020-07-10 15:27:46,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:46,047 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808924049] [2020-07-10 15:27:46,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:46,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:46,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:46,134 INFO L280 TraceCheckUtils]: 0: Hoare triple {210#true} assume true; {210#true} is VALID [2020-07-10 15:27:46,135 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {210#true} {210#true} #37#return; {210#true} is VALID [2020-07-10 15:27:46,135 INFO L263 TraceCheckUtils]: 0: Hoare triple {210#true} call ULTIMATE.init(); {210#true} is VALID [2020-07-10 15:27:46,136 INFO L280 TraceCheckUtils]: 1: Hoare triple {210#true} assume true; {210#true} is VALID [2020-07-10 15:27:46,136 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {210#true} {210#true} #37#return; {210#true} is VALID [2020-07-10 15:27:46,136 INFO L263 TraceCheckUtils]: 3: Hoare triple {210#true} call #t~ret1 := main(); {210#true} is VALID [2020-07-10 15:27:46,138 INFO L280 TraceCheckUtils]: 4: Hoare triple {210#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {214#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:46,139 INFO L280 TraceCheckUtils]: 5: Hoare triple {214#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {214#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:46,141 INFO L280 TraceCheckUtils]: 6: Hoare triple {214#(<= main_~i~0 1)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {214#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:46,142 INFO L280 TraceCheckUtils]: 7: Hoare triple {214#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {215#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:46,145 INFO L280 TraceCheckUtils]: 8: Hoare triple {215#(<= main_~i~0 2)} assume !(~i~0 <= 8); {211#false} is VALID [2020-07-10 15:27:46,146 INFO L263 TraceCheckUtils]: 9: Hoare triple {211#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {211#false} is VALID [2020-07-10 15:27:46,146 INFO L280 TraceCheckUtils]: 10: Hoare triple {211#false} ~cond := #in~cond; {211#false} is VALID [2020-07-10 15:27:46,147 INFO L280 TraceCheckUtils]: 11: Hoare triple {211#false} assume 0 == ~cond; {211#false} is VALID [2020-07-10 15:27:46,147 INFO L280 TraceCheckUtils]: 12: Hoare triple {211#false} assume !false; {211#false} is VALID [2020-07-10 15:27:46,150 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-10 15:27:46,151 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808924049] [2020-07-10 15:27:46,151 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367941962] [2020-07-10 15:27:46,151 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-10 15:27:46,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:46,182 INFO L264 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-10 15:27:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:46,196 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:46,267 INFO L263 TraceCheckUtils]: 0: Hoare triple {210#true} call ULTIMATE.init(); {210#true} is VALID [2020-07-10 15:27:46,267 INFO L280 TraceCheckUtils]: 1: Hoare triple {210#true} assume true; {210#true} is VALID [2020-07-10 15:27:46,268 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {210#true} {210#true} #37#return; {210#true} is VALID [2020-07-10 15:27:46,277 INFO L263 TraceCheckUtils]: 3: Hoare triple {210#true} call #t~ret1 := main(); {210#true} is VALID [2020-07-10 15:27:46,279 INFO L280 TraceCheckUtils]: 4: Hoare triple {210#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {214#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:46,280 INFO L280 TraceCheckUtils]: 5: Hoare triple {214#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {214#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:46,280 INFO L280 TraceCheckUtils]: 6: Hoare triple {214#(<= main_~i~0 1)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {214#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:46,281 INFO L280 TraceCheckUtils]: 7: Hoare triple {214#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {215#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:46,283 INFO L280 TraceCheckUtils]: 8: Hoare triple {215#(<= main_~i~0 2)} assume !(~i~0 <= 8); {211#false} is VALID [2020-07-10 15:27:46,283 INFO L263 TraceCheckUtils]: 9: Hoare triple {211#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {211#false} is VALID [2020-07-10 15:27:46,283 INFO L280 TraceCheckUtils]: 10: Hoare triple {211#false} ~cond := #in~cond; {211#false} is VALID [2020-07-10 15:27:46,283 INFO L280 TraceCheckUtils]: 11: Hoare triple {211#false} assume 0 == ~cond; {211#false} is VALID [2020-07-10 15:27:46,284 INFO L280 TraceCheckUtils]: 12: Hoare triple {211#false} assume !false; {211#false} is VALID [2020-07-10 15:27:46,285 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-10 15:27:46,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:27:46,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-07-10 15:27:46,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258834562] [2020-07-10 15:27:46,286 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-07-10 15:27:46,286 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:46,287 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 15:27:46,316 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:46,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 15:27:46,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:46,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 15:27:46,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:27:46,317 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 4 states. [2020-07-10 15:27:46,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:46,386 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2020-07-10 15:27:46,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 15:27:46,387 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-07-10 15:27:46,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:46,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:27:46,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2020-07-10 15:27:46,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:27:46,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2020-07-10 15:27:46,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 31 transitions. [2020-07-10 15:27:46,434 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-10 15:27:46,435 INFO L225 Difference]: With dead ends: 27 [2020-07-10 15:27:46,435 INFO L226 Difference]: Without dead ends: 19 [2020-07-10 15:27:46,436 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 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-10 15:27:46,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-10 15:27:46,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2020-07-10 15:27:46,446 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:46,446 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 18 states. [2020-07-10 15:27:46,446 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 18 states. [2020-07-10 15:27:46,446 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 18 states. [2020-07-10 15:27:46,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:46,449 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2020-07-10 15:27:46,449 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2020-07-10 15:27:46,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:46,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:46,450 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 19 states. [2020-07-10 15:27:46,450 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 19 states. [2020-07-10 15:27:46,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:46,452 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2020-07-10 15:27:46,452 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2020-07-10 15:27:46,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:46,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:46,453 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:46,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:46,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-10 15:27:46,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2020-07-10 15:27:46,455 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2020-07-10 15:27:46,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:46,455 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2020-07-10 15:27:46,455 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 15:27:46,455 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-10 15:27:46,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-10 15:27:46,456 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:46,456 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:46,670 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-10 15:27:46,670 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:46,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:46,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1717165257, now seen corresponding path program 2 times [2020-07-10 15:27:46,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:46,671 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557618522] [2020-07-10 15:27:46,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:46,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:46,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:46,736 INFO L280 TraceCheckUtils]: 0: Hoare triple {358#true} assume true; {358#true} is VALID [2020-07-10 15:27:46,736 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {358#true} {358#true} #37#return; {358#true} is VALID [2020-07-10 15:27:46,737 INFO L263 TraceCheckUtils]: 0: Hoare triple {358#true} call ULTIMATE.init(); {358#true} is VALID [2020-07-10 15:27:46,737 INFO L280 TraceCheckUtils]: 1: Hoare triple {358#true} assume true; {358#true} is VALID [2020-07-10 15:27:46,737 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {358#true} {358#true} #37#return; {358#true} is VALID [2020-07-10 15:27:46,738 INFO L263 TraceCheckUtils]: 3: Hoare triple {358#true} call #t~ret1 := main(); {358#true} is VALID [2020-07-10 15:27:46,739 INFO L280 TraceCheckUtils]: 4: Hoare triple {358#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {362#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:46,740 INFO L280 TraceCheckUtils]: 5: Hoare triple {362#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {362#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:46,741 INFO L280 TraceCheckUtils]: 6: Hoare triple {362#(<= main_~i~0 1)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {362#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:46,742 INFO L280 TraceCheckUtils]: 7: Hoare triple {362#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {363#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:46,744 INFO L280 TraceCheckUtils]: 8: Hoare triple {363#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {363#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:46,747 INFO L280 TraceCheckUtils]: 9: Hoare triple {363#(<= main_~i~0 2)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {363#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:46,748 INFO L280 TraceCheckUtils]: 10: Hoare triple {363#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {364#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:46,749 INFO L280 TraceCheckUtils]: 11: Hoare triple {364#(<= main_~i~0 3)} assume !(~i~0 <= 8); {359#false} is VALID [2020-07-10 15:27:46,749 INFO L263 TraceCheckUtils]: 12: Hoare triple {359#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {359#false} is VALID [2020-07-10 15:27:46,749 INFO L280 TraceCheckUtils]: 13: Hoare triple {359#false} ~cond := #in~cond; {359#false} is VALID [2020-07-10 15:27:46,750 INFO L280 TraceCheckUtils]: 14: Hoare triple {359#false} assume 0 == ~cond; {359#false} is VALID [2020-07-10 15:27:46,750 INFO L280 TraceCheckUtils]: 15: Hoare triple {359#false} assume !false; {359#false} is VALID [2020-07-10 15:27:46,751 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:46,751 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557618522] [2020-07-10 15:27:46,751 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127691614] [2020-07-10 15:27:46,751 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-10 15:27:46,783 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:27:46,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:27:46,784 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-10 15:27:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:46,791 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:46,831 INFO L263 TraceCheckUtils]: 0: Hoare triple {358#true} call ULTIMATE.init(); {358#true} is VALID [2020-07-10 15:27:46,831 INFO L280 TraceCheckUtils]: 1: Hoare triple {358#true} assume true; {358#true} is VALID [2020-07-10 15:27:46,831 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {358#true} {358#true} #37#return; {358#true} is VALID [2020-07-10 15:27:46,832 INFO L263 TraceCheckUtils]: 3: Hoare triple {358#true} call #t~ret1 := main(); {358#true} is VALID [2020-07-10 15:27:46,833 INFO L280 TraceCheckUtils]: 4: Hoare triple {358#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {362#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:46,833 INFO L280 TraceCheckUtils]: 5: Hoare triple {362#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {362#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:46,834 INFO L280 TraceCheckUtils]: 6: Hoare triple {362#(<= main_~i~0 1)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {362#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:46,835 INFO L280 TraceCheckUtils]: 7: Hoare triple {362#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {363#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:46,836 INFO L280 TraceCheckUtils]: 8: Hoare triple {363#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {363#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:46,837 INFO L280 TraceCheckUtils]: 9: Hoare triple {363#(<= main_~i~0 2)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {363#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:46,838 INFO L280 TraceCheckUtils]: 10: Hoare triple {363#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {364#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:46,839 INFO L280 TraceCheckUtils]: 11: Hoare triple {364#(<= main_~i~0 3)} assume !(~i~0 <= 8); {359#false} is VALID [2020-07-10 15:27:46,840 INFO L263 TraceCheckUtils]: 12: Hoare triple {359#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {359#false} is VALID [2020-07-10 15:27:46,840 INFO L280 TraceCheckUtils]: 13: Hoare triple {359#false} ~cond := #in~cond; {359#false} is VALID [2020-07-10 15:27:46,840 INFO L280 TraceCheckUtils]: 14: Hoare triple {359#false} assume 0 == ~cond; {359#false} is VALID [2020-07-10 15:27:46,840 INFO L280 TraceCheckUtils]: 15: Hoare triple {359#false} assume !false; {359#false} is VALID [2020-07-10 15:27:46,841 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:46,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:27:46,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-07-10 15:27:46,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044736200] [2020-07-10 15:27:46,843 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-10 15:27:46,843 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:46,843 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:27:46,865 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-10 15:27:46,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:27:46,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:46,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:27:46,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:27:46,867 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 5 states. [2020-07-10 15:27:46,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:46,948 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2020-07-10 15:27:46,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:27:46,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-10 15:27:46,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:46,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:27:46,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2020-07-10 15:27:46,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:27:46,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2020-07-10 15:27:46,953 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 34 transitions. [2020-07-10 15:27:46,994 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-10 15:27:46,995 INFO L225 Difference]: With dead ends: 30 [2020-07-10 15:27:46,996 INFO L226 Difference]: Without dead ends: 22 [2020-07-10 15:27:46,996 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-10 15:27:46,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-10 15:27:47,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2020-07-10 15:27:47,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:47,009 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 21 states. [2020-07-10 15:27:47,010 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 21 states. [2020-07-10 15:27:47,010 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 21 states. [2020-07-10 15:27:47,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:47,012 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-07-10 15:27:47,012 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-10 15:27:47,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:47,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:47,013 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 22 states. [2020-07-10 15:27:47,013 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 22 states. [2020-07-10 15:27:47,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:47,015 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-07-10 15:27:47,015 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-10 15:27:47,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:47,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:47,016 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:47,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:47,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-10 15:27:47,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2020-07-10 15:27:47,018 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 16 [2020-07-10 15:27:47,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:47,019 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-07-10 15:27:47,019 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:27:47,019 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-10 15:27:47,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-10 15:27:47,020 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:47,020 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:47,225 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:47,226 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:47,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:47,227 INFO L82 PathProgramCache]: Analyzing trace with hash -424886253, now seen corresponding path program 3 times [2020-07-10 15:27:47,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:47,227 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074383139] [2020-07-10 15:27:47,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:47,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:47,274 INFO L280 TraceCheckUtils]: 0: Hoare triple {530#true} assume true; {530#true} is VALID [2020-07-10 15:27:47,275 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {530#true} {530#true} #37#return; {530#true} is VALID [2020-07-10 15:27:47,275 INFO L263 TraceCheckUtils]: 0: Hoare triple {530#true} call ULTIMATE.init(); {530#true} is VALID [2020-07-10 15:27:47,275 INFO L280 TraceCheckUtils]: 1: Hoare triple {530#true} assume true; {530#true} is VALID [2020-07-10 15:27:47,276 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {530#true} {530#true} #37#return; {530#true} is VALID [2020-07-10 15:27:47,276 INFO L263 TraceCheckUtils]: 3: Hoare triple {530#true} call #t~ret1 := main(); {530#true} is VALID [2020-07-10 15:27:47,276 INFO L280 TraceCheckUtils]: 4: Hoare triple {530#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {530#true} is VALID [2020-07-10 15:27:47,276 INFO L280 TraceCheckUtils]: 5: Hoare triple {530#true} assume !!(~i~0 <= 8); {530#true} is VALID [2020-07-10 15:27:47,277 INFO L280 TraceCheckUtils]: 6: Hoare triple {530#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {530#true} is VALID [2020-07-10 15:27:47,277 INFO L280 TraceCheckUtils]: 7: Hoare triple {530#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {530#true} is VALID [2020-07-10 15:27:47,277 INFO L280 TraceCheckUtils]: 8: Hoare triple {530#true} assume !!(~i~0 <= 8); {530#true} is VALID [2020-07-10 15:27:47,278 INFO L280 TraceCheckUtils]: 9: Hoare triple {530#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {530#true} is VALID [2020-07-10 15:27:47,278 INFO L280 TraceCheckUtils]: 10: Hoare triple {530#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {530#true} is VALID [2020-07-10 15:27:47,278 INFO L280 TraceCheckUtils]: 11: Hoare triple {530#true} assume !!(~i~0 <= 8); {530#true} is VALID [2020-07-10 15:27:47,279 INFO L280 TraceCheckUtils]: 12: Hoare triple {530#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {534#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:47,280 INFO L280 TraceCheckUtils]: 13: Hoare triple {534#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {535#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:47,281 INFO L280 TraceCheckUtils]: 14: Hoare triple {535#(<= main_~i~0 4)} assume !(~i~0 <= 8); {531#false} is VALID [2020-07-10 15:27:47,282 INFO L263 TraceCheckUtils]: 15: Hoare triple {531#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {531#false} is VALID [2020-07-10 15:27:47,282 INFO L280 TraceCheckUtils]: 16: Hoare triple {531#false} ~cond := #in~cond; {531#false} is VALID [2020-07-10 15:27:47,282 INFO L280 TraceCheckUtils]: 17: Hoare triple {531#false} assume 0 == ~cond; {531#false} is VALID [2020-07-10 15:27:47,283 INFO L280 TraceCheckUtils]: 18: Hoare triple {531#false} assume !false; {531#false} is VALID [2020-07-10 15:27:47,283 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-10 15:27:47,284 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074383139] [2020-07-10 15:27:47,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:27:47,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 15:27:47,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493426848] [2020-07-10 15:27:47,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-07-10 15:27:47,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:47,285 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 15:27:47,302 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:47,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 15:27:47,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:47,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 15:27:47,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:27:47,304 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 4 states. [2020-07-10 15:27:47,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:47,363 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2020-07-10 15:27:47,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 15:27:47,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-07-10 15:27:47,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:47,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:27:47,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2020-07-10 15:27:47,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:27:47,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2020-07-10 15:27:47,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 26 transitions. [2020-07-10 15:27:47,401 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:47,402 INFO L225 Difference]: With dead ends: 30 [2020-07-10 15:27:47,403 INFO L226 Difference]: Without dead ends: 25 [2020-07-10 15:27:47,403 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-10 15:27:47,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-10 15:27:47,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2020-07-10 15:27:47,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:47,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 23 states. [2020-07-10 15:27:47,421 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 23 states. [2020-07-10 15:27:47,421 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 23 states. [2020-07-10 15:27:47,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:47,423 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-10 15:27:47,423 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-10 15:27:47,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:47,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:47,424 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 25 states. [2020-07-10 15:27:47,424 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 25 states. [2020-07-10 15:27:47,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:47,426 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-10 15:27:47,427 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-10 15:27:47,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:47,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:47,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:47,428 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:47,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-10 15:27:47,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2020-07-10 15:27:47,430 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 19 [2020-07-10 15:27:47,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:47,430 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2020-07-10 15:27:47,430 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 15:27:47,431 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-10 15:27:47,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 15:27:47,432 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:47,432 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:47,432 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 15:27:47,432 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:47,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:47,433 INFO L82 PathProgramCache]: Analyzing trace with hash -452912071, now seen corresponding path program 1 times [2020-07-10 15:27:47,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:47,433 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557563652] [2020-07-10 15:27:47,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:47,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:47,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:47,498 INFO L280 TraceCheckUtils]: 0: Hoare triple {665#true} assume true; {665#true} is VALID [2020-07-10 15:27:47,498 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {665#true} {665#true} #37#return; {665#true} is VALID [2020-07-10 15:27:47,499 INFO L263 TraceCheckUtils]: 0: Hoare triple {665#true} call ULTIMATE.init(); {665#true} is VALID [2020-07-10 15:27:47,499 INFO L280 TraceCheckUtils]: 1: Hoare triple {665#true} assume true; {665#true} is VALID [2020-07-10 15:27:47,499 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {665#true} {665#true} #37#return; {665#true} is VALID [2020-07-10 15:27:47,500 INFO L263 TraceCheckUtils]: 3: Hoare triple {665#true} call #t~ret1 := main(); {665#true} is VALID [2020-07-10 15:27:47,500 INFO L280 TraceCheckUtils]: 4: Hoare triple {665#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {665#true} is VALID [2020-07-10 15:27:47,500 INFO L280 TraceCheckUtils]: 5: Hoare triple {665#true} assume !!(~i~0 <= 8); {665#true} is VALID [2020-07-10 15:27:47,500 INFO L280 TraceCheckUtils]: 6: Hoare triple {665#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {665#true} is VALID [2020-07-10 15:27:47,501 INFO L280 TraceCheckUtils]: 7: Hoare triple {665#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {665#true} is VALID [2020-07-10 15:27:47,501 INFO L280 TraceCheckUtils]: 8: Hoare triple {665#true} assume !!(~i~0 <= 8); {665#true} is VALID [2020-07-10 15:27:47,501 INFO L280 TraceCheckUtils]: 9: Hoare triple {665#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {665#true} is VALID [2020-07-10 15:27:47,502 INFO L280 TraceCheckUtils]: 10: Hoare triple {665#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {665#true} is VALID [2020-07-10 15:27:47,502 INFO L280 TraceCheckUtils]: 11: Hoare triple {665#true} assume !!(~i~0 <= 8); {665#true} is VALID [2020-07-10 15:27:47,503 INFO L280 TraceCheckUtils]: 12: Hoare triple {665#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {669#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:47,504 INFO L280 TraceCheckUtils]: 13: Hoare triple {669#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {670#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:47,505 INFO L280 TraceCheckUtils]: 14: Hoare triple {670#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {670#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:47,506 INFO L280 TraceCheckUtils]: 15: Hoare triple {670#(<= main_~i~0 4)} assume !(~i~0 < 4); {670#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:47,507 INFO L280 TraceCheckUtils]: 16: Hoare triple {670#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {671#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:47,508 INFO L280 TraceCheckUtils]: 17: Hoare triple {671#(<= main_~i~0 5)} assume !(~i~0 <= 8); {666#false} is VALID [2020-07-10 15:27:47,509 INFO L263 TraceCheckUtils]: 18: Hoare triple {666#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {666#false} is VALID [2020-07-10 15:27:47,509 INFO L280 TraceCheckUtils]: 19: Hoare triple {666#false} ~cond := #in~cond; {666#false} is VALID [2020-07-10 15:27:47,509 INFO L280 TraceCheckUtils]: 20: Hoare triple {666#false} assume 0 == ~cond; {666#false} is VALID [2020-07-10 15:27:47,510 INFO L280 TraceCheckUtils]: 21: Hoare triple {666#false} assume !false; {666#false} is VALID [2020-07-10 15:27:47,511 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-10 15:27:47,512 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557563652] [2020-07-10 15:27:47,512 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308104408] [2020-07-10 15:27:47,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:47,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:47,538 INFO L264 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-10 15:27:47,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:47,548 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:47,641 INFO L263 TraceCheckUtils]: 0: Hoare triple {665#true} call ULTIMATE.init(); {665#true} is VALID [2020-07-10 15:27:47,641 INFO L280 TraceCheckUtils]: 1: Hoare triple {665#true} assume true; {665#true} is VALID [2020-07-10 15:27:47,642 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {665#true} {665#true} #37#return; {665#true} is VALID [2020-07-10 15:27:47,642 INFO L263 TraceCheckUtils]: 3: Hoare triple {665#true} call #t~ret1 := main(); {665#true} is VALID [2020-07-10 15:27:47,643 INFO L280 TraceCheckUtils]: 4: Hoare triple {665#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {687#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:47,643 INFO L280 TraceCheckUtils]: 5: Hoare triple {687#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {687#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:47,644 INFO L280 TraceCheckUtils]: 6: Hoare triple {687#(<= main_~i~0 1)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {687#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:47,645 INFO L280 TraceCheckUtils]: 7: Hoare triple {687#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {697#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:47,646 INFO L280 TraceCheckUtils]: 8: Hoare triple {697#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {697#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:47,646 INFO L280 TraceCheckUtils]: 9: Hoare triple {697#(<= main_~i~0 2)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {697#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:47,647 INFO L280 TraceCheckUtils]: 10: Hoare triple {697#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {669#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:47,648 INFO L280 TraceCheckUtils]: 11: Hoare triple {669#(<= main_~i~0 3)} assume !!(~i~0 <= 8); {669#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:47,648 INFO L280 TraceCheckUtils]: 12: Hoare triple {669#(<= main_~i~0 3)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {669#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:47,649 INFO L280 TraceCheckUtils]: 13: Hoare triple {669#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {670#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:47,650 INFO L280 TraceCheckUtils]: 14: Hoare triple {670#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {670#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:47,651 INFO L280 TraceCheckUtils]: 15: Hoare triple {670#(<= main_~i~0 4)} assume !(~i~0 < 4); {670#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:47,652 INFO L280 TraceCheckUtils]: 16: Hoare triple {670#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {671#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:47,652 INFO L280 TraceCheckUtils]: 17: Hoare triple {671#(<= main_~i~0 5)} assume !(~i~0 <= 8); {666#false} is VALID [2020-07-10 15:27:47,653 INFO L263 TraceCheckUtils]: 18: Hoare triple {666#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {666#false} is VALID [2020-07-10 15:27:47,653 INFO L280 TraceCheckUtils]: 19: Hoare triple {666#false} ~cond := #in~cond; {666#false} is VALID [2020-07-10 15:27:47,653 INFO L280 TraceCheckUtils]: 20: Hoare triple {666#false} assume 0 == ~cond; {666#false} is VALID [2020-07-10 15:27:47,654 INFO L280 TraceCheckUtils]: 21: Hoare triple {666#false} assume !false; {666#false} is VALID [2020-07-10 15:27:47,654 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:47,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:27:47,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 7 [2020-07-10 15:27:47,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406039039] [2020-07-10 15:27:47,656 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-07-10 15:27:47,656 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:47,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:27:47,688 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-10 15:27:47,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:27:47,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:47,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:27:47,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:27:47,689 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 7 states. [2020-07-10 15:27:47,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:47,790 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2020-07-10 15:27:47,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:27:47,790 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-07-10 15:27:47,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:47,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:27:47,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2020-07-10 15:27:47,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:27:47,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2020-07-10 15:27:47,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 36 transitions. [2020-07-10 15:27:47,834 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:47,835 INFO L225 Difference]: With dead ends: 33 [2020-07-10 15:27:47,835 INFO L226 Difference]: Without dead ends: 28 [2020-07-10 15:27:47,836 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:27:47,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-10 15:27:47,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2020-07-10 15:27:47,849 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:47,849 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 26 states. [2020-07-10 15:27:47,849 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 26 states. [2020-07-10 15:27:47,850 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 26 states. [2020-07-10 15:27:47,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:47,852 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2020-07-10 15:27:47,852 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2020-07-10 15:27:47,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:47,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:47,853 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 28 states. [2020-07-10 15:27:47,853 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 28 states. [2020-07-10 15:27:47,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:47,855 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2020-07-10 15:27:47,855 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2020-07-10 15:27:47,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:47,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:47,856 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:47,856 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:47,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-10 15:27:47,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2020-07-10 15:27:47,858 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 22 [2020-07-10 15:27:47,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:47,858 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2020-07-10 15:27:47,858 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:27:47,858 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-07-10 15:27:47,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-10 15:27:47,859 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:47,859 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:48,060 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:48,060 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:48,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:48,061 INFO L82 PathProgramCache]: Analyzing trace with hash -2146400685, now seen corresponding path program 2 times [2020-07-10 15:27:48,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:48,061 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404757107] [2020-07-10 15:27:48,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:48,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:48,158 INFO L280 TraceCheckUtils]: 0: Hoare triple {880#true} assume true; {880#true} is VALID [2020-07-10 15:27:48,158 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {880#true} {880#true} #37#return; {880#true} is VALID [2020-07-10 15:27:48,159 INFO L263 TraceCheckUtils]: 0: Hoare triple {880#true} call ULTIMATE.init(); {880#true} is VALID [2020-07-10 15:27:48,159 INFO L280 TraceCheckUtils]: 1: Hoare triple {880#true} assume true; {880#true} is VALID [2020-07-10 15:27:48,159 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {880#true} {880#true} #37#return; {880#true} is VALID [2020-07-10 15:27:48,159 INFO L263 TraceCheckUtils]: 3: Hoare triple {880#true} call #t~ret1 := main(); {880#true} is VALID [2020-07-10 15:27:48,160 INFO L280 TraceCheckUtils]: 4: Hoare triple {880#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {880#true} is VALID [2020-07-10 15:27:48,160 INFO L280 TraceCheckUtils]: 5: Hoare triple {880#true} assume !!(~i~0 <= 8); {880#true} is VALID [2020-07-10 15:27:48,160 INFO L280 TraceCheckUtils]: 6: Hoare triple {880#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {880#true} is VALID [2020-07-10 15:27:48,160 INFO L280 TraceCheckUtils]: 7: Hoare triple {880#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {880#true} is VALID [2020-07-10 15:27:48,160 INFO L280 TraceCheckUtils]: 8: Hoare triple {880#true} assume !!(~i~0 <= 8); {880#true} is VALID [2020-07-10 15:27:48,161 INFO L280 TraceCheckUtils]: 9: Hoare triple {880#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {880#true} is VALID [2020-07-10 15:27:48,161 INFO L280 TraceCheckUtils]: 10: Hoare triple {880#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {880#true} is VALID [2020-07-10 15:27:48,161 INFO L280 TraceCheckUtils]: 11: Hoare triple {880#true} assume !!(~i~0 <= 8); {880#true} is VALID [2020-07-10 15:27:48,162 INFO L280 TraceCheckUtils]: 12: Hoare triple {880#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {884#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:48,163 INFO L280 TraceCheckUtils]: 13: Hoare triple {884#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {885#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:48,163 INFO L280 TraceCheckUtils]: 14: Hoare triple {885#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {885#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:48,164 INFO L280 TraceCheckUtils]: 15: Hoare triple {885#(<= main_~i~0 4)} assume !(~i~0 < 4); {885#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:48,164 INFO L280 TraceCheckUtils]: 16: Hoare triple {885#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {886#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:48,165 INFO L280 TraceCheckUtils]: 17: Hoare triple {886#(<= main_~i~0 5)} assume !!(~i~0 <= 8); {886#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:48,165 INFO L280 TraceCheckUtils]: 18: Hoare triple {886#(<= main_~i~0 5)} assume !(~i~0 < 4); {886#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:48,166 INFO L280 TraceCheckUtils]: 19: Hoare triple {886#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {887#(<= main_~i~0 6)} is VALID [2020-07-10 15:27:48,167 INFO L280 TraceCheckUtils]: 20: Hoare triple {887#(<= main_~i~0 6)} assume !(~i~0 <= 8); {881#false} is VALID [2020-07-10 15:27:48,167 INFO L263 TraceCheckUtils]: 21: Hoare triple {881#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {881#false} is VALID [2020-07-10 15:27:48,168 INFO L280 TraceCheckUtils]: 22: Hoare triple {881#false} ~cond := #in~cond; {881#false} is VALID [2020-07-10 15:27:48,168 INFO L280 TraceCheckUtils]: 23: Hoare triple {881#false} assume 0 == ~cond; {881#false} is VALID [2020-07-10 15:27:48,168 INFO L280 TraceCheckUtils]: 24: Hoare triple {881#false} assume !false; {881#false} is VALID [2020-07-10 15:27:48,169 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-10 15:27:48,169 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404757107] [2020-07-10 15:27:48,169 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764797869] [2020-07-10 15:27:48,169 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 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-10 15:27:48,188 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:27:48,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:27:48,189 INFO L264 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-10 15:27:48,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:48,205 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:48,310 INFO L263 TraceCheckUtils]: 0: Hoare triple {880#true} call ULTIMATE.init(); {880#true} is VALID [2020-07-10 15:27:48,310 INFO L280 TraceCheckUtils]: 1: Hoare triple {880#true} assume true; {880#true} is VALID [2020-07-10 15:27:48,310 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {880#true} {880#true} #37#return; {880#true} is VALID [2020-07-10 15:27:48,311 INFO L263 TraceCheckUtils]: 3: Hoare triple {880#true} call #t~ret1 := main(); {880#true} is VALID [2020-07-10 15:27:48,311 INFO L280 TraceCheckUtils]: 4: Hoare triple {880#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {903#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:48,312 INFO L280 TraceCheckUtils]: 5: Hoare triple {903#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {903#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:48,313 INFO L280 TraceCheckUtils]: 6: Hoare triple {903#(<= main_~i~0 1)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {903#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:48,314 INFO L280 TraceCheckUtils]: 7: Hoare triple {903#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {913#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:48,314 INFO L280 TraceCheckUtils]: 8: Hoare triple {913#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {913#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:48,315 INFO L280 TraceCheckUtils]: 9: Hoare triple {913#(<= main_~i~0 2)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {913#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:48,316 INFO L280 TraceCheckUtils]: 10: Hoare triple {913#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {884#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:48,317 INFO L280 TraceCheckUtils]: 11: Hoare triple {884#(<= main_~i~0 3)} assume !!(~i~0 <= 8); {884#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:48,317 INFO L280 TraceCheckUtils]: 12: Hoare triple {884#(<= main_~i~0 3)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {884#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:48,318 INFO L280 TraceCheckUtils]: 13: Hoare triple {884#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {885#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:48,319 INFO L280 TraceCheckUtils]: 14: Hoare triple {885#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {885#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:48,319 INFO L280 TraceCheckUtils]: 15: Hoare triple {885#(<= main_~i~0 4)} assume !(~i~0 < 4); {885#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:48,320 INFO L280 TraceCheckUtils]: 16: Hoare triple {885#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {886#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:48,321 INFO L280 TraceCheckUtils]: 17: Hoare triple {886#(<= main_~i~0 5)} assume !!(~i~0 <= 8); {886#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:48,322 INFO L280 TraceCheckUtils]: 18: Hoare triple {886#(<= main_~i~0 5)} assume !(~i~0 < 4); {886#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:48,323 INFO L280 TraceCheckUtils]: 19: Hoare triple {886#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {887#(<= main_~i~0 6)} is VALID [2020-07-10 15:27:48,324 INFO L280 TraceCheckUtils]: 20: Hoare triple {887#(<= main_~i~0 6)} assume !(~i~0 <= 8); {881#false} is VALID [2020-07-10 15:27:48,324 INFO L263 TraceCheckUtils]: 21: Hoare triple {881#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {881#false} is VALID [2020-07-10 15:27:48,324 INFO L280 TraceCheckUtils]: 22: Hoare triple {881#false} ~cond := #in~cond; {881#false} is VALID [2020-07-10 15:27:48,324 INFO L280 TraceCheckUtils]: 23: Hoare triple {881#false} assume 0 == ~cond; {881#false} is VALID [2020-07-10 15:27:48,325 INFO L280 TraceCheckUtils]: 24: Hoare triple {881#false} assume !false; {881#false} is VALID [2020-07-10 15:27:48,326 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:48,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:27:48,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 8 [2020-07-10 15:27:48,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988389107] [2020-07-10 15:27:48,327 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2020-07-10 15:27:48,328 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:48,328 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 15:27:48,368 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:48,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 15:27:48,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:48,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 15:27:48,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:27:48,370 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 8 states. [2020-07-10 15:27:48,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:48,484 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2020-07-10 15:27:48,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 15:27:48,485 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2020-07-10 15:27:48,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:48,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:27:48,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2020-07-10 15:27:48,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:27:48,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2020-07-10 15:27:48,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 40 transitions. [2020-07-10 15:27:48,548 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:48,549 INFO L225 Difference]: With dead ends: 36 [2020-07-10 15:27:48,549 INFO L226 Difference]: Without dead ends: 31 [2020-07-10 15:27:48,550 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:27:48,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-10 15:27:48,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2020-07-10 15:27:48,562 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:48,562 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 29 states. [2020-07-10 15:27:48,563 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 29 states. [2020-07-10 15:27:48,563 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 29 states. [2020-07-10 15:27:48,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:48,565 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2020-07-10 15:27:48,565 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-10 15:27:48,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:48,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:48,566 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 31 states. [2020-07-10 15:27:48,566 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 31 states. [2020-07-10 15:27:48,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:48,568 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2020-07-10 15:27:48,568 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-10 15:27:48,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:48,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:48,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:48,569 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:48,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-10 15:27:48,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2020-07-10 15:27:48,571 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 25 [2020-07-10 15:27:48,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:48,572 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2020-07-10 15:27:48,572 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 15:27:48,572 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2020-07-10 15:27:48,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-10 15:27:48,573 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:48,573 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:48,773 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:48,774 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:48,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:48,775 INFO L82 PathProgramCache]: Analyzing trace with hash 115125753, now seen corresponding path program 3 times [2020-07-10 15:27:48,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:48,776 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280722063] [2020-07-10 15:27:48,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:48,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:48,882 INFO L280 TraceCheckUtils]: 0: Hoare triple {1119#true} assume true; {1119#true} is VALID [2020-07-10 15:27:48,882 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1119#true} {1119#true} #37#return; {1119#true} is VALID [2020-07-10 15:27:48,882 INFO L263 TraceCheckUtils]: 0: Hoare triple {1119#true} call ULTIMATE.init(); {1119#true} is VALID [2020-07-10 15:27:48,883 INFO L280 TraceCheckUtils]: 1: Hoare triple {1119#true} assume true; {1119#true} is VALID [2020-07-10 15:27:48,883 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1119#true} {1119#true} #37#return; {1119#true} is VALID [2020-07-10 15:27:48,883 INFO L263 TraceCheckUtils]: 3: Hoare triple {1119#true} call #t~ret1 := main(); {1119#true} is VALID [2020-07-10 15:27:48,883 INFO L280 TraceCheckUtils]: 4: Hoare triple {1119#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1119#true} is VALID [2020-07-10 15:27:48,883 INFO L280 TraceCheckUtils]: 5: Hoare triple {1119#true} assume !!(~i~0 <= 8); {1119#true} is VALID [2020-07-10 15:27:48,883 INFO L280 TraceCheckUtils]: 6: Hoare triple {1119#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1119#true} is VALID [2020-07-10 15:27:48,884 INFO L280 TraceCheckUtils]: 7: Hoare triple {1119#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1119#true} is VALID [2020-07-10 15:27:48,884 INFO L280 TraceCheckUtils]: 8: Hoare triple {1119#true} assume !!(~i~0 <= 8); {1119#true} is VALID [2020-07-10 15:27:48,884 INFO L280 TraceCheckUtils]: 9: Hoare triple {1119#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1119#true} is VALID [2020-07-10 15:27:48,884 INFO L280 TraceCheckUtils]: 10: Hoare triple {1119#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1119#true} is VALID [2020-07-10 15:27:48,884 INFO L280 TraceCheckUtils]: 11: Hoare triple {1119#true} assume !!(~i~0 <= 8); {1119#true} is VALID [2020-07-10 15:27:48,885 INFO L280 TraceCheckUtils]: 12: Hoare triple {1119#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1123#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:48,886 INFO L280 TraceCheckUtils]: 13: Hoare triple {1123#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1124#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:48,886 INFO L280 TraceCheckUtils]: 14: Hoare triple {1124#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {1124#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:48,887 INFO L280 TraceCheckUtils]: 15: Hoare triple {1124#(<= main_~i~0 4)} assume !(~i~0 < 4); {1124#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:48,887 INFO L280 TraceCheckUtils]: 16: Hoare triple {1124#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1125#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:48,888 INFO L280 TraceCheckUtils]: 17: Hoare triple {1125#(<= main_~i~0 5)} assume !!(~i~0 <= 8); {1125#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:48,888 INFO L280 TraceCheckUtils]: 18: Hoare triple {1125#(<= main_~i~0 5)} assume !(~i~0 < 4); {1125#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:48,889 INFO L280 TraceCheckUtils]: 19: Hoare triple {1125#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1126#(<= main_~i~0 6)} is VALID [2020-07-10 15:27:48,890 INFO L280 TraceCheckUtils]: 20: Hoare triple {1126#(<= main_~i~0 6)} assume !!(~i~0 <= 8); {1126#(<= main_~i~0 6)} is VALID [2020-07-10 15:27:48,891 INFO L280 TraceCheckUtils]: 21: Hoare triple {1126#(<= main_~i~0 6)} assume !(~i~0 < 4); {1126#(<= main_~i~0 6)} is VALID [2020-07-10 15:27:48,891 INFO L280 TraceCheckUtils]: 22: Hoare triple {1126#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1127#(<= main_~i~0 7)} is VALID [2020-07-10 15:27:48,892 INFO L280 TraceCheckUtils]: 23: Hoare triple {1127#(<= main_~i~0 7)} assume !(~i~0 <= 8); {1120#false} is VALID [2020-07-10 15:27:48,892 INFO L263 TraceCheckUtils]: 24: Hoare triple {1120#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1120#false} is VALID [2020-07-10 15:27:48,892 INFO L280 TraceCheckUtils]: 25: Hoare triple {1120#false} ~cond := #in~cond; {1120#false} is VALID [2020-07-10 15:27:48,892 INFO L280 TraceCheckUtils]: 26: Hoare triple {1120#false} assume 0 == ~cond; {1120#false} is VALID [2020-07-10 15:27:48,892 INFO L280 TraceCheckUtils]: 27: Hoare triple {1120#false} assume !false; {1120#false} is VALID [2020-07-10 15:27:48,893 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 29 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-10 15:27:48,894 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280722063] [2020-07-10 15:27:48,894 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182071167] [2020-07-10 15:27:48,894 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 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-10 15:27:48,927 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2020-07-10 15:27:48,927 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:27:48,928 INFO L264 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-10 15:27:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:48,937 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:49,015 INFO L263 TraceCheckUtils]: 0: Hoare triple {1119#true} call ULTIMATE.init(); {1119#true} is VALID [2020-07-10 15:27:49,015 INFO L280 TraceCheckUtils]: 1: Hoare triple {1119#true} assume true; {1119#true} is VALID [2020-07-10 15:27:49,016 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1119#true} {1119#true} #37#return; {1119#true} is VALID [2020-07-10 15:27:49,016 INFO L263 TraceCheckUtils]: 3: Hoare triple {1119#true} call #t~ret1 := main(); {1119#true} is VALID [2020-07-10 15:27:49,016 INFO L280 TraceCheckUtils]: 4: Hoare triple {1119#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1119#true} is VALID [2020-07-10 15:27:49,016 INFO L280 TraceCheckUtils]: 5: Hoare triple {1119#true} assume !!(~i~0 <= 8); {1119#true} is VALID [2020-07-10 15:27:49,017 INFO L280 TraceCheckUtils]: 6: Hoare triple {1119#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1119#true} is VALID [2020-07-10 15:27:49,017 INFO L280 TraceCheckUtils]: 7: Hoare triple {1119#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1119#true} is VALID [2020-07-10 15:27:49,017 INFO L280 TraceCheckUtils]: 8: Hoare triple {1119#true} assume !!(~i~0 <= 8); {1119#true} is VALID [2020-07-10 15:27:49,017 INFO L280 TraceCheckUtils]: 9: Hoare triple {1119#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1119#true} is VALID [2020-07-10 15:27:49,018 INFO L280 TraceCheckUtils]: 10: Hoare triple {1119#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1119#true} is VALID [2020-07-10 15:27:49,018 INFO L280 TraceCheckUtils]: 11: Hoare triple {1119#true} assume !!(~i~0 <= 8); {1119#true} is VALID [2020-07-10 15:27:49,019 INFO L280 TraceCheckUtils]: 12: Hoare triple {1119#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1123#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:49,019 INFO L280 TraceCheckUtils]: 13: Hoare triple {1123#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1124#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:49,020 INFO L280 TraceCheckUtils]: 14: Hoare triple {1124#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {1124#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:49,020 INFO L280 TraceCheckUtils]: 15: Hoare triple {1124#(<= main_~i~0 4)} assume !(~i~0 < 4); {1124#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:49,023 INFO L280 TraceCheckUtils]: 16: Hoare triple {1124#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1125#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:49,023 INFO L280 TraceCheckUtils]: 17: Hoare triple {1125#(<= main_~i~0 5)} assume !!(~i~0 <= 8); {1125#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:49,025 INFO L280 TraceCheckUtils]: 18: Hoare triple {1125#(<= main_~i~0 5)} assume !(~i~0 < 4); {1125#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:49,027 INFO L280 TraceCheckUtils]: 19: Hoare triple {1125#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1126#(<= main_~i~0 6)} is VALID [2020-07-10 15:27:49,028 INFO L280 TraceCheckUtils]: 20: Hoare triple {1126#(<= main_~i~0 6)} assume !!(~i~0 <= 8); {1126#(<= main_~i~0 6)} is VALID [2020-07-10 15:27:49,034 INFO L280 TraceCheckUtils]: 21: Hoare triple {1126#(<= main_~i~0 6)} assume !(~i~0 < 4); {1126#(<= main_~i~0 6)} is VALID [2020-07-10 15:27:49,035 INFO L280 TraceCheckUtils]: 22: Hoare triple {1126#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1127#(<= main_~i~0 7)} is VALID [2020-07-10 15:27:49,036 INFO L280 TraceCheckUtils]: 23: Hoare triple {1127#(<= main_~i~0 7)} assume !(~i~0 <= 8); {1120#false} is VALID [2020-07-10 15:27:49,037 INFO L263 TraceCheckUtils]: 24: Hoare triple {1120#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1120#false} is VALID [2020-07-10 15:27:49,037 INFO L280 TraceCheckUtils]: 25: Hoare triple {1120#false} ~cond := #in~cond; {1120#false} is VALID [2020-07-10 15:27:49,037 INFO L280 TraceCheckUtils]: 26: Hoare triple {1120#false} assume 0 == ~cond; {1120#false} is VALID [2020-07-10 15:27:49,037 INFO L280 TraceCheckUtils]: 27: Hoare triple {1120#false} assume !false; {1120#false} is VALID [2020-07-10 15:27:49,038 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 29 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-10 15:27:49,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:27:49,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2020-07-10 15:27:49,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717991754] [2020-07-10 15:27:49,039 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2020-07-10 15:27:49,040 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:49,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:27:49,062 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-10 15:27:49,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:27:49,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:49,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:27:49,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:27:49,063 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 7 states. [2020-07-10 15:27:49,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:49,173 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2020-07-10 15:27:49,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:27:49,173 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2020-07-10 15:27:49,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:49,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:27:49,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2020-07-10 15:27:49,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:27:49,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2020-07-10 15:27:49,177 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 38 transitions. [2020-07-10 15:27:49,224 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:49,226 INFO L225 Difference]: With dead ends: 39 [2020-07-10 15:27:49,226 INFO L226 Difference]: Without dead ends: 34 [2020-07-10 15:27:49,226 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:27:49,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-10 15:27:49,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2020-07-10 15:27:49,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:49,243 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 32 states. [2020-07-10 15:27:49,244 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 32 states. [2020-07-10 15:27:49,244 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 32 states. [2020-07-10 15:27:49,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:49,246 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2020-07-10 15:27:49,246 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2020-07-10 15:27:49,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:49,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:49,247 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states. [2020-07-10 15:27:49,247 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states. [2020-07-10 15:27:49,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:49,249 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2020-07-10 15:27:49,249 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2020-07-10 15:27:49,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:49,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:49,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:49,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:49,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-10 15:27:49,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2020-07-10 15:27:49,252 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 28 [2020-07-10 15:27:49,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:49,252 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2020-07-10 15:27:49,252 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:27:49,252 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-10 15:27:49,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-10 15:27:49,253 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:49,253 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:49,466 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:49,467 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:49,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:49,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1902732141, now seen corresponding path program 4 times [2020-07-10 15:27:49,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:49,469 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526257931] [2020-07-10 15:27:49,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:49,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:49,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:49,551 INFO L280 TraceCheckUtils]: 0: Hoare triple {1380#true} assume true; {1380#true} is VALID [2020-07-10 15:27:49,551 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1380#true} {1380#true} #37#return; {1380#true} is VALID [2020-07-10 15:27:49,551 INFO L263 TraceCheckUtils]: 0: Hoare triple {1380#true} call ULTIMATE.init(); {1380#true} is VALID [2020-07-10 15:27:49,552 INFO L280 TraceCheckUtils]: 1: Hoare triple {1380#true} assume true; {1380#true} is VALID [2020-07-10 15:27:49,552 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1380#true} {1380#true} #37#return; {1380#true} is VALID [2020-07-10 15:27:49,552 INFO L263 TraceCheckUtils]: 3: Hoare triple {1380#true} call #t~ret1 := main(); {1380#true} is VALID [2020-07-10 15:27:49,552 INFO L280 TraceCheckUtils]: 4: Hoare triple {1380#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1380#true} is VALID [2020-07-10 15:27:49,552 INFO L280 TraceCheckUtils]: 5: Hoare triple {1380#true} assume !!(~i~0 <= 8); {1380#true} is VALID [2020-07-10 15:27:49,553 INFO L280 TraceCheckUtils]: 6: Hoare triple {1380#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1380#true} is VALID [2020-07-10 15:27:49,553 INFO L280 TraceCheckUtils]: 7: Hoare triple {1380#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1380#true} is VALID [2020-07-10 15:27:49,553 INFO L280 TraceCheckUtils]: 8: Hoare triple {1380#true} assume !!(~i~0 <= 8); {1380#true} is VALID [2020-07-10 15:27:49,553 INFO L280 TraceCheckUtils]: 9: Hoare triple {1380#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1380#true} is VALID [2020-07-10 15:27:49,553 INFO L280 TraceCheckUtils]: 10: Hoare triple {1380#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1380#true} is VALID [2020-07-10 15:27:49,554 INFO L280 TraceCheckUtils]: 11: Hoare triple {1380#true} assume !!(~i~0 <= 8); {1380#true} is VALID [2020-07-10 15:27:49,554 INFO L280 TraceCheckUtils]: 12: Hoare triple {1380#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1384#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:49,555 INFO L280 TraceCheckUtils]: 13: Hoare triple {1384#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1385#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:49,555 INFO L280 TraceCheckUtils]: 14: Hoare triple {1385#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {1385#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:49,556 INFO L280 TraceCheckUtils]: 15: Hoare triple {1385#(<= main_~i~0 4)} assume !(~i~0 < 4); {1385#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:49,556 INFO L280 TraceCheckUtils]: 16: Hoare triple {1385#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1386#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:49,557 INFO L280 TraceCheckUtils]: 17: Hoare triple {1386#(<= main_~i~0 5)} assume !!(~i~0 <= 8); {1386#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:49,557 INFO L280 TraceCheckUtils]: 18: Hoare triple {1386#(<= main_~i~0 5)} assume !(~i~0 < 4); {1386#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:49,558 INFO L280 TraceCheckUtils]: 19: Hoare triple {1386#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1387#(<= main_~i~0 6)} is VALID [2020-07-10 15:27:49,558 INFO L280 TraceCheckUtils]: 20: Hoare triple {1387#(<= main_~i~0 6)} assume !!(~i~0 <= 8); {1387#(<= main_~i~0 6)} is VALID [2020-07-10 15:27:49,559 INFO L280 TraceCheckUtils]: 21: Hoare triple {1387#(<= main_~i~0 6)} assume !(~i~0 < 4); {1387#(<= main_~i~0 6)} is VALID [2020-07-10 15:27:49,559 INFO L280 TraceCheckUtils]: 22: Hoare triple {1387#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1388#(<= main_~i~0 7)} is VALID [2020-07-10 15:27:49,559 INFO L280 TraceCheckUtils]: 23: Hoare triple {1388#(<= main_~i~0 7)} assume !!(~i~0 <= 8); {1388#(<= main_~i~0 7)} is VALID [2020-07-10 15:27:49,560 INFO L280 TraceCheckUtils]: 24: Hoare triple {1388#(<= main_~i~0 7)} assume !(~i~0 < 4); {1388#(<= main_~i~0 7)} is VALID [2020-07-10 15:27:49,560 INFO L280 TraceCheckUtils]: 25: Hoare triple {1388#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1389#(<= main_~i~0 8)} is VALID [2020-07-10 15:27:49,561 INFO L280 TraceCheckUtils]: 26: Hoare triple {1389#(<= main_~i~0 8)} assume !(~i~0 <= 8); {1381#false} is VALID [2020-07-10 15:27:49,561 INFO L263 TraceCheckUtils]: 27: Hoare triple {1381#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1381#false} is VALID [2020-07-10 15:27:49,561 INFO L280 TraceCheckUtils]: 28: Hoare triple {1381#false} ~cond := #in~cond; {1381#false} is VALID [2020-07-10 15:27:49,561 INFO L280 TraceCheckUtils]: 29: Hoare triple {1381#false} assume 0 == ~cond; {1381#false} is VALID [2020-07-10 15:27:49,562 INFO L280 TraceCheckUtils]: 30: Hoare triple {1381#false} assume !false; {1381#false} is VALID [2020-07-10 15:27:49,563 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 37 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-10 15:27:49,563 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526257931] [2020-07-10 15:27:49,563 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574085329] [2020-07-10 15:27:49,563 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-10 15:27:49,593 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-10 15:27:49,593 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:27:49,594 INFO L264 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 9 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:49,603 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:49,727 INFO L263 TraceCheckUtils]: 0: Hoare triple {1380#true} call ULTIMATE.init(); {1380#true} is VALID [2020-07-10 15:27:49,727 INFO L280 TraceCheckUtils]: 1: Hoare triple {1380#true} assume true; {1380#true} is VALID [2020-07-10 15:27:49,727 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1380#true} {1380#true} #37#return; {1380#true} is VALID [2020-07-10 15:27:49,728 INFO L263 TraceCheckUtils]: 3: Hoare triple {1380#true} call #t~ret1 := main(); {1380#true} is VALID [2020-07-10 15:27:49,728 INFO L280 TraceCheckUtils]: 4: Hoare triple {1380#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1405#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:49,729 INFO L280 TraceCheckUtils]: 5: Hoare triple {1405#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {1405#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:49,729 INFO L280 TraceCheckUtils]: 6: Hoare triple {1405#(<= main_~i~0 1)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1405#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:49,730 INFO L280 TraceCheckUtils]: 7: Hoare triple {1405#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1415#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:49,731 INFO L280 TraceCheckUtils]: 8: Hoare triple {1415#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {1415#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:49,731 INFO L280 TraceCheckUtils]: 9: Hoare triple {1415#(<= main_~i~0 2)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1415#(<= main_~i~0 2)} is VALID [2020-07-10 15:27:49,732 INFO L280 TraceCheckUtils]: 10: Hoare triple {1415#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1384#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:49,733 INFO L280 TraceCheckUtils]: 11: Hoare triple {1384#(<= main_~i~0 3)} assume !!(~i~0 <= 8); {1384#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:49,734 INFO L280 TraceCheckUtils]: 12: Hoare triple {1384#(<= main_~i~0 3)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {1384#(<= main_~i~0 3)} is VALID [2020-07-10 15:27:49,735 INFO L280 TraceCheckUtils]: 13: Hoare triple {1384#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1385#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:49,736 INFO L280 TraceCheckUtils]: 14: Hoare triple {1385#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {1385#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:49,737 INFO L280 TraceCheckUtils]: 15: Hoare triple {1385#(<= main_~i~0 4)} assume !(~i~0 < 4); {1385#(<= main_~i~0 4)} is VALID [2020-07-10 15:27:49,737 INFO L280 TraceCheckUtils]: 16: Hoare triple {1385#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1386#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:49,738 INFO L280 TraceCheckUtils]: 17: Hoare triple {1386#(<= main_~i~0 5)} assume !!(~i~0 <= 8); {1386#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:49,738 INFO L280 TraceCheckUtils]: 18: Hoare triple {1386#(<= main_~i~0 5)} assume !(~i~0 < 4); {1386#(<= main_~i~0 5)} is VALID [2020-07-10 15:27:49,739 INFO L280 TraceCheckUtils]: 19: Hoare triple {1386#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1387#(<= main_~i~0 6)} is VALID [2020-07-10 15:27:49,740 INFO L280 TraceCheckUtils]: 20: Hoare triple {1387#(<= main_~i~0 6)} assume !!(~i~0 <= 8); {1387#(<= main_~i~0 6)} is VALID [2020-07-10 15:27:49,740 INFO L280 TraceCheckUtils]: 21: Hoare triple {1387#(<= main_~i~0 6)} assume !(~i~0 < 4); {1387#(<= main_~i~0 6)} is VALID [2020-07-10 15:27:49,741 INFO L280 TraceCheckUtils]: 22: Hoare triple {1387#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1388#(<= main_~i~0 7)} is VALID [2020-07-10 15:27:49,741 INFO L280 TraceCheckUtils]: 23: Hoare triple {1388#(<= main_~i~0 7)} assume !!(~i~0 <= 8); {1388#(<= main_~i~0 7)} is VALID [2020-07-10 15:27:49,742 INFO L280 TraceCheckUtils]: 24: Hoare triple {1388#(<= main_~i~0 7)} assume !(~i~0 < 4); {1388#(<= main_~i~0 7)} is VALID [2020-07-10 15:27:49,743 INFO L280 TraceCheckUtils]: 25: Hoare triple {1388#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1389#(<= main_~i~0 8)} is VALID [2020-07-10 15:27:49,743 INFO L280 TraceCheckUtils]: 26: Hoare triple {1389#(<= main_~i~0 8)} assume !(~i~0 <= 8); {1381#false} is VALID [2020-07-10 15:27:49,744 INFO L263 TraceCheckUtils]: 27: Hoare triple {1381#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1381#false} is VALID [2020-07-10 15:27:49,744 INFO L280 TraceCheckUtils]: 28: Hoare triple {1381#false} ~cond := #in~cond; {1381#false} is VALID [2020-07-10 15:27:49,744 INFO L280 TraceCheckUtils]: 29: Hoare triple {1381#false} assume 0 == ~cond; {1381#false} is VALID [2020-07-10 15:27:49,744 INFO L280 TraceCheckUtils]: 30: Hoare triple {1381#false} assume !false; {1381#false} is VALID [2020-07-10 15:27:49,747 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:49,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:27:49,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 10 [2020-07-10 15:27:49,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212493305] [2020-07-10 15:27:49,749 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2020-07-10 15:27:49,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:49,749 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 15:27:49,794 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:49,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 15:27:49,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:49,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 15:27:49,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:27:49,796 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 10 states. [2020-07-10 15:27:49,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:49,954 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2020-07-10 15:27:49,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 15:27:49,954 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2020-07-10 15:27:49,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:49,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:27:49,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 45 transitions. [2020-07-10 15:27:49,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:27:49,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 45 transitions. [2020-07-10 15:27:49,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 45 transitions. [2020-07-10 15:27:50,011 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:50,012 INFO L225 Difference]: With dead ends: 40 [2020-07-10 15:27:50,012 INFO L226 Difference]: Without dead ends: 35 [2020-07-10 15:27:50,012 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:27:50,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-10 15:27:50,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-10 15:27:50,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:50,032 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2020-07-10 15:27:50,032 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-10 15:27:50,032 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-10 15:27:50,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:50,038 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2020-07-10 15:27:50,038 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2020-07-10 15:27:50,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:50,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:50,039 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-10 15:27:50,039 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-10 15:27:50,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:50,044 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2020-07-10 15:27:50,044 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2020-07-10 15:27:50,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:50,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:50,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:50,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:50,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-10 15:27:50,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2020-07-10 15:27:50,047 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 31 [2020-07-10 15:27:50,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:50,047 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2020-07-10 15:27:50,047 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 15:27:50,047 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2020-07-10 15:27:50,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-10 15:27:50,048 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:50,051 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:50,264 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:50,265 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:50,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:50,266 INFO L82 PathProgramCache]: Analyzing trace with hash 749989817, now seen corresponding path program 5 times [2020-07-10 15:27:50,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:50,267 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264580718] [2020-07-10 15:27:50,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:50,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:27:50,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:27:50,306 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:27:50,307 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:27:50,307 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-10 15:27:50,331 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:27:50,331 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:27:50,331 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:27:50,331 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:27:50,331 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-10 15:27:50,332 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:27:50,332 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:27:50,332 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:27:50,332 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-10 15:27:50,332 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-10 15:27:50,332 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-10 15:27:50,332 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:27:50,332 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:27:50,332 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:27:50,332 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2020-07-10 15:27:50,332 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2020-07-10 15:27:50,332 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-10 15:27:50,332 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-10 15:27:50,332 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 15:27:50,332 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 15:27:50,333 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-10 15:27:50,333 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:27:50,333 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2020-07-10 15:27:50,333 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:27:50,333 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:27:50,333 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:27:50,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:27:50 BoogieIcfgContainer [2020-07-10 15:27:50,335 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:27:50,337 INFO L168 Benchmark]: Toolchain (without parser) took 5907.89 ms. Allocated memory was 145.8 MB in the beginning and 270.5 MB in the end (delta: 124.8 MB). Free memory was 103.7 MB in the beginning and 201.5 MB in the end (delta: -97.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:50,338 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 145.8 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 15:27:50,339 INFO L168 Benchmark]: CACSL2BoogieTranslator took 294.67 ms. Allocated memory is still 145.8 MB. Free memory was 103.4 MB in the beginning and 93.9 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:50,339 INFO L168 Benchmark]: Boogie Preprocessor took 117.71 ms. Allocated memory was 145.8 MB in the beginning and 205.0 MB in the end (delta: 59.2 MB). Free memory was 93.9 MB in the beginning and 184.2 MB in the end (delta: -90.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:50,340 INFO L168 Benchmark]: RCFGBuilder took 304.31 ms. Allocated memory is still 205.0 MB. Free memory was 184.2 MB in the beginning and 169.3 MB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:50,341 INFO L168 Benchmark]: TraceAbstraction took 5183.58 ms. Allocated memory was 205.0 MB in the beginning and 270.5 MB in the end (delta: 65.5 MB). Free memory was 168.6 MB in the beginning and 201.5 MB in the end (delta: -32.9 MB). Peak memory consumption was 32.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:50,344 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.23 ms. Allocated memory is still 145.8 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 294.67 ms. Allocated memory is still 145.8 MB. Free memory was 103.4 MB in the beginning and 93.9 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 117.71 ms. Allocated memory was 145.8 MB in the beginning and 205.0 MB in the end (delta: 59.2 MB). Free memory was 93.9 MB in the beginning and 184.2 MB in the end (delta: -90.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 304.31 ms. Allocated memory is still 205.0 MB. Free memory was 184.2 MB in the beginning and 169.3 MB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5183.58 ms. Allocated memory was 205.0 MB in the beginning and 270.5 MB in the end (delta: 65.5 MB). Free memory was 168.6 MB in the beginning and 201.5 MB in the end (delta: -32.9 MB). Peak memory consumption was 32.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int i, sn=0; [L13] i=1 VAL [i=1, sn=0] [L13] COND TRUE i<=8 VAL [i=1, sn=0] [L14] COND TRUE i<4 [L15] sn = sn + (2) VAL [i=1, sn=2] [L13] i++ VAL [i=2, sn=2] [L13] COND TRUE i<=8 VAL [i=2, sn=2] [L14] COND TRUE i<4 [L15] sn = sn + (2) VAL [i=2, sn=4] [L13] i++ VAL [i=3, sn=4] [L13] COND TRUE i<=8 VAL [i=3, sn=4] [L14] COND TRUE i<4 [L15] sn = sn + (2) VAL [i=3, sn=6] [L13] i++ VAL [i=4, sn=6] [L13] COND TRUE i<=8 VAL [i=4, sn=6] [L14] COND FALSE !(i<4) VAL [i=4, sn=6] [L13] i++ VAL [i=5, sn=6] [L13] COND TRUE i<=8 VAL [i=5, sn=6] [L14] COND FALSE !(i<4) VAL [i=5, sn=6] [L13] i++ VAL [i=6, sn=6] [L13] COND TRUE i<=8 VAL [i=6, sn=6] [L14] COND FALSE !(i<4) VAL [i=6, sn=6] [L13] i++ VAL [i=7, sn=6] [L13] COND TRUE i<=8 VAL [i=7, sn=6] [L14] COND FALSE !(i<4) VAL [i=7, sn=6] [L13] i++ VAL [i=8, sn=6] [L13] COND TRUE i<=8 VAL [i=8, sn=6] [L14] COND FALSE !(i<4) VAL [i=8, sn=6] [L13] i++ VAL [i=9, sn=6] [L13] COND FALSE !(i<=8) VAL [i=9, sn=6] [L17] CALL __VERIFIER_assert(sn==8*(2) || sn == 0) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5.0s, OverallIterations: 10, TraceHistogramMax: 8, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 103 SDtfs, 69 SDslu, 232 SDs, 0 SdLazy, 160 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 191 GetRequests, 158 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 11 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 343 NumberOfCodeBlocks, 342 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 294 ConstructedInterpolants, 0 QuantifiedInterpolants, 12474 SizeOfPredicates, 5 NumberOfNonLiveVariables, 270 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 176/380 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...