java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-new/gauss_sum_true-unreach-call.i.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:35:49,400 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:35:49,402 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:35:49,418 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:35:49,419 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:35:49,420 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:35:49,421 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:35:49,424 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:35:49,426 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:35:49,428 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:35:49,429 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:35:49,429 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:35:49,430 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:35:49,431 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:35:49,434 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:35:49,435 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:35:49,436 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:35:49,441 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:35:49,446 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:35:49,451 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:35:49,452 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:35:49,453 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:35:49,459 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:35:49,459 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:35:49,459 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:35:49,460 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:35:49,463 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:35:49,464 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:35:49,464 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:35:49,465 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:35:49,465 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:35:49,468 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:35:49,468 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:35:49,468 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:35:49,470 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:35:49,471 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:35:49,471 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-14 17:35:49,489 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:35:49,490 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:35:49,490 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:35:49,491 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:35:49,491 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:35:49,491 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:35:49,492 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:35:49,492 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:35:49,492 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:35:49,492 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:35:49,492 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:35:49,493 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:35:49,493 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:35:49,493 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:35:49,493 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:35:49,493 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:35:49,494 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:35:49,494 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:35:49,494 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:35:49,494 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:35:49,494 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:35:49,495 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:35:49,495 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:35:49,495 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:35:49,495 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:35:49,496 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:35:49,496 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:35:49,496 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:35:49,496 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:35:49,496 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:35:49,541 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:35:49,554 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:35:49,558 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:35:49,559 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:35:49,560 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:35:49,561 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/gauss_sum_true-unreach-call.i.p+lhb-reducer.c [2018-11-14 17:35:49,619 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47a1f52a4/ef8e6c62d82145c9b21ba7f55431a126/FLAG64bafaccf [2018-11-14 17:35:50,125 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:35:50,126 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/gauss_sum_true-unreach-call.i.p+lhb-reducer.c [2018-11-14 17:35:50,133 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47a1f52a4/ef8e6c62d82145c9b21ba7f55431a126/FLAG64bafaccf [2018-11-14 17:35:50,149 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47a1f52a4/ef8e6c62d82145c9b21ba7f55431a126 [2018-11-14 17:35:50,159 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:35:50,162 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:35:50,163 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:35:50,163 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:35:50,167 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:35:50,169 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:35:50" (1/1) ... [2018-11-14 17:35:50,172 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53aa012c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:50, skipping insertion in model container [2018-11-14 17:35:50,172 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:35:50" (1/1) ... [2018-11-14 17:35:50,183 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:35:50,218 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:35:50,468 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:35:50,475 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:35:50,511 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:35:50,530 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:35:50,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:50 WrapperNode [2018-11-14 17:35:50,531 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:35:50,532 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:35:50,532 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:35:50,532 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:35:50,548 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:50" (1/1) ... [2018-11-14 17:35:50,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:50" (1/1) ... [2018-11-14 17:35:50,555 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:50" (1/1) ... [2018-11-14 17:35:50,556 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:50" (1/1) ... [2018-11-14 17:35:50,567 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:50" (1/1) ... [2018-11-14 17:35:50,572 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:50" (1/1) ... [2018-11-14 17:35:50,574 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:50" (1/1) ... [2018-11-14 17:35:50,580 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:35:50,582 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:35:50,583 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:35:50,583 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:35:50,584 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:50" (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 [2018-11-14 17:35:50,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:35:50,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:35:50,726 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:35:50,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:35:50,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 17:35:50,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:35:50,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:35:50,726 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:35:50,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:35:50,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:35:51,231 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:35:51,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:35:51 BoogieIcfgContainer [2018-11-14 17:35:51,232 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:35:51,233 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:35:51,233 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:35:51,237 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:35:51,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:35:50" (1/3) ... [2018-11-14 17:35:51,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3499d72c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:35:51, skipping insertion in model container [2018-11-14 17:35:51,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:50" (2/3) ... [2018-11-14 17:35:51,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3499d72c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:35:51, skipping insertion in model container [2018-11-14 17:35:51,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:35:51" (3/3) ... [2018-11-14 17:35:51,240 INFO L112 eAbstractionObserver]: Analyzing ICFG gauss_sum_true-unreach-call.i.p+lhb-reducer.c [2018-11-14 17:35:51,251 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:35:51,261 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:35:51,278 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:35:51,313 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:35:51,314 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:35:51,314 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:35:51,315 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:35:51,315 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:35:51,315 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:35:51,315 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:35:51,315 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:35:51,315 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:35:51,341 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-11-14 17:35:51,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 17:35:51,351 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:35:51,352 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:35:51,359 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:35:51,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:35:51,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1720236422, now seen corresponding path program 1 times [2018-11-14 17:35:51,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:35:51,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:35:51,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:51,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:35:51,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:51,500 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:35:51,500 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:35:51,501 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2018-11-14 17:35:51,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:35:51,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:51,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:51,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:35:52,394 INFO L256 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2018-11-14 17:35:52,398 INFO L273 TraceCheckUtils]: 1: Hoare triple {24#true} ~__return_main~0 := 0;~__return_96~0 := 0; {24#true} is VALID [2018-11-14 17:35:52,399 INFO L273 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2018-11-14 17:35:52,399 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #48#return; {24#true} is VALID [2018-11-14 17:35:52,399 INFO L256 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret2 := main(); {24#true} is VALID [2018-11-14 17:35:52,400 INFO L273 TraceCheckUtils]: 5: Hoare triple {24#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {24#true} is VALID [2018-11-14 17:35:52,400 INFO L273 TraceCheckUtils]: 6: Hoare triple {24#true} assume !!(1 <= ~main__n~0); {24#true} is VALID [2018-11-14 17:35:52,402 INFO L273 TraceCheckUtils]: 7: Hoare triple {24#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {50#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:35:52,406 INFO L273 TraceCheckUtils]: 8: Hoare triple {50#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {54#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 17:35:52,409 INFO L273 TraceCheckUtils]: 9: Hoare triple {54#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {58#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:35:52,426 INFO L273 TraceCheckUtils]: 10: Hoare triple {58#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {62#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:35:52,434 INFO L273 TraceCheckUtils]: 11: Hoare triple {62#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {66#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:35:52,435 INFO L273 TraceCheckUtils]: 12: Hoare triple {66#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {70#(and (<= main_~main__i~0 6) (= main_~main__sum~0 15) (<= 5 main_~main__n~0))} is VALID [2018-11-14 17:35:52,438 INFO L273 TraceCheckUtils]: 13: Hoare triple {70#(and (<= main_~main__i~0 6) (= main_~main__sum~0 15) (<= 5 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {74#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:35:52,444 INFO L273 TraceCheckUtils]: 14: Hoare triple {74#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {25#false} is VALID [2018-11-14 17:35:52,445 INFO L273 TraceCheckUtils]: 15: Hoare triple {25#false} assume !false; {25#false} is VALID [2018-11-14 17:35:52,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:35:52,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:35:52,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-14 17:35:52,484 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-11-14 17:35:52,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:35:52,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 17:35:52,562 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:52,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 17:35:52,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 17:35:52,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:35:52,577 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 9 states. [2018-11-14 17:35:53,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:53,980 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2018-11-14 17:35:53,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 17:35:53,981 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-11-14 17:35:53,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:35:53,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:35:53,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2018-11-14 17:35:53,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:35:54,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2018-11-14 17:35:54,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2018-11-14 17:35:54,147 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:54,158 INFO L225 Difference]: With dead ends: 41 [2018-11-14 17:35:54,158 INFO L226 Difference]: Without dead ends: 18 [2018-11-14 17:35:54,162 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:35:54,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-14 17:35:54,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-14 17:35:54,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:35:54,209 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-14 17:35:54,209 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-14 17:35:54,209 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-14 17:35:54,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:54,213 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-14 17:35:54,213 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-14 17:35:54,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:54,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:54,214 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-14 17:35:54,214 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-14 17:35:54,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:54,217 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-14 17:35:54,218 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-14 17:35:54,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:54,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:54,219 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:35:54,219 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:35:54,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 17:35:54,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-14 17:35:54,223 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-11-14 17:35:54,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:35:54,223 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-14 17:35:54,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 17:35:54,223 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-14 17:35:54,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 17:35:54,224 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:35:54,224 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:35:54,225 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:35:54,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:35:54,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1787659072, now seen corresponding path program 1 times [2018-11-14 17:35:54,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:35:54,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:35:54,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:54,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:35:54,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:54,243 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:35:54,243 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:35:54,244 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2018-11-14 17:35:54,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:35:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:54,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:35:54,649 INFO L256 TraceCheckUtils]: 0: Hoare triple {189#true} call ULTIMATE.init(); {189#true} is VALID [2018-11-14 17:35:54,649 INFO L273 TraceCheckUtils]: 1: Hoare triple {189#true} ~__return_main~0 := 0;~__return_96~0 := 0; {189#true} is VALID [2018-11-14 17:35:54,650 INFO L273 TraceCheckUtils]: 2: Hoare triple {189#true} assume true; {189#true} is VALID [2018-11-14 17:35:54,650 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {189#true} {189#true} #48#return; {189#true} is VALID [2018-11-14 17:35:54,650 INFO L256 TraceCheckUtils]: 4: Hoare triple {189#true} call #t~ret2 := main(); {189#true} is VALID [2018-11-14 17:35:54,651 INFO L273 TraceCheckUtils]: 5: Hoare triple {189#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {189#true} is VALID [2018-11-14 17:35:54,651 INFO L273 TraceCheckUtils]: 6: Hoare triple {189#true} assume !!(1 <= ~main__n~0); {189#true} is VALID [2018-11-14 17:35:54,652 INFO L273 TraceCheckUtils]: 7: Hoare triple {189#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {215#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:35:54,655 INFO L273 TraceCheckUtils]: 8: Hoare triple {215#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {219#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 17:35:54,657 INFO L273 TraceCheckUtils]: 9: Hoare triple {219#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {223#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:35:54,658 INFO L273 TraceCheckUtils]: 10: Hoare triple {223#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {227#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:35:54,659 INFO L273 TraceCheckUtils]: 11: Hoare triple {227#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {231#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:35:54,661 INFO L273 TraceCheckUtils]: 12: Hoare triple {231#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {235#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:35:54,662 INFO L273 TraceCheckUtils]: 13: Hoare triple {235#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {239#(and (= main_~main__sum~0 21) (<= main_~main__i~0 7) (<= 6 main_~main__n~0))} is VALID [2018-11-14 17:35:54,664 INFO L273 TraceCheckUtils]: 14: Hoare triple {239#(and (= main_~main__sum~0 21) (<= main_~main__i~0 7) (<= 6 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {243#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:35:54,664 INFO L273 TraceCheckUtils]: 15: Hoare triple {243#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {190#false} is VALID [2018-11-14 17:35:54,665 INFO L273 TraceCheckUtils]: 16: Hoare triple {190#false} assume !false; {190#false} is VALID [2018-11-14 17:35:54,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:35:54,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:35:54,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-11-14 17:35:54,692 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-11-14 17:35:54,692 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:35:54,693 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 17:35:54,735 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:54,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 17:35:54,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 17:35:54,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:35:54,736 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 10 states. [2018-11-14 17:35:55,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:55,175 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-14 17:35:55,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 17:35:55,176 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-11-14 17:35:55,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:35:55,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:35:55,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 22 transitions. [2018-11-14 17:35:55,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:35:55,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 22 transitions. [2018-11-14 17:35:55,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 22 transitions. [2018-11-14 17:35:55,213 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:55,216 INFO L225 Difference]: With dead ends: 22 [2018-11-14 17:35:55,216 INFO L226 Difference]: Without dead ends: 19 [2018-11-14 17:35:55,217 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:35:55,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-14 17:35:55,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-14 17:35:55,236 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:35:55,237 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-14 17:35:55,237 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-14 17:35:55,237 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-14 17:35:55,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:55,239 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-14 17:35:55,239 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-14 17:35:55,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:55,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:55,240 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-14 17:35:55,240 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-14 17:35:55,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:55,242 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-14 17:35:55,242 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-14 17:35:55,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:55,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:55,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:35:55,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:35:55,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 17:35:55,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-11-14 17:35:55,245 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-11-14 17:35:55,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:35:55,245 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-11-14 17:35:55,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 17:35:55,246 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-14 17:35:55,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 17:35:55,246 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:35:55,247 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:35:55,247 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:35:55,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:35:55,247 INFO L82 PathProgramCache]: Analyzing trace with hash -417206074, now seen corresponding path program 2 times [2018-11-14 17:35:55,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:35:55,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:35:55,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:55,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:35:55,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:55,265 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:35:55,265 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:35:55,265 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2018-11-14 17:35:55,278 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:35:55,298 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:35:55,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:35:55,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:55,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:35:55,620 INFO L256 TraceCheckUtils]: 0: Hoare triple {344#true} call ULTIMATE.init(); {344#true} is VALID [2018-11-14 17:35:55,620 INFO L273 TraceCheckUtils]: 1: Hoare triple {344#true} ~__return_main~0 := 0;~__return_96~0 := 0; {344#true} is VALID [2018-11-14 17:35:55,620 INFO L273 TraceCheckUtils]: 2: Hoare triple {344#true} assume true; {344#true} is VALID [2018-11-14 17:35:55,621 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {344#true} {344#true} #48#return; {344#true} is VALID [2018-11-14 17:35:55,621 INFO L256 TraceCheckUtils]: 4: Hoare triple {344#true} call #t~ret2 := main(); {344#true} is VALID [2018-11-14 17:35:55,622 INFO L273 TraceCheckUtils]: 5: Hoare triple {344#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {344#true} is VALID [2018-11-14 17:35:55,622 INFO L273 TraceCheckUtils]: 6: Hoare triple {344#true} assume !!(1 <= ~main__n~0); {344#true} is VALID [2018-11-14 17:35:55,624 INFO L273 TraceCheckUtils]: 7: Hoare triple {344#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {370#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:35:55,626 INFO L273 TraceCheckUtils]: 8: Hoare triple {370#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {374#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 17:35:55,628 INFO L273 TraceCheckUtils]: 9: Hoare triple {374#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {378#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:35:55,629 INFO L273 TraceCheckUtils]: 10: Hoare triple {378#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {382#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:35:55,629 INFO L273 TraceCheckUtils]: 11: Hoare triple {382#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {386#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:35:55,631 INFO L273 TraceCheckUtils]: 12: Hoare triple {386#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {390#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:35:55,632 INFO L273 TraceCheckUtils]: 13: Hoare triple {390#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {394#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:35:55,633 INFO L273 TraceCheckUtils]: 14: Hoare triple {394#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {398#(and (<= main_~main__i~0 8) (<= 7 main_~main__n~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:35:55,635 INFO L273 TraceCheckUtils]: 15: Hoare triple {398#(and (<= main_~main__i~0 8) (<= 7 main_~main__n~0) (= main_~main__sum~0 28))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {402#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:35:55,636 INFO L273 TraceCheckUtils]: 16: Hoare triple {402#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {345#false} is VALID [2018-11-14 17:35:55,637 INFO L273 TraceCheckUtils]: 17: Hoare triple {345#false} assume !false; {345#false} is VALID [2018-11-14 17:35:55,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:35:55,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:35:55,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-11-14 17:35:55,661 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-11-14 17:35:55,661 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:35:55,661 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 17:35:55,683 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:55,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 17:35:55,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 17:35:55,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:35:55,685 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 11 states. [2018-11-14 17:35:56,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:56,175 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-14 17:35:56,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 17:35:56,176 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-11-14 17:35:56,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:35:56,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 17:35:56,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2018-11-14 17:35:56,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 17:35:56,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2018-11-14 17:35:56,180 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 23 transitions. [2018-11-14 17:35:56,214 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:56,215 INFO L225 Difference]: With dead ends: 23 [2018-11-14 17:35:56,216 INFO L226 Difference]: Without dead ends: 20 [2018-11-14 17:35:56,216 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:35:56,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-14 17:35:56,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-14 17:35:56,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:35:56,240 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-14 17:35:56,240 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-14 17:35:56,240 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-14 17:35:56,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:56,242 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-14 17:35:56,243 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-14 17:35:56,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:56,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:56,243 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-14 17:35:56,244 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-14 17:35:56,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:56,245 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-14 17:35:56,246 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-14 17:35:56,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:56,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:56,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:35:56,247 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:35:56,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 17:35:56,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-11-14 17:35:56,248 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-11-14 17:35:56,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:35:56,249 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-11-14 17:35:56,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 17:35:56,249 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-14 17:35:56,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 17:35:56,250 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:35:56,250 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:35:56,250 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:35:56,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:35:56,251 INFO L82 PathProgramCache]: Analyzing trace with hash -48548864, now seen corresponding path program 3 times [2018-11-14 17:35:56,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:35:56,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:35:56,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:56,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:35:56,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:56,268 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:35:56,269 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:35:56,269 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2018-11-14 17:35:56,283 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:35:56,305 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-14 17:35:56,305 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:35:56,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:56,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:35:56,601 INFO L256 TraceCheckUtils]: 0: Hoare triple {509#true} call ULTIMATE.init(); {509#true} is VALID [2018-11-14 17:35:56,602 INFO L273 TraceCheckUtils]: 1: Hoare triple {509#true} ~__return_main~0 := 0;~__return_96~0 := 0; {509#true} is VALID [2018-11-14 17:35:56,603 INFO L273 TraceCheckUtils]: 2: Hoare triple {509#true} assume true; {509#true} is VALID [2018-11-14 17:35:56,603 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {509#true} {509#true} #48#return; {509#true} is VALID [2018-11-14 17:35:56,603 INFO L256 TraceCheckUtils]: 4: Hoare triple {509#true} call #t~ret2 := main(); {509#true} is VALID [2018-11-14 17:35:56,604 INFO L273 TraceCheckUtils]: 5: Hoare triple {509#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {509#true} is VALID [2018-11-14 17:35:56,604 INFO L273 TraceCheckUtils]: 6: Hoare triple {509#true} assume !!(1 <= ~main__n~0); {509#true} is VALID [2018-11-14 17:35:56,605 INFO L273 TraceCheckUtils]: 7: Hoare triple {509#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {535#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:35:56,605 INFO L273 TraceCheckUtils]: 8: Hoare triple {535#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {539#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 17:35:56,606 INFO L273 TraceCheckUtils]: 9: Hoare triple {539#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {543#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:35:56,607 INFO L273 TraceCheckUtils]: 10: Hoare triple {543#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {547#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:35:56,610 INFO L273 TraceCheckUtils]: 11: Hoare triple {547#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {551#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:35:56,615 INFO L273 TraceCheckUtils]: 12: Hoare triple {551#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {555#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:35:56,618 INFO L273 TraceCheckUtils]: 13: Hoare triple {555#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {559#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:35:56,619 INFO L273 TraceCheckUtils]: 14: Hoare triple {559#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {563#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:35:56,619 INFO L273 TraceCheckUtils]: 15: Hoare triple {563#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {567#(and (<= main_~main__i~0 9) (<= 8 main_~main__n~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:35:56,641 INFO L273 TraceCheckUtils]: 16: Hoare triple {567#(and (<= main_~main__i~0 9) (<= 8 main_~main__n~0) (= main_~main__sum~0 36))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {571#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:35:56,656 INFO L273 TraceCheckUtils]: 17: Hoare triple {571#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {510#false} is VALID [2018-11-14 17:35:56,656 INFO L273 TraceCheckUtils]: 18: Hoare triple {510#false} assume !false; {510#false} is VALID [2018-11-14 17:35:56,658 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:35:56,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:35:56,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-11-14 17:35:56,683 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-11-14 17:35:56,683 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:35:56,683 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 17:35:56,710 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:56,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 17:35:56,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 17:35:56,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:35:56,712 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 12 states. [2018-11-14 17:35:57,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:57,113 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-14 17:35:57,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 17:35:57,114 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-11-14 17:35:57,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:35:57,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:35:57,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2018-11-14 17:35:57,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:35:57,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2018-11-14 17:35:57,118 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 24 transitions. [2018-11-14 17:35:57,149 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:57,151 INFO L225 Difference]: With dead ends: 24 [2018-11-14 17:35:57,151 INFO L226 Difference]: Without dead ends: 21 [2018-11-14 17:35:57,152 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-11-14 17:35:57,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-14 17:35:57,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-14 17:35:57,173 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:35:57,173 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-14 17:35:57,173 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-14 17:35:57,173 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-14 17:35:57,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:57,176 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-14 17:35:57,176 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-14 17:35:57,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:57,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:57,178 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-14 17:35:57,178 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-14 17:35:57,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:57,180 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-14 17:35:57,180 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-14 17:35:57,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:57,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:57,181 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:35:57,181 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:35:57,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 17:35:57,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-14 17:35:57,183 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-11-14 17:35:57,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:35:57,184 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-14 17:35:57,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 17:35:57,184 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-14 17:35:57,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 17:35:57,185 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:35:57,185 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:35:57,186 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:35:57,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:35:57,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1505077242, now seen corresponding path program 4 times [2018-11-14 17:35:57,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:35:57,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:35:57,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:57,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:35:57,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:57,203 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:35:57,203 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:35:57,203 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2018-11-14 17:35:57,225 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:35:57,296 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:35:57,296 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:35:57,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:57,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:35:57,628 INFO L256 TraceCheckUtils]: 0: Hoare triple {684#true} call ULTIMATE.init(); {684#true} is VALID [2018-11-14 17:35:57,628 INFO L273 TraceCheckUtils]: 1: Hoare triple {684#true} ~__return_main~0 := 0;~__return_96~0 := 0; {684#true} is VALID [2018-11-14 17:35:57,629 INFO L273 TraceCheckUtils]: 2: Hoare triple {684#true} assume true; {684#true} is VALID [2018-11-14 17:35:57,629 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {684#true} {684#true} #48#return; {684#true} is VALID [2018-11-14 17:35:57,629 INFO L256 TraceCheckUtils]: 4: Hoare triple {684#true} call #t~ret2 := main(); {684#true} is VALID [2018-11-14 17:35:57,630 INFO L273 TraceCheckUtils]: 5: Hoare triple {684#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {684#true} is VALID [2018-11-14 17:35:57,630 INFO L273 TraceCheckUtils]: 6: Hoare triple {684#true} assume !!(1 <= ~main__n~0); {684#true} is VALID [2018-11-14 17:35:57,631 INFO L273 TraceCheckUtils]: 7: Hoare triple {684#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {710#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:35:57,631 INFO L273 TraceCheckUtils]: 8: Hoare triple {710#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {714#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 17:35:57,632 INFO L273 TraceCheckUtils]: 9: Hoare triple {714#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {718#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:35:57,633 INFO L273 TraceCheckUtils]: 10: Hoare triple {718#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {722#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:35:57,633 INFO L273 TraceCheckUtils]: 11: Hoare triple {722#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {726#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:35:57,634 INFO L273 TraceCheckUtils]: 12: Hoare triple {726#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {730#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:35:57,635 INFO L273 TraceCheckUtils]: 13: Hoare triple {730#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {734#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:35:57,636 INFO L273 TraceCheckUtils]: 14: Hoare triple {734#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {738#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:35:57,637 INFO L273 TraceCheckUtils]: 15: Hoare triple {738#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {742#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:35:57,639 INFO L273 TraceCheckUtils]: 16: Hoare triple {742#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {746#(and (= main_~main__sum~0 45) (<= 9 main_~main__n~0) (<= main_~main__i~0 10))} is VALID [2018-11-14 17:35:57,641 INFO L273 TraceCheckUtils]: 17: Hoare triple {746#(and (= main_~main__sum~0 45) (<= 9 main_~main__n~0) (<= main_~main__i~0 10))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {750#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:35:57,642 INFO L273 TraceCheckUtils]: 18: Hoare triple {750#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {685#false} is VALID [2018-11-14 17:35:57,642 INFO L273 TraceCheckUtils]: 19: Hoare triple {685#false} assume !false; {685#false} is VALID [2018-11-14 17:35:57,644 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:35:57,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:35:57,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-11-14 17:35:57,673 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-11-14 17:35:57,674 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:35:57,674 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-14 17:35:57,703 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:57,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-14 17:35:57,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-14 17:35:57,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-14 17:35:57,704 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 13 states. [2018-11-14 17:35:58,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:58,455 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-14 17:35:58,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 17:35:58,456 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-11-14 17:35:58,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:35:58,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 17:35:58,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2018-11-14 17:35:58,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 17:35:58,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2018-11-14 17:35:58,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 25 transitions. [2018-11-14 17:35:58,491 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:58,493 INFO L225 Difference]: With dead ends: 25 [2018-11-14 17:35:58,493 INFO L226 Difference]: Without dead ends: 22 [2018-11-14 17:35:58,494 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-11-14 17:35:58,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-14 17:35:58,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-14 17:35:58,511 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:35:58,511 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-14 17:35:58,511 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 17:35:58,511 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 17:35:58,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:58,514 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-14 17:35:58,514 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-14 17:35:58,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:58,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:58,515 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 17:35:58,515 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 17:35:58,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:58,517 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-14 17:35:58,518 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-14 17:35:58,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:58,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:58,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:35:58,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:35:58,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 17:35:58,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-11-14 17:35:58,520 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-11-14 17:35:58,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:35:58,521 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-11-14 17:35:58,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-14 17:35:58,521 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-14 17:35:58,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 17:35:58,522 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:35:58,522 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:35:58,522 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:35:58,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:35:58,522 INFO L82 PathProgramCache]: Analyzing trace with hash 587183296, now seen corresponding path program 5 times [2018-11-14 17:35:58,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:35:58,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:35:58,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:58,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:35:58,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:58,539 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:35:58,539 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:35:58,539 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:35:58,561 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 17:35:58,582 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-14 17:35:58,582 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:35:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:58,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:35:59,261 INFO L256 TraceCheckUtils]: 0: Hoare triple {869#true} call ULTIMATE.init(); {869#true} is VALID [2018-11-14 17:35:59,261 INFO L273 TraceCheckUtils]: 1: Hoare triple {869#true} ~__return_main~0 := 0;~__return_96~0 := 0; {869#true} is VALID [2018-11-14 17:35:59,262 INFO L273 TraceCheckUtils]: 2: Hoare triple {869#true} assume true; {869#true} is VALID [2018-11-14 17:35:59,262 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {869#true} {869#true} #48#return; {869#true} is VALID [2018-11-14 17:35:59,262 INFO L256 TraceCheckUtils]: 4: Hoare triple {869#true} call #t~ret2 := main(); {869#true} is VALID [2018-11-14 17:35:59,262 INFO L273 TraceCheckUtils]: 5: Hoare triple {869#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {869#true} is VALID [2018-11-14 17:35:59,263 INFO L273 TraceCheckUtils]: 6: Hoare triple {869#true} assume !!(1 <= ~main__n~0); {869#true} is VALID [2018-11-14 17:35:59,263 INFO L273 TraceCheckUtils]: 7: Hoare triple {869#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {895#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:35:59,264 INFO L273 TraceCheckUtils]: 8: Hoare triple {895#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {899#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 17:35:59,265 INFO L273 TraceCheckUtils]: 9: Hoare triple {899#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {903#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:35:59,265 INFO L273 TraceCheckUtils]: 10: Hoare triple {903#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {907#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:35:59,266 INFO L273 TraceCheckUtils]: 11: Hoare triple {907#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {911#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:35:59,267 INFO L273 TraceCheckUtils]: 12: Hoare triple {911#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {915#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:35:59,268 INFO L273 TraceCheckUtils]: 13: Hoare triple {915#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {919#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:35:59,270 INFO L273 TraceCheckUtils]: 14: Hoare triple {919#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {923#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:35:59,271 INFO L273 TraceCheckUtils]: 15: Hoare triple {923#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {927#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:35:59,278 INFO L273 TraceCheckUtils]: 16: Hoare triple {927#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {931#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:35:59,280 INFO L273 TraceCheckUtils]: 17: Hoare triple {931#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {935#(and (= main_~main__sum~0 55) (<= main_~main__i~0 11) (<= 10 main_~main__n~0))} is VALID [2018-11-14 17:35:59,281 INFO L273 TraceCheckUtils]: 18: Hoare triple {935#(and (= main_~main__sum~0 55) (<= main_~main__i~0 11) (<= 10 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {939#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:35:59,281 INFO L273 TraceCheckUtils]: 19: Hoare triple {939#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {870#false} is VALID [2018-11-14 17:35:59,281 INFO L273 TraceCheckUtils]: 20: Hoare triple {870#false} assume !false; {870#false} is VALID [2018-11-14 17:35:59,283 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:35:59,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:35:59,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-11-14 17:35:59,304 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2018-11-14 17:35:59,304 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:35:59,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 17:35:59,329 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:59,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 17:35:59,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 17:35:59,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-14 17:35:59,330 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 14 states. [2018-11-14 17:35:59,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:59,983 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-14 17:35:59,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 17:35:59,983 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2018-11-14 17:35:59,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:35:59,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 17:35:59,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 26 transitions. [2018-11-14 17:35:59,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 17:35:59,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 26 transitions. [2018-11-14 17:35:59,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 26 transitions. [2018-11-14 17:36:00,020 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:00,021 INFO L225 Difference]: With dead ends: 26 [2018-11-14 17:36:00,022 INFO L226 Difference]: Without dead ends: 23 [2018-11-14 17:36:00,022 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2018-11-14 17:36:00,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-14 17:36:00,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-14 17:36:00,041 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:00,041 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2018-11-14 17:36:00,041 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-14 17:36:00,041 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-14 17:36:00,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:00,044 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-14 17:36:00,044 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-14 17:36:00,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:00,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:00,045 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-14 17:36:00,045 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-14 17:36:00,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:00,046 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-14 17:36:00,047 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-14 17:36:00,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:00,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:00,047 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:00,047 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:00,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 17:36:00,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-11-14 17:36:00,049 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-11-14 17:36:00,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:00,049 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-11-14 17:36:00,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 17:36:00,050 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-14 17:36:00,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 17:36:00,050 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:00,051 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:00,051 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:00,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:00,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1022750534, now seen corresponding path program 6 times [2018-11-14 17:36:00,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:00,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:00,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:00,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:36:00,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:00,066 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:00,067 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:00,067 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:36:00,085 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 17:36:00,107 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-11-14 17:36:00,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:36:00,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:00,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:00,440 INFO L256 TraceCheckUtils]: 0: Hoare triple {1064#true} call ULTIMATE.init(); {1064#true} is VALID [2018-11-14 17:36:00,440 INFO L273 TraceCheckUtils]: 1: Hoare triple {1064#true} ~__return_main~0 := 0;~__return_96~0 := 0; {1064#true} is VALID [2018-11-14 17:36:00,441 INFO L273 TraceCheckUtils]: 2: Hoare triple {1064#true} assume true; {1064#true} is VALID [2018-11-14 17:36:00,441 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1064#true} {1064#true} #48#return; {1064#true} is VALID [2018-11-14 17:36:00,441 INFO L256 TraceCheckUtils]: 4: Hoare triple {1064#true} call #t~ret2 := main(); {1064#true} is VALID [2018-11-14 17:36:00,442 INFO L273 TraceCheckUtils]: 5: Hoare triple {1064#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {1064#true} is VALID [2018-11-14 17:36:00,442 INFO L273 TraceCheckUtils]: 6: Hoare triple {1064#true} assume !!(1 <= ~main__n~0); {1064#true} is VALID [2018-11-14 17:36:00,442 INFO L273 TraceCheckUtils]: 7: Hoare triple {1064#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1090#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:36:00,443 INFO L273 TraceCheckUtils]: 8: Hoare triple {1090#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1094#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 17:36:00,444 INFO L273 TraceCheckUtils]: 9: Hoare triple {1094#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1098#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:36:00,457 INFO L273 TraceCheckUtils]: 10: Hoare triple {1098#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1102#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:36:00,459 INFO L273 TraceCheckUtils]: 11: Hoare triple {1102#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1106#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:36:00,459 INFO L273 TraceCheckUtils]: 12: Hoare triple {1106#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1110#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:36:00,460 INFO L273 TraceCheckUtils]: 13: Hoare triple {1110#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1114#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:36:00,461 INFO L273 TraceCheckUtils]: 14: Hoare triple {1114#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1118#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:36:00,462 INFO L273 TraceCheckUtils]: 15: Hoare triple {1118#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1122#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:36:00,463 INFO L273 TraceCheckUtils]: 16: Hoare triple {1122#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1126#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:36:00,469 INFO L273 TraceCheckUtils]: 17: Hoare triple {1126#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1130#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 17:36:00,470 INFO L273 TraceCheckUtils]: 18: Hoare triple {1130#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1134#(and (= main_~main__sum~0 66) (<= main_~main__i~0 12) (<= 11 main_~main__n~0))} is VALID [2018-11-14 17:36:00,471 INFO L273 TraceCheckUtils]: 19: Hoare triple {1134#(and (= main_~main__sum~0 66) (<= main_~main__i~0 12) (<= 11 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1138#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:36:00,471 INFO L273 TraceCheckUtils]: 20: Hoare triple {1138#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {1065#false} is VALID [2018-11-14 17:36:00,471 INFO L273 TraceCheckUtils]: 21: Hoare triple {1065#false} assume !false; {1065#false} is VALID [2018-11-14 17:36:00,472 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:00,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:00,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-11-14 17:36:00,503 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-11-14 17:36:00,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:00,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-14 17:36:00,534 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:00,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-14 17:36:00,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-14 17:36:00,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-11-14 17:36:00,536 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 15 states. [2018-11-14 17:36:01,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:01,256 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-14 17:36:01,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-14 17:36:01,256 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-11-14 17:36:01,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:01,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 17:36:01,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-11-14 17:36:01,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 17:36:01,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-11-14 17:36:01,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 27 transitions. [2018-11-14 17:36:01,288 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:01,289 INFO L225 Difference]: With dead ends: 27 [2018-11-14 17:36:01,290 INFO L226 Difference]: Without dead ends: 24 [2018-11-14 17:36:01,291 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-11-14 17:36:01,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-14 17:36:01,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-14 17:36:01,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:01,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-14 17:36:01,315 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-14 17:36:01,315 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-14 17:36:01,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:01,317 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-14 17:36:01,317 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-14 17:36:01,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:01,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:01,317 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-14 17:36:01,318 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-14 17:36:01,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:01,319 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-14 17:36:01,319 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-14 17:36:01,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:01,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:01,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:01,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:01,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 17:36:01,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-11-14 17:36:01,321 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-11-14 17:36:01,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:01,322 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-11-14 17:36:01,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-14 17:36:01,322 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-14 17:36:01,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 17:36:01,322 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:01,323 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:01,323 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:01,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:01,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1640433024, now seen corresponding path program 7 times [2018-11-14 17:36:01,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:01,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:01,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:01,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:36:01,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:01,337 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:01,337 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:01,337 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:36:01,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:36:01,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:01,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:01,670 INFO L256 TraceCheckUtils]: 0: Hoare triple {1269#true} call ULTIMATE.init(); {1269#true} is VALID [2018-11-14 17:36:01,671 INFO L273 TraceCheckUtils]: 1: Hoare triple {1269#true} ~__return_main~0 := 0;~__return_96~0 := 0; {1269#true} is VALID [2018-11-14 17:36:01,671 INFO L273 TraceCheckUtils]: 2: Hoare triple {1269#true} assume true; {1269#true} is VALID [2018-11-14 17:36:01,671 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1269#true} {1269#true} #48#return; {1269#true} is VALID [2018-11-14 17:36:01,671 INFO L256 TraceCheckUtils]: 4: Hoare triple {1269#true} call #t~ret2 := main(); {1269#true} is VALID [2018-11-14 17:36:01,671 INFO L273 TraceCheckUtils]: 5: Hoare triple {1269#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {1269#true} is VALID [2018-11-14 17:36:01,672 INFO L273 TraceCheckUtils]: 6: Hoare triple {1269#true} assume !!(1 <= ~main__n~0); {1269#true} is VALID [2018-11-14 17:36:01,672 INFO L273 TraceCheckUtils]: 7: Hoare triple {1269#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1295#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:36:01,673 INFO L273 TraceCheckUtils]: 8: Hoare triple {1295#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1299#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 17:36:01,674 INFO L273 TraceCheckUtils]: 9: Hoare triple {1299#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1303#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:36:01,675 INFO L273 TraceCheckUtils]: 10: Hoare triple {1303#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1307#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:36:01,676 INFO L273 TraceCheckUtils]: 11: Hoare triple {1307#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1311#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:36:01,677 INFO L273 TraceCheckUtils]: 12: Hoare triple {1311#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1315#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:36:01,678 INFO L273 TraceCheckUtils]: 13: Hoare triple {1315#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1319#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:36:01,679 INFO L273 TraceCheckUtils]: 14: Hoare triple {1319#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1323#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:36:01,680 INFO L273 TraceCheckUtils]: 15: Hoare triple {1323#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1327#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:36:01,681 INFO L273 TraceCheckUtils]: 16: Hoare triple {1327#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1331#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:36:01,682 INFO L273 TraceCheckUtils]: 17: Hoare triple {1331#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1335#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 17:36:01,683 INFO L273 TraceCheckUtils]: 18: Hoare triple {1335#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1339#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 17:36:01,684 INFO L273 TraceCheckUtils]: 19: Hoare triple {1339#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1343#(and (= main_~main__sum~0 78) (<= main_~main__i~0 13) (<= 12 main_~main__n~0))} is VALID [2018-11-14 17:36:01,685 INFO L273 TraceCheckUtils]: 20: Hoare triple {1343#(and (= main_~main__sum~0 78) (<= main_~main__i~0 13) (<= 12 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1347#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:36:01,686 INFO L273 TraceCheckUtils]: 21: Hoare triple {1347#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {1270#false} is VALID [2018-11-14 17:36:01,686 INFO L273 TraceCheckUtils]: 22: Hoare triple {1270#false} assume !false; {1270#false} is VALID [2018-11-14 17:36:01,688 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:01,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:01,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-11-14 17:36:01,710 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-11-14 17:36:01,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:01,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 17:36:01,781 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:01,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 17:36:01,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 17:36:01,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-11-14 17:36:01,782 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 16 states. [2018-11-14 17:36:02,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:02,552 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-14 17:36:02,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 17:36:02,552 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-11-14 17:36:02,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:02,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 17:36:02,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 28 transitions. [2018-11-14 17:36:02,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 17:36:02,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 28 transitions. [2018-11-14 17:36:02,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 28 transitions. [2018-11-14 17:36:02,584 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:02,586 INFO L225 Difference]: With dead ends: 28 [2018-11-14 17:36:02,586 INFO L226 Difference]: Without dead ends: 25 [2018-11-14 17:36:02,587 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-11-14 17:36:02,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-14 17:36:02,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-14 17:36:02,607 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:02,607 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-14 17:36:02,607 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-14 17:36:02,608 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-14 17:36:02,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:02,609 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-14 17:36:02,609 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-14 17:36:02,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:02,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:02,610 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-14 17:36:02,610 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-14 17:36:02,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:02,612 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-14 17:36:02,612 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-14 17:36:02,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:02,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:02,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:02,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:02,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 17:36:02,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-11-14 17:36:02,614 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-11-14 17:36:02,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:02,614 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-11-14 17:36:02,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 17:36:02,614 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-14 17:36:02,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 17:36:02,615 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:02,615 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:02,615 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:02,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:02,616 INFO L82 PathProgramCache]: Analyzing trace with hash -686246266, now seen corresponding path program 8 times [2018-11-14 17:36:02,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:02,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:02,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:02,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:36:02,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:02,630 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:02,630 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:02,630 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:36:02,651 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:36:02,673 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:36:02,673 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:36:02,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:02,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:03,012 INFO L256 TraceCheckUtils]: 0: Hoare triple {1484#true} call ULTIMATE.init(); {1484#true} is VALID [2018-11-14 17:36:03,012 INFO L273 TraceCheckUtils]: 1: Hoare triple {1484#true} ~__return_main~0 := 0;~__return_96~0 := 0; {1484#true} is VALID [2018-11-14 17:36:03,013 INFO L273 TraceCheckUtils]: 2: Hoare triple {1484#true} assume true; {1484#true} is VALID [2018-11-14 17:36:03,013 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1484#true} {1484#true} #48#return; {1484#true} is VALID [2018-11-14 17:36:03,013 INFO L256 TraceCheckUtils]: 4: Hoare triple {1484#true} call #t~ret2 := main(); {1484#true} is VALID [2018-11-14 17:36:03,013 INFO L273 TraceCheckUtils]: 5: Hoare triple {1484#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {1484#true} is VALID [2018-11-14 17:36:03,014 INFO L273 TraceCheckUtils]: 6: Hoare triple {1484#true} assume !!(1 <= ~main__n~0); {1484#true} is VALID [2018-11-14 17:36:03,014 INFO L273 TraceCheckUtils]: 7: Hoare triple {1484#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1510#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:36:03,015 INFO L273 TraceCheckUtils]: 8: Hoare triple {1510#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1514#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 17:36:03,015 INFO L273 TraceCheckUtils]: 9: Hoare triple {1514#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1518#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:36:03,016 INFO L273 TraceCheckUtils]: 10: Hoare triple {1518#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1522#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:36:03,016 INFO L273 TraceCheckUtils]: 11: Hoare triple {1522#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1526#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:36:03,017 INFO L273 TraceCheckUtils]: 12: Hoare triple {1526#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1530#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:36:03,018 INFO L273 TraceCheckUtils]: 13: Hoare triple {1530#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1534#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:36:03,019 INFO L273 TraceCheckUtils]: 14: Hoare triple {1534#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1538#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:36:03,020 INFO L273 TraceCheckUtils]: 15: Hoare triple {1538#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1542#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:36:03,021 INFO L273 TraceCheckUtils]: 16: Hoare triple {1542#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1546#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:36:03,023 INFO L273 TraceCheckUtils]: 17: Hoare triple {1546#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1550#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 17:36:03,024 INFO L273 TraceCheckUtils]: 18: Hoare triple {1550#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1554#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 17:36:03,024 INFO L273 TraceCheckUtils]: 19: Hoare triple {1554#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1558#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 17:36:03,025 INFO L273 TraceCheckUtils]: 20: Hoare triple {1558#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1562#(and (<= main_~main__i~0 14) (= main_~main__sum~0 91) (<= 13 main_~main__n~0))} is VALID [2018-11-14 17:36:03,027 INFO L273 TraceCheckUtils]: 21: Hoare triple {1562#(and (<= main_~main__i~0 14) (= main_~main__sum~0 91) (<= 13 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1566#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:36:03,028 INFO L273 TraceCheckUtils]: 22: Hoare triple {1566#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {1485#false} is VALID [2018-11-14 17:36:03,028 INFO L273 TraceCheckUtils]: 23: Hoare triple {1485#false} assume !false; {1485#false} is VALID [2018-11-14 17:36:03,029 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:03,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:03,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-11-14 17:36:03,050 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2018-11-14 17:36:03,051 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:03,051 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-14 17:36:03,077 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:03,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-14 17:36:03,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-14 17:36:03,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-11-14 17:36:03,078 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 17 states. [2018-11-14 17:36:03,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:03,887 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-14 17:36:03,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-14 17:36:03,888 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2018-11-14 17:36:03,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:03,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 17:36:03,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 29 transitions. [2018-11-14 17:36:03,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 17:36:03,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 29 transitions. [2018-11-14 17:36:03,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 29 transitions. [2018-11-14 17:36:03,921 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:03,922 INFO L225 Difference]: With dead ends: 29 [2018-11-14 17:36:03,922 INFO L226 Difference]: Without dead ends: 26 [2018-11-14 17:36:03,923 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-11-14 17:36:03,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-14 17:36:03,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-14 17:36:03,950 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:03,950 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-14 17:36:03,951 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-14 17:36:03,951 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-14 17:36:03,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:03,952 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-14 17:36:03,952 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-14 17:36:03,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:03,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:03,953 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-14 17:36:03,953 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-14 17:36:03,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:03,954 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-14 17:36:03,954 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-14 17:36:03,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:03,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:03,955 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:03,955 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:03,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 17:36:03,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-11-14 17:36:03,956 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-11-14 17:36:03,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:03,957 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-11-14 17:36:03,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-14 17:36:03,957 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-14 17:36:03,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 17:36:03,958 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:03,958 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:03,958 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:03,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:03,959 INFO L82 PathProgramCache]: Analyzing trace with hash 201139776, now seen corresponding path program 9 times [2018-11-14 17:36:03,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:03,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:03,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:03,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:36:03,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:03,972 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:03,972 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:03,973 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:36:03,995 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:36:04,041 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-14 17:36:04,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:36:04,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:04,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:04,610 INFO L256 TraceCheckUtils]: 0: Hoare triple {1709#true} call ULTIMATE.init(); {1709#true} is VALID [2018-11-14 17:36:04,611 INFO L273 TraceCheckUtils]: 1: Hoare triple {1709#true} ~__return_main~0 := 0;~__return_96~0 := 0; {1709#true} is VALID [2018-11-14 17:36:04,611 INFO L273 TraceCheckUtils]: 2: Hoare triple {1709#true} assume true; {1709#true} is VALID [2018-11-14 17:36:04,611 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1709#true} {1709#true} #48#return; {1709#true} is VALID [2018-11-14 17:36:04,612 INFO L256 TraceCheckUtils]: 4: Hoare triple {1709#true} call #t~ret2 := main(); {1709#true} is VALID [2018-11-14 17:36:04,612 INFO L273 TraceCheckUtils]: 5: Hoare triple {1709#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {1709#true} is VALID [2018-11-14 17:36:04,612 INFO L273 TraceCheckUtils]: 6: Hoare triple {1709#true} assume !!(1 <= ~main__n~0); {1709#true} is VALID [2018-11-14 17:36:04,613 INFO L273 TraceCheckUtils]: 7: Hoare triple {1709#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1735#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:36:04,614 INFO L273 TraceCheckUtils]: 8: Hoare triple {1735#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1739#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 17:36:04,614 INFO L273 TraceCheckUtils]: 9: Hoare triple {1739#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1743#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:36:04,615 INFO L273 TraceCheckUtils]: 10: Hoare triple {1743#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1747#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:36:04,616 INFO L273 TraceCheckUtils]: 11: Hoare triple {1747#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1751#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:36:04,617 INFO L273 TraceCheckUtils]: 12: Hoare triple {1751#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1755#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:36:04,618 INFO L273 TraceCheckUtils]: 13: Hoare triple {1755#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1759#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:36:04,619 INFO L273 TraceCheckUtils]: 14: Hoare triple {1759#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1763#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:36:04,620 INFO L273 TraceCheckUtils]: 15: Hoare triple {1763#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1767#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:36:04,621 INFO L273 TraceCheckUtils]: 16: Hoare triple {1767#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1771#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:36:04,622 INFO L273 TraceCheckUtils]: 17: Hoare triple {1771#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1775#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 17:36:04,628 INFO L273 TraceCheckUtils]: 18: Hoare triple {1775#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1779#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 17:36:04,629 INFO L273 TraceCheckUtils]: 19: Hoare triple {1779#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1783#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 17:36:04,630 INFO L273 TraceCheckUtils]: 20: Hoare triple {1783#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1787#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 17:36:04,631 INFO L273 TraceCheckUtils]: 21: Hoare triple {1787#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1791#(and (<= main_~main__i~0 15) (= main_~main__sum~0 105) (<= 14 main_~main__n~0))} is VALID [2018-11-14 17:36:04,632 INFO L273 TraceCheckUtils]: 22: Hoare triple {1791#(and (<= main_~main__i~0 15) (= main_~main__sum~0 105) (<= 14 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1795#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:36:04,639 INFO L273 TraceCheckUtils]: 23: Hoare triple {1795#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {1710#false} is VALID [2018-11-14 17:36:04,639 INFO L273 TraceCheckUtils]: 24: Hoare triple {1710#false} assume !false; {1710#false} is VALID [2018-11-14 17:36:04,641 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:04,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:04,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-11-14 17:36:04,662 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2018-11-14 17:36:04,662 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:04,662 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 17:36:04,693 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:04,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 17:36:04,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 17:36:04,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-11-14 17:36:04,694 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 18 states. [2018-11-14 17:36:05,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:05,707 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-14 17:36:05,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-14 17:36:05,707 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2018-11-14 17:36:05,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:05,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 17:36:05,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 30 transitions. [2018-11-14 17:36:05,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 17:36:05,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 30 transitions. [2018-11-14 17:36:05,711 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 30 transitions. [2018-11-14 17:36:05,747 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:05,748 INFO L225 Difference]: With dead ends: 30 [2018-11-14 17:36:05,749 INFO L226 Difference]: Without dead ends: 27 [2018-11-14 17:36:05,749 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2018-11-14 17:36:05,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-14 17:36:05,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-14 17:36:05,774 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:05,774 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-14 17:36:05,774 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-14 17:36:05,774 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-14 17:36:05,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:05,776 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-14 17:36:05,776 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-14 17:36:05,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:05,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:05,776 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-14 17:36:05,776 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-14 17:36:05,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:05,777 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-14 17:36:05,778 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-14 17:36:05,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:05,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:05,778 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:05,778 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:05,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 17:36:05,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-14 17:36:05,779 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-11-14 17:36:05,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:05,780 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-11-14 17:36:05,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 17:36:05,780 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-14 17:36:05,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 17:36:05,780 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:05,780 INFO L375 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:05,781 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:05,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:05,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1940303302, now seen corresponding path program 10 times [2018-11-14 17:36:05,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:05,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:05,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:05,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:36:05,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:05,794 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:05,794 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:05,794 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:36:05,807 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:36:05,973 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:36:05,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:36:06,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:06,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:07,944 INFO L256 TraceCheckUtils]: 0: Hoare triple {1944#true} call ULTIMATE.init(); {1944#true} is VALID [2018-11-14 17:36:07,944 INFO L273 TraceCheckUtils]: 1: Hoare triple {1944#true} ~__return_main~0 := 0;~__return_96~0 := 0; {1944#true} is VALID [2018-11-14 17:36:07,945 INFO L273 TraceCheckUtils]: 2: Hoare triple {1944#true} assume true; {1944#true} is VALID [2018-11-14 17:36:07,945 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1944#true} {1944#true} #48#return; {1944#true} is VALID [2018-11-14 17:36:07,945 INFO L256 TraceCheckUtils]: 4: Hoare triple {1944#true} call #t~ret2 := main(); {1944#true} is VALID [2018-11-14 17:36:07,946 INFO L273 TraceCheckUtils]: 5: Hoare triple {1944#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {1944#true} is VALID [2018-11-14 17:36:07,946 INFO L273 TraceCheckUtils]: 6: Hoare triple {1944#true} assume !!(1 <= ~main__n~0); {1944#true} is VALID [2018-11-14 17:36:07,947 INFO L273 TraceCheckUtils]: 7: Hoare triple {1944#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1970#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:36:07,947 INFO L273 TraceCheckUtils]: 8: Hoare triple {1970#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1974#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-14 17:36:07,948 INFO L273 TraceCheckUtils]: 9: Hoare triple {1974#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1978#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:36:07,948 INFO L273 TraceCheckUtils]: 10: Hoare triple {1978#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1982#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:36:07,949 INFO L273 TraceCheckUtils]: 11: Hoare triple {1982#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1986#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:36:07,950 INFO L273 TraceCheckUtils]: 12: Hoare triple {1986#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1990#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:36:07,951 INFO L273 TraceCheckUtils]: 13: Hoare triple {1990#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1994#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:36:07,952 INFO L273 TraceCheckUtils]: 14: Hoare triple {1994#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {1998#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:36:07,953 INFO L273 TraceCheckUtils]: 15: Hoare triple {1998#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2002#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:36:07,954 INFO L273 TraceCheckUtils]: 16: Hoare triple {2002#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2006#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:36:07,955 INFO L273 TraceCheckUtils]: 17: Hoare triple {2006#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2010#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 17:36:07,956 INFO L273 TraceCheckUtils]: 18: Hoare triple {2010#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2014#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 17:36:07,957 INFO L273 TraceCheckUtils]: 19: Hoare triple {2014#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2018#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 17:36:07,958 INFO L273 TraceCheckUtils]: 20: Hoare triple {2018#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2022#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 17:36:07,959 INFO L273 TraceCheckUtils]: 21: Hoare triple {2022#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2026#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 17:36:07,960 INFO L273 TraceCheckUtils]: 22: Hoare triple {2026#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2030#(and (<= 15 main_~main__n~0) (<= main_~main__i~0 16) (= main_~main__sum~0 120))} is VALID [2018-11-14 17:36:07,961 INFO L273 TraceCheckUtils]: 23: Hoare triple {2030#(and (<= 15 main_~main__n~0) (<= main_~main__i~0 16) (= main_~main__sum~0 120))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2034#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:36:07,962 INFO L273 TraceCheckUtils]: 24: Hoare triple {2034#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {1945#false} is VALID [2018-11-14 17:36:07,962 INFO L273 TraceCheckUtils]: 25: Hoare triple {1945#false} assume !false; {1945#false} is VALID [2018-11-14 17:36:07,964 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:07,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:07,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-11-14 17:36:07,985 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 26 [2018-11-14 17:36:07,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:07,985 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-14 17:36:08,011 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:08,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-14 17:36:08,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-14 17:36:08,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-11-14 17:36:08,013 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 19 states. [2018-11-14 17:36:08,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:08,869 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-14 17:36:08,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-14 17:36:08,869 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 26 [2018-11-14 17:36:08,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:08,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 17:36:08,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 31 transitions. [2018-11-14 17:36:08,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 17:36:08,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 31 transitions. [2018-11-14 17:36:08,873 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 31 transitions. [2018-11-14 17:36:08,902 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:08,903 INFO L225 Difference]: With dead ends: 31 [2018-11-14 17:36:08,904 INFO L226 Difference]: Without dead ends: 28 [2018-11-14 17:36:08,904 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2018-11-14 17:36:08,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-14 17:36:08,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-14 17:36:08,931 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:08,932 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-14 17:36:08,932 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-14 17:36:08,932 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-14 17:36:08,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:08,933 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-14 17:36:08,934 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-14 17:36:08,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:08,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:08,935 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-14 17:36:08,935 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-14 17:36:08,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:08,936 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-14 17:36:08,936 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-14 17:36:08,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:08,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:08,937 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:08,937 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:08,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 17:36:08,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-11-14 17:36:08,938 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-11-14 17:36:08,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:08,938 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-11-14 17:36:08,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-14 17:36:08,938 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-14 17:36:08,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 17:36:08,939 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:08,939 INFO L375 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:08,939 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:08,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:08,940 INFO L82 PathProgramCache]: Analyzing trace with hash 19797760, now seen corresponding path program 11 times [2018-11-14 17:36:08,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:08,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:08,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:08,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:36:08,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:08,953 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:08,953 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:08,953 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:36:08,977 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 17:36:09,004 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-14 17:36:09,005 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:36:09,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:09,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:09,460 INFO L256 TraceCheckUtils]: 0: Hoare triple {2189#true} call ULTIMATE.init(); {2189#true} is VALID [2018-11-14 17:36:09,461 INFO L273 TraceCheckUtils]: 1: Hoare triple {2189#true} ~__return_main~0 := 0;~__return_96~0 := 0; {2189#true} is VALID [2018-11-14 17:36:09,461 INFO L273 TraceCheckUtils]: 2: Hoare triple {2189#true} assume true; {2189#true} is VALID [2018-11-14 17:36:09,461 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2189#true} {2189#true} #48#return; {2189#true} is VALID [2018-11-14 17:36:09,462 INFO L256 TraceCheckUtils]: 4: Hoare triple {2189#true} call #t~ret2 := main(); {2189#true} is VALID [2018-11-14 17:36:09,462 INFO L273 TraceCheckUtils]: 5: Hoare triple {2189#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {2189#true} is VALID [2018-11-14 17:36:09,462 INFO L273 TraceCheckUtils]: 6: Hoare triple {2189#true} assume !!(1 <= ~main__n~0); {2189#true} is VALID [2018-11-14 17:36:09,463 INFO L273 TraceCheckUtils]: 7: Hoare triple {2189#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {2215#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:36:09,464 INFO L273 TraceCheckUtils]: 8: Hoare triple {2215#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2219#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 17:36:09,465 INFO L273 TraceCheckUtils]: 9: Hoare triple {2219#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2223#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:36:09,465 INFO L273 TraceCheckUtils]: 10: Hoare triple {2223#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2227#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:36:09,466 INFO L273 TraceCheckUtils]: 11: Hoare triple {2227#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2231#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:36:09,466 INFO L273 TraceCheckUtils]: 12: Hoare triple {2231#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2235#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:36:09,467 INFO L273 TraceCheckUtils]: 13: Hoare triple {2235#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2239#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:36:09,468 INFO L273 TraceCheckUtils]: 14: Hoare triple {2239#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2243#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:36:09,469 INFO L273 TraceCheckUtils]: 15: Hoare triple {2243#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2247#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:36:09,470 INFO L273 TraceCheckUtils]: 16: Hoare triple {2247#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2251#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:36:09,471 INFO L273 TraceCheckUtils]: 17: Hoare triple {2251#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2255#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 17:36:09,473 INFO L273 TraceCheckUtils]: 18: Hoare triple {2255#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2259#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 17:36:09,474 INFO L273 TraceCheckUtils]: 19: Hoare triple {2259#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2263#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 17:36:09,475 INFO L273 TraceCheckUtils]: 20: Hoare triple {2263#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2267#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 17:36:09,476 INFO L273 TraceCheckUtils]: 21: Hoare triple {2267#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2271#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 17:36:09,477 INFO L273 TraceCheckUtils]: 22: Hoare triple {2271#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2275#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 17:36:09,481 INFO L273 TraceCheckUtils]: 23: Hoare triple {2275#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2279#(and (= main_~main__sum~0 136) (<= 16 main_~main__n~0) (<= main_~main__i~0 17))} is VALID [2018-11-14 17:36:09,484 INFO L273 TraceCheckUtils]: 24: Hoare triple {2279#(and (= main_~main__sum~0 136) (<= 16 main_~main__n~0) (<= main_~main__i~0 17))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2283#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:36:09,486 INFO L273 TraceCheckUtils]: 25: Hoare triple {2283#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {2190#false} is VALID [2018-11-14 17:36:09,486 INFO L273 TraceCheckUtils]: 26: Hoare triple {2190#false} assume !false; {2190#false} is VALID [2018-11-14 17:36:09,488 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:09,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:09,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-11-14 17:36:09,508 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 27 [2018-11-14 17:36:09,508 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:09,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-14 17:36:09,537 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:09,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-14 17:36:09,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-14 17:36:09,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-11-14 17:36:09,538 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 20 states. [2018-11-14 17:36:10,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:10,620 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-14 17:36:10,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-14 17:36:10,620 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 27 [2018-11-14 17:36:10,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:10,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 17:36:10,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 32 transitions. [2018-11-14 17:36:10,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 17:36:10,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 32 transitions. [2018-11-14 17:36:10,623 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 32 transitions. [2018-11-14 17:36:10,654 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:10,658 INFO L225 Difference]: With dead ends: 32 [2018-11-14 17:36:10,659 INFO L226 Difference]: Without dead ends: 29 [2018-11-14 17:36:10,659 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-11-14 17:36:10,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-14 17:36:10,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-14 17:36:10,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:10,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-14 17:36:10,692 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-14 17:36:10,692 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-14 17:36:10,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:10,694 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-14 17:36:10,694 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-14 17:36:10,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:10,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:10,695 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-14 17:36:10,695 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-14 17:36:10,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:10,695 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-14 17:36:10,696 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-14 17:36:10,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:10,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:10,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:10,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:10,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 17:36:10,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-11-14 17:36:10,697 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-11-14 17:36:10,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:10,697 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-11-14 17:36:10,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-14 17:36:10,697 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-14 17:36:10,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-14 17:36:10,698 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:10,698 INFO L375 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:10,698 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:10,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:10,698 INFO L82 PathProgramCache]: Analyzing trace with hash 613668102, now seen corresponding path program 12 times [2018-11-14 17:36:10,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:10,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:10,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:10,699 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:36:10,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:10,710 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:10,710 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:10,710 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:36:10,723 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 17:36:10,774 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-14 17:36:10,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:36:10,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:10,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:11,406 INFO L256 TraceCheckUtils]: 0: Hoare triple {2444#true} call ULTIMATE.init(); {2444#true} is VALID [2018-11-14 17:36:11,406 INFO L273 TraceCheckUtils]: 1: Hoare triple {2444#true} ~__return_main~0 := 0;~__return_96~0 := 0; {2444#true} is VALID [2018-11-14 17:36:11,407 INFO L273 TraceCheckUtils]: 2: Hoare triple {2444#true} assume true; {2444#true} is VALID [2018-11-14 17:36:11,407 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2444#true} {2444#true} #48#return; {2444#true} is VALID [2018-11-14 17:36:11,407 INFO L256 TraceCheckUtils]: 4: Hoare triple {2444#true} call #t~ret2 := main(); {2444#true} is VALID [2018-11-14 17:36:11,407 INFO L273 TraceCheckUtils]: 5: Hoare triple {2444#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {2444#true} is VALID [2018-11-14 17:36:11,408 INFO L273 TraceCheckUtils]: 6: Hoare triple {2444#true} assume !!(1 <= ~main__n~0); {2467#(<= 1 main_~main__n~0)} is VALID [2018-11-14 17:36:11,408 INFO L273 TraceCheckUtils]: 7: Hoare triple {2467#(<= 1 main_~main__n~0)} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {2471#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0) (<= 1 main_~main__n~0))} is VALID [2018-11-14 17:36:11,430 INFO L273 TraceCheckUtils]: 8: Hoare triple {2471#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2475#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0) (<= 1 main_~main__n~0))} is VALID [2018-11-14 17:36:11,439 INFO L273 TraceCheckUtils]: 9: Hoare triple {2475#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2479#(and (= main_~main__sum~0 3) (<= 1 main_~main__n~0) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:36:11,455 INFO L273 TraceCheckUtils]: 10: Hoare triple {2479#(and (= main_~main__sum~0 3) (<= 1 main_~main__n~0) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2483#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6) (<= 1 main_~main__n~0))} is VALID [2018-11-14 17:36:11,469 INFO L273 TraceCheckUtils]: 11: Hoare triple {2483#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2487#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10) (<= 1 main_~main__n~0))} is VALID [2018-11-14 17:36:11,478 INFO L273 TraceCheckUtils]: 12: Hoare triple {2487#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2491#(and (<= 1 main_~main__n~0) (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:36:11,481 INFO L273 TraceCheckUtils]: 13: Hoare triple {2491#(and (<= 1 main_~main__n~0) (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2495#(and (= main_~main__sum~0 21) (<= 1 main_~main__n~0) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:36:11,483 INFO L273 TraceCheckUtils]: 14: Hoare triple {2495#(and (= main_~main__sum~0 21) (<= 1 main_~main__n~0) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2499#(and (= 8 main_~main__i~0) (<= 1 main_~main__n~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:36:11,483 INFO L273 TraceCheckUtils]: 15: Hoare triple {2499#(and (= 8 main_~main__i~0) (<= 1 main_~main__n~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2503#(and (<= 1 main_~main__n~0) (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:36:11,485 INFO L273 TraceCheckUtils]: 16: Hoare triple {2503#(and (<= 1 main_~main__n~0) (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2507#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45) (<= 1 main_~main__n~0))} is VALID [2018-11-14 17:36:11,485 INFO L273 TraceCheckUtils]: 17: Hoare triple {2507#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2511#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0) (<= 1 main_~main__n~0))} is VALID [2018-11-14 17:36:11,487 INFO L273 TraceCheckUtils]: 18: Hoare triple {2511#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2515#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66) (<= 1 main_~main__n~0))} is VALID [2018-11-14 17:36:11,488 INFO L273 TraceCheckUtils]: 19: Hoare triple {2515#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2519#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78) (<= 1 main_~main__n~0))} is VALID [2018-11-14 17:36:11,489 INFO L273 TraceCheckUtils]: 20: Hoare triple {2519#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2523#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0) (<= 1 main_~main__n~0))} is VALID [2018-11-14 17:36:11,490 INFO L273 TraceCheckUtils]: 21: Hoare triple {2523#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2527#(and (= main_~main__sum~0 105) (<= 1 main_~main__n~0) (= 15 main_~main__i~0))} is VALID [2018-11-14 17:36:11,491 INFO L273 TraceCheckUtils]: 22: Hoare triple {2527#(and (= main_~main__sum~0 105) (<= 1 main_~main__n~0) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2531#(and (= main_~main__sum~0 120) (<= 1 main_~main__n~0) (= 16 main_~main__i~0))} is VALID [2018-11-14 17:36:11,492 INFO L273 TraceCheckUtils]: 23: Hoare triple {2531#(and (= main_~main__sum~0 120) (<= 1 main_~main__n~0) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2535#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0) (<= 1 main_~main__n~0))} is VALID [2018-11-14 17:36:11,493 INFO L273 TraceCheckUtils]: 24: Hoare triple {2535#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0) (<= 1 main_~main__n~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2539#(and (= main_~main__sum~0 153) (<= 17 main_~main__n~0) (= 18 main_~main__i~0))} is VALID [2018-11-14 17:36:11,494 INFO L273 TraceCheckUtils]: 25: Hoare triple {2539#(and (= main_~main__sum~0 153) (<= 17 main_~main__n~0) (= 18 main_~main__i~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2543#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:36:11,495 INFO L273 TraceCheckUtils]: 26: Hoare triple {2543#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {2445#false} is VALID [2018-11-14 17:36:11,495 INFO L273 TraceCheckUtils]: 27: Hoare triple {2445#false} assume !false; {2445#false} is VALID [2018-11-14 17:36:11,498 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:11,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:11,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-11-14 17:36:11,527 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2018-11-14 17:36:11,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:11,528 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-14 17:36:11,562 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:11,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-14 17:36:11,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-14 17:36:11,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2018-11-14 17:36:11,563 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 22 states. [2018-11-14 17:36:12,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:12,678 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-14 17:36:12,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-14 17:36:12,679 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2018-11-14 17:36:12,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:12,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 17:36:12,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 33 transitions. [2018-11-14 17:36:12,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 17:36:12,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 33 transitions. [2018-11-14 17:36:12,682 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 33 transitions. [2018-11-14 17:36:12,721 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:12,722 INFO L225 Difference]: With dead ends: 33 [2018-11-14 17:36:12,722 INFO L226 Difference]: Without dead ends: 30 [2018-11-14 17:36:12,723 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2018-11-14 17:36:12,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-14 17:36:12,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-14 17:36:12,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:12,765 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2018-11-14 17:36:12,765 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-14 17:36:12,765 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-14 17:36:12,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:12,767 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-14 17:36:12,767 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-14 17:36:12,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:12,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:12,767 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-14 17:36:12,768 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-14 17:36:12,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:12,768 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-14 17:36:12,769 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-14 17:36:12,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:12,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:12,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:12,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:12,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 17:36:12,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-11-14 17:36:12,770 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-11-14 17:36:12,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:12,770 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-11-14 17:36:12,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-14 17:36:12,770 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-14 17:36:12,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 17:36:12,771 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:12,771 INFO L375 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:12,771 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:12,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:12,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1843779520, now seen corresponding path program 13 times [2018-11-14 17:36:12,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:12,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:12,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:12,773 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:36:12,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:12,784 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:12,784 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:12,784 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:36:12,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:36:12,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:12,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:12,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:13,573 INFO L256 TraceCheckUtils]: 0: Hoare triple {2710#true} call ULTIMATE.init(); {2710#true} is VALID [2018-11-14 17:36:13,574 INFO L273 TraceCheckUtils]: 1: Hoare triple {2710#true} ~__return_main~0 := 0;~__return_96~0 := 0; {2710#true} is VALID [2018-11-14 17:36:13,574 INFO L273 TraceCheckUtils]: 2: Hoare triple {2710#true} assume true; {2710#true} is VALID [2018-11-14 17:36:13,574 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2710#true} {2710#true} #48#return; {2710#true} is VALID [2018-11-14 17:36:13,575 INFO L256 TraceCheckUtils]: 4: Hoare triple {2710#true} call #t~ret2 := main(); {2710#true} is VALID [2018-11-14 17:36:13,575 INFO L273 TraceCheckUtils]: 5: Hoare triple {2710#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {2710#true} is VALID [2018-11-14 17:36:13,575 INFO L273 TraceCheckUtils]: 6: Hoare triple {2710#true} assume !!(1 <= ~main__n~0); {2710#true} is VALID [2018-11-14 17:36:13,575 INFO L273 TraceCheckUtils]: 7: Hoare triple {2710#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {2736#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:36:13,576 INFO L273 TraceCheckUtils]: 8: Hoare triple {2736#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2740#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 17:36:13,577 INFO L273 TraceCheckUtils]: 9: Hoare triple {2740#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2744#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:36:13,577 INFO L273 TraceCheckUtils]: 10: Hoare triple {2744#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2748#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:36:13,578 INFO L273 TraceCheckUtils]: 11: Hoare triple {2748#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2752#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:36:13,581 INFO L273 TraceCheckUtils]: 12: Hoare triple {2752#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2756#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:36:13,582 INFO L273 TraceCheckUtils]: 13: Hoare triple {2756#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2760#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:36:13,582 INFO L273 TraceCheckUtils]: 14: Hoare triple {2760#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2764#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:36:13,583 INFO L273 TraceCheckUtils]: 15: Hoare triple {2764#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2768#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:36:13,584 INFO L273 TraceCheckUtils]: 16: Hoare triple {2768#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2772#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:36:13,584 INFO L273 TraceCheckUtils]: 17: Hoare triple {2772#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2776#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 17:36:13,585 INFO L273 TraceCheckUtils]: 18: Hoare triple {2776#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2780#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 17:36:13,586 INFO L273 TraceCheckUtils]: 19: Hoare triple {2780#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2784#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 17:36:13,587 INFO L273 TraceCheckUtils]: 20: Hoare triple {2784#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2788#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 17:36:13,589 INFO L273 TraceCheckUtils]: 21: Hoare triple {2788#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2792#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 17:36:13,590 INFO L273 TraceCheckUtils]: 22: Hoare triple {2792#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2796#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 17:36:13,591 INFO L273 TraceCheckUtils]: 23: Hoare triple {2796#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2800#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 17:36:13,592 INFO L273 TraceCheckUtils]: 24: Hoare triple {2800#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2804#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 17:36:13,592 INFO L273 TraceCheckUtils]: 25: Hoare triple {2804#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {2808#(and (<= main_~main__i~0 19) (<= 18 main_~main__n~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 17:36:13,593 INFO L273 TraceCheckUtils]: 26: Hoare triple {2808#(and (<= main_~main__i~0 19) (<= 18 main_~main__n~0) (= main_~main__sum~0 171))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2812#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:36:13,594 INFO L273 TraceCheckUtils]: 27: Hoare triple {2812#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {2711#false} is VALID [2018-11-14 17:36:13,594 INFO L273 TraceCheckUtils]: 28: Hoare triple {2711#false} assume !false; {2711#false} is VALID [2018-11-14 17:36:13,597 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:13,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:13,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-11-14 17:36:13,618 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 29 [2018-11-14 17:36:13,618 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:13,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-14 17:36:13,651 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:13,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-14 17:36:13,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-14 17:36:13,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-11-14 17:36:13,652 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 22 states. [2018-11-14 17:36:15,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:15,503 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-14 17:36:15,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-14 17:36:15,503 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 29 [2018-11-14 17:36:15,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:15,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 17:36:15,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 34 transitions. [2018-11-14 17:36:15,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 17:36:15,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 34 transitions. [2018-11-14 17:36:15,506 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 34 transitions. [2018-11-14 17:36:15,538 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:15,539 INFO L225 Difference]: With dead ends: 34 [2018-11-14 17:36:15,539 INFO L226 Difference]: Without dead ends: 31 [2018-11-14 17:36:15,540 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2018-11-14 17:36:15,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-14 17:36:15,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-14 17:36:15,580 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:15,580 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-14 17:36:15,580 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-14 17:36:15,580 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-14 17:36:15,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:15,582 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-14 17:36:15,582 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-14 17:36:15,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:15,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:15,582 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-14 17:36:15,582 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-14 17:36:15,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:15,583 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-14 17:36:15,583 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-14 17:36:15,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:15,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:15,584 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:15,584 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:15,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 17:36:15,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-11-14 17:36:15,585 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-11-14 17:36:15,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:15,585 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-11-14 17:36:15,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-14 17:36:15,585 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-14 17:36:15,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 17:36:15,586 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:15,586 INFO L375 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:15,586 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:15,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:15,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1322527814, now seen corresponding path program 14 times [2018-11-14 17:36:15,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:15,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:15,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:15,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:36:15,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:15,599 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:15,599 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:15,599 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:36:15,622 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:36:15,650 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:36:15,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:36:15,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:15,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:16,165 INFO L256 TraceCheckUtils]: 0: Hoare triple {2985#true} call ULTIMATE.init(); {2985#true} is VALID [2018-11-14 17:36:16,165 INFO L273 TraceCheckUtils]: 1: Hoare triple {2985#true} ~__return_main~0 := 0;~__return_96~0 := 0; {2985#true} is VALID [2018-11-14 17:36:16,165 INFO L273 TraceCheckUtils]: 2: Hoare triple {2985#true} assume true; {2985#true} is VALID [2018-11-14 17:36:16,166 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2985#true} {2985#true} #48#return; {2985#true} is VALID [2018-11-14 17:36:16,166 INFO L256 TraceCheckUtils]: 4: Hoare triple {2985#true} call #t~ret2 := main(); {2985#true} is VALID [2018-11-14 17:36:16,166 INFO L273 TraceCheckUtils]: 5: Hoare triple {2985#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {2985#true} is VALID [2018-11-14 17:36:16,166 INFO L273 TraceCheckUtils]: 6: Hoare triple {2985#true} assume !!(1 <= ~main__n~0); {2985#true} is VALID [2018-11-14 17:36:16,173 INFO L273 TraceCheckUtils]: 7: Hoare triple {2985#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {3011#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:36:16,174 INFO L273 TraceCheckUtils]: 8: Hoare triple {3011#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3015#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-14 17:36:16,175 INFO L273 TraceCheckUtils]: 9: Hoare triple {3015#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3019#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:36:16,175 INFO L273 TraceCheckUtils]: 10: Hoare triple {3019#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3023#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:36:16,176 INFO L273 TraceCheckUtils]: 11: Hoare triple {3023#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3027#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:36:16,176 INFO L273 TraceCheckUtils]: 12: Hoare triple {3027#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3031#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:36:16,177 INFO L273 TraceCheckUtils]: 13: Hoare triple {3031#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3035#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:36:16,178 INFO L273 TraceCheckUtils]: 14: Hoare triple {3035#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3039#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:36:16,178 INFO L273 TraceCheckUtils]: 15: Hoare triple {3039#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3043#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:36:16,179 INFO L273 TraceCheckUtils]: 16: Hoare triple {3043#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3047#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:36:16,180 INFO L273 TraceCheckUtils]: 17: Hoare triple {3047#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3051#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 17:36:16,181 INFO L273 TraceCheckUtils]: 18: Hoare triple {3051#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3055#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 17:36:16,182 INFO L273 TraceCheckUtils]: 19: Hoare triple {3055#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3059#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 17:36:16,183 INFO L273 TraceCheckUtils]: 20: Hoare triple {3059#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3063#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 17:36:16,189 INFO L273 TraceCheckUtils]: 21: Hoare triple {3063#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3067#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 17:36:16,189 INFO L273 TraceCheckUtils]: 22: Hoare triple {3067#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3071#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 17:36:16,190 INFO L273 TraceCheckUtils]: 23: Hoare triple {3071#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3075#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 17:36:16,191 INFO L273 TraceCheckUtils]: 24: Hoare triple {3075#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3079#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 17:36:16,191 INFO L273 TraceCheckUtils]: 25: Hoare triple {3079#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3083#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 17:36:16,192 INFO L273 TraceCheckUtils]: 26: Hoare triple {3083#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3087#(and (<= main_~main__i~0 20) (= main_~main__sum~0 190) (<= 19 main_~main__n~0))} is VALID [2018-11-14 17:36:16,193 INFO L273 TraceCheckUtils]: 27: Hoare triple {3087#(and (<= main_~main__i~0 20) (= main_~main__sum~0 190) (<= 19 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3091#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:36:16,193 INFO L273 TraceCheckUtils]: 28: Hoare triple {3091#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {2986#false} is VALID [2018-11-14 17:36:16,194 INFO L273 TraceCheckUtils]: 29: Hoare triple {2986#false} assume !false; {2986#false} is VALID [2018-11-14 17:36:16,196 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:16,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:16,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-11-14 17:36:16,217 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2018-11-14 17:36:16,218 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:16,218 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-14 17:36:16,249 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:16,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-14 17:36:16,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-14 17:36:16,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-11-14 17:36:16,250 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 23 states. [2018-11-14 17:36:17,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:17,965 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-14 17:36:17,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-14 17:36:17,965 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2018-11-14 17:36:17,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:17,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 17:36:17,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2018-11-14 17:36:17,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 17:36:17,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2018-11-14 17:36:17,968 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 35 transitions. [2018-11-14 17:36:18,050 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:18,051 INFO L225 Difference]: With dead ends: 35 [2018-11-14 17:36:18,052 INFO L226 Difference]: Without dead ends: 32 [2018-11-14 17:36:18,053 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2018-11-14 17:36:18,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-14 17:36:18,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-14 17:36:18,097 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:18,097 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2018-11-14 17:36:18,097 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-14 17:36:18,097 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-14 17:36:18,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:18,098 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-14 17:36:18,099 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-14 17:36:18,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:18,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:18,099 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-14 17:36:18,099 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-14 17:36:18,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:18,100 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-14 17:36:18,100 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-14 17:36:18,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:18,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:18,100 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:18,100 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:18,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 17:36:18,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-11-14 17:36:18,101 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-11-14 17:36:18,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:18,101 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-11-14 17:36:18,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-14 17:36:18,102 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-14 17:36:18,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 17:36:18,102 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:18,102 INFO L375 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:18,102 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:18,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:18,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1951373184, now seen corresponding path program 15 times [2018-11-14 17:36:18,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:18,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:18,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:18,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:36:18,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:18,116 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:18,116 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:18,116 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:36:18,133 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:36:18,253 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-14 17:36:18,253 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:36:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:18,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:18,731 INFO L256 TraceCheckUtils]: 0: Hoare triple {3270#true} call ULTIMATE.init(); {3270#true} is VALID [2018-11-14 17:36:18,731 INFO L273 TraceCheckUtils]: 1: Hoare triple {3270#true} ~__return_main~0 := 0;~__return_96~0 := 0; {3270#true} is VALID [2018-11-14 17:36:18,732 INFO L273 TraceCheckUtils]: 2: Hoare triple {3270#true} assume true; {3270#true} is VALID [2018-11-14 17:36:18,732 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3270#true} {3270#true} #48#return; {3270#true} is VALID [2018-11-14 17:36:18,732 INFO L256 TraceCheckUtils]: 4: Hoare triple {3270#true} call #t~ret2 := main(); {3270#true} is VALID [2018-11-14 17:36:18,732 INFO L273 TraceCheckUtils]: 5: Hoare triple {3270#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {3270#true} is VALID [2018-11-14 17:36:18,733 INFO L273 TraceCheckUtils]: 6: Hoare triple {3270#true} assume !!(1 <= ~main__n~0); {3270#true} is VALID [2018-11-14 17:36:18,733 INFO L273 TraceCheckUtils]: 7: Hoare triple {3270#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {3296#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:36:18,734 INFO L273 TraceCheckUtils]: 8: Hoare triple {3296#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3300#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 17:36:18,734 INFO L273 TraceCheckUtils]: 9: Hoare triple {3300#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3304#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:36:18,735 INFO L273 TraceCheckUtils]: 10: Hoare triple {3304#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3308#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:36:18,735 INFO L273 TraceCheckUtils]: 11: Hoare triple {3308#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3312#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:36:18,736 INFO L273 TraceCheckUtils]: 12: Hoare triple {3312#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3316#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:36:18,745 INFO L273 TraceCheckUtils]: 13: Hoare triple {3316#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3320#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:36:18,746 INFO L273 TraceCheckUtils]: 14: Hoare triple {3320#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3324#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:36:18,747 INFO L273 TraceCheckUtils]: 15: Hoare triple {3324#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3328#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:36:18,747 INFO L273 TraceCheckUtils]: 16: Hoare triple {3328#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3332#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:36:18,748 INFO L273 TraceCheckUtils]: 17: Hoare triple {3332#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3336#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 17:36:18,749 INFO L273 TraceCheckUtils]: 18: Hoare triple {3336#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3340#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 17:36:18,750 INFO L273 TraceCheckUtils]: 19: Hoare triple {3340#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3344#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 17:36:18,751 INFO L273 TraceCheckUtils]: 20: Hoare triple {3344#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3348#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 17:36:18,751 INFO L273 TraceCheckUtils]: 21: Hoare triple {3348#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3352#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 17:36:18,752 INFO L273 TraceCheckUtils]: 22: Hoare triple {3352#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3356#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 17:36:18,753 INFO L273 TraceCheckUtils]: 23: Hoare triple {3356#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3360#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 17:36:18,754 INFO L273 TraceCheckUtils]: 24: Hoare triple {3360#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3364#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 17:36:18,755 INFO L273 TraceCheckUtils]: 25: Hoare triple {3364#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3368#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 17:36:18,756 INFO L273 TraceCheckUtils]: 26: Hoare triple {3368#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3372#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-14 17:36:18,757 INFO L273 TraceCheckUtils]: 27: Hoare triple {3372#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3376#(and (<= 20 main_~main__n~0) (<= main_~main__i~0 21) (= main_~main__sum~0 210))} is VALID [2018-11-14 17:36:18,758 INFO L273 TraceCheckUtils]: 28: Hoare triple {3376#(and (<= 20 main_~main__n~0) (<= main_~main__i~0 21) (= main_~main__sum~0 210))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3380#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:36:18,759 INFO L273 TraceCheckUtils]: 29: Hoare triple {3380#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {3271#false} is VALID [2018-11-14 17:36:18,759 INFO L273 TraceCheckUtils]: 30: Hoare triple {3271#false} assume !false; {3271#false} is VALID [2018-11-14 17:36:18,761 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:18,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:18,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-11-14 17:36:18,782 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 31 [2018-11-14 17:36:18,782 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:18,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-14 17:36:18,814 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:18,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-14 17:36:18,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-14 17:36:18,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-11-14 17:36:18,815 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 24 states. [2018-11-14 17:36:20,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:20,458 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-14 17:36:20,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-14 17:36:20,458 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 31 [2018-11-14 17:36:20,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:20,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 17:36:20,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 36 transitions. [2018-11-14 17:36:20,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 17:36:20,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 36 transitions. [2018-11-14 17:36:20,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 36 transitions. [2018-11-14 17:36:20,504 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:20,505 INFO L225 Difference]: With dead ends: 36 [2018-11-14 17:36:20,505 INFO L226 Difference]: Without dead ends: 33 [2018-11-14 17:36:20,506 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2018-11-14 17:36:20,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-14 17:36:20,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-14 17:36:20,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:20,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2018-11-14 17:36:20,570 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-14 17:36:20,570 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-14 17:36:20,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:20,571 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-14 17:36:20,572 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-14 17:36:20,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:20,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:20,572 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-14 17:36:20,572 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-14 17:36:20,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:20,573 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-14 17:36:20,573 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-14 17:36:20,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:20,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:20,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:20,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:20,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 17:36:20,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-11-14 17:36:20,575 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-11-14 17:36:20,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:20,575 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-11-14 17:36:20,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-14 17:36:20,576 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-14 17:36:20,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 17:36:20,576 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:20,576 INFO L375 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:20,576 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:20,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:20,577 INFO L82 PathProgramCache]: Analyzing trace with hash -363089018, now seen corresponding path program 16 times [2018-11-14 17:36:20,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:20,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:20,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:20,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:36:20,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:20,588 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:20,588 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:20,588 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:36:20,607 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:36:20,782 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:36:20,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:36:20,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:20,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:21,355 INFO L256 TraceCheckUtils]: 0: Hoare triple {3565#true} call ULTIMATE.init(); {3565#true} is VALID [2018-11-14 17:36:21,355 INFO L273 TraceCheckUtils]: 1: Hoare triple {3565#true} ~__return_main~0 := 0;~__return_96~0 := 0; {3565#true} is VALID [2018-11-14 17:36:21,356 INFO L273 TraceCheckUtils]: 2: Hoare triple {3565#true} assume true; {3565#true} is VALID [2018-11-14 17:36:21,356 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3565#true} {3565#true} #48#return; {3565#true} is VALID [2018-11-14 17:36:21,356 INFO L256 TraceCheckUtils]: 4: Hoare triple {3565#true} call #t~ret2 := main(); {3565#true} is VALID [2018-11-14 17:36:21,356 INFO L273 TraceCheckUtils]: 5: Hoare triple {3565#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {3565#true} is VALID [2018-11-14 17:36:21,357 INFO L273 TraceCheckUtils]: 6: Hoare triple {3565#true} assume !!(1 <= ~main__n~0); {3565#true} is VALID [2018-11-14 17:36:21,358 INFO L273 TraceCheckUtils]: 7: Hoare triple {3565#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {3591#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:36:21,361 INFO L273 TraceCheckUtils]: 8: Hoare triple {3591#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3595#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 17:36:21,361 INFO L273 TraceCheckUtils]: 9: Hoare triple {3595#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3599#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:36:21,362 INFO L273 TraceCheckUtils]: 10: Hoare triple {3599#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3603#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:36:21,363 INFO L273 TraceCheckUtils]: 11: Hoare triple {3603#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3607#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:36:21,363 INFO L273 TraceCheckUtils]: 12: Hoare triple {3607#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3611#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:36:21,364 INFO L273 TraceCheckUtils]: 13: Hoare triple {3611#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3615#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:36:21,365 INFO L273 TraceCheckUtils]: 14: Hoare triple {3615#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3619#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:36:21,366 INFO L273 TraceCheckUtils]: 15: Hoare triple {3619#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3623#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:36:21,367 INFO L273 TraceCheckUtils]: 16: Hoare triple {3623#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3627#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:36:21,368 INFO L273 TraceCheckUtils]: 17: Hoare triple {3627#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3631#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 17:36:21,369 INFO L273 TraceCheckUtils]: 18: Hoare triple {3631#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3635#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 17:36:21,370 INFO L273 TraceCheckUtils]: 19: Hoare triple {3635#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3639#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 17:36:21,371 INFO L273 TraceCheckUtils]: 20: Hoare triple {3639#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3643#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 17:36:21,372 INFO L273 TraceCheckUtils]: 21: Hoare triple {3643#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3647#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 17:36:21,373 INFO L273 TraceCheckUtils]: 22: Hoare triple {3647#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3651#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 17:36:21,374 INFO L273 TraceCheckUtils]: 23: Hoare triple {3651#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3655#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 17:36:21,375 INFO L273 TraceCheckUtils]: 24: Hoare triple {3655#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3659#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 17:36:21,376 INFO L273 TraceCheckUtils]: 25: Hoare triple {3659#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3663#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 17:36:21,377 INFO L273 TraceCheckUtils]: 26: Hoare triple {3663#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3667#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-14 17:36:21,377 INFO L273 TraceCheckUtils]: 27: Hoare triple {3667#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3671#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-14 17:36:21,378 INFO L273 TraceCheckUtils]: 28: Hoare triple {3671#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3675#(and (<= 21 main_~main__n~0) (= main_~main__sum~0 231) (<= main_~main__i~0 22))} is VALID [2018-11-14 17:36:21,380 INFO L273 TraceCheckUtils]: 29: Hoare triple {3675#(and (<= 21 main_~main__n~0) (= main_~main__sum~0 231) (<= main_~main__i~0 22))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3679#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:36:21,380 INFO L273 TraceCheckUtils]: 30: Hoare triple {3679#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {3566#false} is VALID [2018-11-14 17:36:21,381 INFO L273 TraceCheckUtils]: 31: Hoare triple {3566#false} assume !false; {3566#false} is VALID [2018-11-14 17:36:21,383 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:21,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:21,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-11-14 17:36:21,403 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 32 [2018-11-14 17:36:21,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:21,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-14 17:36:21,437 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:21,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-14 17:36:21,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-14 17:36:21,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-11-14 17:36:21,439 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 25 states. [2018-11-14 17:36:23,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:23,083 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-11-14 17:36:23,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-14 17:36:23,084 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 32 [2018-11-14 17:36:23,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:23,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 17:36:23,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 37 transitions. [2018-11-14 17:36:23,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 17:36:23,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 37 transitions. [2018-11-14 17:36:23,087 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 37 transitions. [2018-11-14 17:36:23,128 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:23,129 INFO L225 Difference]: With dead ends: 37 [2018-11-14 17:36:23,129 INFO L226 Difference]: Without dead ends: 34 [2018-11-14 17:36:23,130 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2018-11-14 17:36:23,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-14 17:36:23,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-14 17:36:23,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:23,174 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 34 states. [2018-11-14 17:36:23,174 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-14 17:36:23,174 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-14 17:36:23,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:23,175 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-14 17:36:23,176 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-14 17:36:23,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:23,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:23,176 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-14 17:36:23,176 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-14 17:36:23,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:23,177 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-14 17:36:23,177 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-14 17:36:23,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:23,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:23,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:23,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:23,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 17:36:23,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-11-14 17:36:23,179 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-11-14 17:36:23,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:23,179 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-11-14 17:36:23,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-14 17:36:23,179 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-14 17:36:23,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-14 17:36:23,180 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:23,180 INFO L375 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:23,180 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:23,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:23,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1629079872, now seen corresponding path program 17 times [2018-11-14 17:36:23,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:23,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:23,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:23,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:36:23,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:23,191 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:23,191 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:23,191 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:36:23,206 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 17:36:23,240 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-11-14 17:36:23,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:36:23,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:23,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:23,776 INFO L256 TraceCheckUtils]: 0: Hoare triple {3870#true} call ULTIMATE.init(); {3870#true} is VALID [2018-11-14 17:36:23,776 INFO L273 TraceCheckUtils]: 1: Hoare triple {3870#true} ~__return_main~0 := 0;~__return_96~0 := 0; {3870#true} is VALID [2018-11-14 17:36:23,776 INFO L273 TraceCheckUtils]: 2: Hoare triple {3870#true} assume true; {3870#true} is VALID [2018-11-14 17:36:23,777 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3870#true} {3870#true} #48#return; {3870#true} is VALID [2018-11-14 17:36:23,777 INFO L256 TraceCheckUtils]: 4: Hoare triple {3870#true} call #t~ret2 := main(); {3870#true} is VALID [2018-11-14 17:36:23,777 INFO L273 TraceCheckUtils]: 5: Hoare triple {3870#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {3870#true} is VALID [2018-11-14 17:36:23,777 INFO L273 TraceCheckUtils]: 6: Hoare triple {3870#true} assume !!(1 <= ~main__n~0); {3870#true} is VALID [2018-11-14 17:36:23,778 INFO L273 TraceCheckUtils]: 7: Hoare triple {3870#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {3896#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:36:23,778 INFO L273 TraceCheckUtils]: 8: Hoare triple {3896#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3900#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 17:36:23,779 INFO L273 TraceCheckUtils]: 9: Hoare triple {3900#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3904#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:36:23,780 INFO L273 TraceCheckUtils]: 10: Hoare triple {3904#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3908#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:36:23,780 INFO L273 TraceCheckUtils]: 11: Hoare triple {3908#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3912#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:36:23,781 INFO L273 TraceCheckUtils]: 12: Hoare triple {3912#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3916#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:36:23,782 INFO L273 TraceCheckUtils]: 13: Hoare triple {3916#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3920#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:36:23,783 INFO L273 TraceCheckUtils]: 14: Hoare triple {3920#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3924#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:36:23,784 INFO L273 TraceCheckUtils]: 15: Hoare triple {3924#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3928#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:36:23,785 INFO L273 TraceCheckUtils]: 16: Hoare triple {3928#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3932#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:36:23,786 INFO L273 TraceCheckUtils]: 17: Hoare triple {3932#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3936#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 17:36:23,787 INFO L273 TraceCheckUtils]: 18: Hoare triple {3936#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3940#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 17:36:23,788 INFO L273 TraceCheckUtils]: 19: Hoare triple {3940#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3944#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 17:36:23,789 INFO L273 TraceCheckUtils]: 20: Hoare triple {3944#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3948#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 17:36:23,790 INFO L273 TraceCheckUtils]: 21: Hoare triple {3948#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3952#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 17:36:23,791 INFO L273 TraceCheckUtils]: 22: Hoare triple {3952#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3956#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 17:36:23,792 INFO L273 TraceCheckUtils]: 23: Hoare triple {3956#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3960#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 17:36:23,793 INFO L273 TraceCheckUtils]: 24: Hoare triple {3960#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3964#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 17:36:23,794 INFO L273 TraceCheckUtils]: 25: Hoare triple {3964#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3968#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 17:36:23,795 INFO L273 TraceCheckUtils]: 26: Hoare triple {3968#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3972#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-14 17:36:23,795 INFO L273 TraceCheckUtils]: 27: Hoare triple {3972#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3976#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-14 17:36:23,796 INFO L273 TraceCheckUtils]: 28: Hoare triple {3976#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3980#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-14 17:36:23,797 INFO L273 TraceCheckUtils]: 29: Hoare triple {3980#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {3984#(and (<= 22 main_~main__n~0) (<= main_~main__i~0 23) (= main_~main__sum~0 253))} is VALID [2018-11-14 17:36:23,799 INFO L273 TraceCheckUtils]: 30: Hoare triple {3984#(and (<= 22 main_~main__n~0) (<= main_~main__i~0 23) (= main_~main__sum~0 253))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3988#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:36:23,799 INFO L273 TraceCheckUtils]: 31: Hoare triple {3988#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {3871#false} is VALID [2018-11-14 17:36:23,800 INFO L273 TraceCheckUtils]: 32: Hoare triple {3871#false} assume !false; {3871#false} is VALID [2018-11-14 17:36:23,802 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:23,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:23,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-11-14 17:36:23,827 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 33 [2018-11-14 17:36:23,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:23,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-14 17:36:23,864 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:23,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-14 17:36:23,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-14 17:36:23,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-11-14 17:36:23,865 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 26 states. [2018-11-14 17:36:25,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:25,576 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-11-14 17:36:25,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-14 17:36:25,577 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 33 [2018-11-14 17:36:25,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:25,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 17:36:25,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2018-11-14 17:36:25,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 17:36:25,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2018-11-14 17:36:25,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 38 transitions. [2018-11-14 17:36:25,988 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:25,989 INFO L225 Difference]: With dead ends: 38 [2018-11-14 17:36:25,989 INFO L226 Difference]: Without dead ends: 35 [2018-11-14 17:36:25,990 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2018-11-14 17:36:25,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-14 17:36:26,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-14 17:36:26,044 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:26,044 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2018-11-14 17:36:26,044 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-14 17:36:26,044 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-14 17:36:26,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:26,045 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-14 17:36:26,045 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-11-14 17:36:26,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:26,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:26,046 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-14 17:36:26,046 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-14 17:36:26,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:26,046 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-14 17:36:26,047 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-11-14 17:36:26,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:26,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:26,047 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:26,047 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:26,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 17:36:26,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-11-14 17:36:26,048 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-11-14 17:36:26,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:26,048 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-11-14 17:36:26,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-14 17:36:26,048 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-11-14 17:36:26,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-14 17:36:26,049 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:26,049 INFO L375 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:26,049 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:26,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:26,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1038193978, now seen corresponding path program 18 times [2018-11-14 17:36:26,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:26,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:26,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:26,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:36:26,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:26,059 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:26,060 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:26,060 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:36:26,086 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 17:36:26,166 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-11-14 17:36:26,166 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:36:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:26,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:27,094 INFO L256 TraceCheckUtils]: 0: Hoare triple {4185#true} call ULTIMATE.init(); {4185#true} is VALID [2018-11-14 17:36:27,095 INFO L273 TraceCheckUtils]: 1: Hoare triple {4185#true} ~__return_main~0 := 0;~__return_96~0 := 0; {4185#true} is VALID [2018-11-14 17:36:27,095 INFO L273 TraceCheckUtils]: 2: Hoare triple {4185#true} assume true; {4185#true} is VALID [2018-11-14 17:36:27,095 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4185#true} {4185#true} #48#return; {4185#true} is VALID [2018-11-14 17:36:27,095 INFO L256 TraceCheckUtils]: 4: Hoare triple {4185#true} call #t~ret2 := main(); {4185#true} is VALID [2018-11-14 17:36:27,096 INFO L273 TraceCheckUtils]: 5: Hoare triple {4185#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {4185#true} is VALID [2018-11-14 17:36:27,096 INFO L273 TraceCheckUtils]: 6: Hoare triple {4185#true} assume !!(1 <= ~main__n~0); {4185#true} is VALID [2018-11-14 17:36:27,097 INFO L273 TraceCheckUtils]: 7: Hoare triple {4185#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {4211#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:36:27,097 INFO L273 TraceCheckUtils]: 8: Hoare triple {4211#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4215#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 17:36:27,098 INFO L273 TraceCheckUtils]: 9: Hoare triple {4215#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4219#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:36:27,098 INFO L273 TraceCheckUtils]: 10: Hoare triple {4219#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4223#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:36:27,099 INFO L273 TraceCheckUtils]: 11: Hoare triple {4223#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4227#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:36:27,100 INFO L273 TraceCheckUtils]: 12: Hoare triple {4227#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4231#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:36:27,101 INFO L273 TraceCheckUtils]: 13: Hoare triple {4231#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4235#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:36:27,102 INFO L273 TraceCheckUtils]: 14: Hoare triple {4235#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4239#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:36:27,103 INFO L273 TraceCheckUtils]: 15: Hoare triple {4239#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4243#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:36:27,104 INFO L273 TraceCheckUtils]: 16: Hoare triple {4243#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4247#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:36:27,105 INFO L273 TraceCheckUtils]: 17: Hoare triple {4247#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4251#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 17:36:27,106 INFO L273 TraceCheckUtils]: 18: Hoare triple {4251#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4255#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 17:36:27,107 INFO L273 TraceCheckUtils]: 19: Hoare triple {4255#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4259#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 17:36:27,108 INFO L273 TraceCheckUtils]: 20: Hoare triple {4259#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4263#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 17:36:27,109 INFO L273 TraceCheckUtils]: 21: Hoare triple {4263#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4267#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 17:36:27,109 INFO L273 TraceCheckUtils]: 22: Hoare triple {4267#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4271#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 17:36:27,110 INFO L273 TraceCheckUtils]: 23: Hoare triple {4271#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4275#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 17:36:27,111 INFO L273 TraceCheckUtils]: 24: Hoare triple {4275#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4279#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 17:36:27,112 INFO L273 TraceCheckUtils]: 25: Hoare triple {4279#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4283#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 17:36:27,113 INFO L273 TraceCheckUtils]: 26: Hoare triple {4283#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4287#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-14 17:36:27,114 INFO L273 TraceCheckUtils]: 27: Hoare triple {4287#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4291#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-14 17:36:27,115 INFO L273 TraceCheckUtils]: 28: Hoare triple {4291#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4295#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-14 17:36:27,116 INFO L273 TraceCheckUtils]: 29: Hoare triple {4295#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4299#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-14 17:36:27,117 INFO L273 TraceCheckUtils]: 30: Hoare triple {4299#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4303#(and (<= main_~main__i~0 24) (= main_~main__sum~0 276) (<= 23 main_~main__n~0))} is VALID [2018-11-14 17:36:27,118 INFO L273 TraceCheckUtils]: 31: Hoare triple {4303#(and (<= main_~main__i~0 24) (= main_~main__sum~0 276) (<= 23 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4307#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:36:27,119 INFO L273 TraceCheckUtils]: 32: Hoare triple {4307#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {4186#false} is VALID [2018-11-14 17:36:27,119 INFO L273 TraceCheckUtils]: 33: Hoare triple {4186#false} assume !false; {4186#false} is VALID [2018-11-14 17:36:27,122 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:27,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:27,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-11-14 17:36:27,142 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 34 [2018-11-14 17:36:27,143 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:27,143 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-14 17:36:27,177 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:27,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-14 17:36:27,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-14 17:36:27,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-11-14 17:36:27,178 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 27 states. [2018-11-14 17:36:28,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:28,863 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-14 17:36:28,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-14 17:36:28,864 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 34 [2018-11-14 17:36:28,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:28,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 17:36:28,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. [2018-11-14 17:36:28,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 17:36:28,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. [2018-11-14 17:36:28,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 39 transitions. [2018-11-14 17:36:29,358 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:29,358 INFO L225 Difference]: With dead ends: 39 [2018-11-14 17:36:29,359 INFO L226 Difference]: Without dead ends: 36 [2018-11-14 17:36:29,359 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2018-11-14 17:36:29,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-14 17:36:29,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-14 17:36:29,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:29,473 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2018-11-14 17:36:29,474 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-14 17:36:29,474 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-14 17:36:29,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:29,475 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-14 17:36:29,476 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-14 17:36:29,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:29,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:29,476 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-14 17:36:29,476 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-14 17:36:29,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:29,477 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-14 17:36:29,477 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-14 17:36:29,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:29,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:29,478 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:29,478 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:29,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 17:36:29,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-11-14 17:36:29,479 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-11-14 17:36:29,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:29,479 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-11-14 17:36:29,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-14 17:36:29,479 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-14 17:36:29,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-14 17:36:29,480 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:29,480 INFO L375 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:29,480 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:29,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:29,480 INFO L82 PathProgramCache]: Analyzing trace with hash -2119304704, now seen corresponding path program 19 times [2018-11-14 17:36:29,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:29,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:29,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:29,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:36:29,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:29,490 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:29,490 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:29,491 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:36:29,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:36:29,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:29,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:29,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:30,285 INFO L256 TraceCheckUtils]: 0: Hoare triple {4510#true} call ULTIMATE.init(); {4510#true} is VALID [2018-11-14 17:36:30,286 INFO L273 TraceCheckUtils]: 1: Hoare triple {4510#true} ~__return_main~0 := 0;~__return_96~0 := 0; {4510#true} is VALID [2018-11-14 17:36:30,286 INFO L273 TraceCheckUtils]: 2: Hoare triple {4510#true} assume true; {4510#true} is VALID [2018-11-14 17:36:30,286 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4510#true} {4510#true} #48#return; {4510#true} is VALID [2018-11-14 17:36:30,286 INFO L256 TraceCheckUtils]: 4: Hoare triple {4510#true} call #t~ret2 := main(); {4510#true} is VALID [2018-11-14 17:36:30,287 INFO L273 TraceCheckUtils]: 5: Hoare triple {4510#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {4510#true} is VALID [2018-11-14 17:36:30,287 INFO L273 TraceCheckUtils]: 6: Hoare triple {4510#true} assume !!(1 <= ~main__n~0); {4510#true} is VALID [2018-11-14 17:36:30,287 INFO L273 TraceCheckUtils]: 7: Hoare triple {4510#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {4536#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:36:30,288 INFO L273 TraceCheckUtils]: 8: Hoare triple {4536#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4540#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-14 17:36:30,289 INFO L273 TraceCheckUtils]: 9: Hoare triple {4540#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4544#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:36:30,289 INFO L273 TraceCheckUtils]: 10: Hoare triple {4544#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4548#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:36:30,290 INFO L273 TraceCheckUtils]: 11: Hoare triple {4548#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4552#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:36:30,290 INFO L273 TraceCheckUtils]: 12: Hoare triple {4552#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4556#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:36:30,291 INFO L273 TraceCheckUtils]: 13: Hoare triple {4556#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4560#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:36:30,292 INFO L273 TraceCheckUtils]: 14: Hoare triple {4560#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4564#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:36:30,293 INFO L273 TraceCheckUtils]: 15: Hoare triple {4564#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4568#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:36:30,294 INFO L273 TraceCheckUtils]: 16: Hoare triple {4568#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4572#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:36:30,295 INFO L273 TraceCheckUtils]: 17: Hoare triple {4572#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4576#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 17:36:30,296 INFO L273 TraceCheckUtils]: 18: Hoare triple {4576#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4580#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 17:36:30,296 INFO L273 TraceCheckUtils]: 19: Hoare triple {4580#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4584#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 17:36:30,297 INFO L273 TraceCheckUtils]: 20: Hoare triple {4584#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4588#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 17:36:30,298 INFO L273 TraceCheckUtils]: 21: Hoare triple {4588#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4592#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 17:36:30,299 INFO L273 TraceCheckUtils]: 22: Hoare triple {4592#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4596#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 17:36:30,300 INFO L273 TraceCheckUtils]: 23: Hoare triple {4596#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4600#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 17:36:30,301 INFO L273 TraceCheckUtils]: 24: Hoare triple {4600#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4604#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 17:36:30,302 INFO L273 TraceCheckUtils]: 25: Hoare triple {4604#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4608#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 17:36:30,303 INFO L273 TraceCheckUtils]: 26: Hoare triple {4608#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4612#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-14 17:36:30,303 INFO L273 TraceCheckUtils]: 27: Hoare triple {4612#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4616#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-14 17:36:30,304 INFO L273 TraceCheckUtils]: 28: Hoare triple {4616#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4620#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-14 17:36:30,305 INFO L273 TraceCheckUtils]: 29: Hoare triple {4620#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4624#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-14 17:36:30,307 INFO L273 TraceCheckUtils]: 30: Hoare triple {4624#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4628#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-14 17:36:30,310 INFO L273 TraceCheckUtils]: 31: Hoare triple {4628#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4632#(and (<= 24 main_~main__n~0) (= main_~main__sum~0 300) (<= main_~main__i~0 25))} is VALID [2018-11-14 17:36:30,314 INFO L273 TraceCheckUtils]: 32: Hoare triple {4632#(and (<= 24 main_~main__n~0) (= main_~main__sum~0 300) (<= main_~main__i~0 25))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4636#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:36:30,316 INFO L273 TraceCheckUtils]: 33: Hoare triple {4636#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {4511#false} is VALID [2018-11-14 17:36:30,316 INFO L273 TraceCheckUtils]: 34: Hoare triple {4511#false} assume !false; {4511#false} is VALID [2018-11-14 17:36:30,318 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:30,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:30,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-11-14 17:36:30,339 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 35 [2018-11-14 17:36:30,339 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:30,339 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-14 17:36:30,393 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:30,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-14 17:36:30,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-14 17:36:30,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-11-14 17:36:30,395 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 28 states. [2018-11-14 17:36:32,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:32,312 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-11-14 17:36:32,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-14 17:36:32,312 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 35 [2018-11-14 17:36:32,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:32,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 17:36:32,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-11-14 17:36:32,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 17:36:32,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-11-14 17:36:32,315 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 40 transitions. [2018-11-14 17:36:32,831 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:32,832 INFO L225 Difference]: With dead ends: 40 [2018-11-14 17:36:32,832 INFO L226 Difference]: Without dead ends: 37 [2018-11-14 17:36:32,832 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=755, Unknown=0, NotChecked=0, Total=812 [2018-11-14 17:36:32,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-14 17:36:32,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-14 17:36:32,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:32,897 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2018-11-14 17:36:32,897 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-14 17:36:32,897 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-14 17:36:32,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:32,899 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-11-14 17:36:32,899 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-11-14 17:36:32,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:32,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:32,900 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-14 17:36:32,900 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-14 17:36:32,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:32,901 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-11-14 17:36:32,901 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-11-14 17:36:32,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:32,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:32,901 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:32,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:32,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 17:36:32,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-11-14 17:36:32,902 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-11-14 17:36:32,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:32,903 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-11-14 17:36:32,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-14 17:36:32,903 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-11-14 17:36:32,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-14 17:36:32,903 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:32,904 INFO L375 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:32,904 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:32,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:32,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1273998842, now seen corresponding path program 20 times [2018-11-14 17:36:32,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:32,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:32,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:32,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:36:32,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:32,914 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:32,915 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:32,915 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:36:32,937 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:36:32,986 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:36:32,986 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:36:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:33,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:34,001 INFO L256 TraceCheckUtils]: 0: Hoare triple {4845#true} call ULTIMATE.init(); {4845#true} is VALID [2018-11-14 17:36:34,002 INFO L273 TraceCheckUtils]: 1: Hoare triple {4845#true} ~__return_main~0 := 0;~__return_96~0 := 0; {4845#true} is VALID [2018-11-14 17:36:34,002 INFO L273 TraceCheckUtils]: 2: Hoare triple {4845#true} assume true; {4845#true} is VALID [2018-11-14 17:36:34,003 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4845#true} {4845#true} #48#return; {4845#true} is VALID [2018-11-14 17:36:34,003 INFO L256 TraceCheckUtils]: 4: Hoare triple {4845#true} call #t~ret2 := main(); {4845#true} is VALID [2018-11-14 17:36:34,003 INFO L273 TraceCheckUtils]: 5: Hoare triple {4845#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {4845#true} is VALID [2018-11-14 17:36:34,004 INFO L273 TraceCheckUtils]: 6: Hoare triple {4845#true} assume !!(1 <= ~main__n~0); {4845#true} is VALID [2018-11-14 17:36:34,019 INFO L273 TraceCheckUtils]: 7: Hoare triple {4845#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {4871#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:36:34,019 INFO L273 TraceCheckUtils]: 8: Hoare triple {4871#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4875#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 17:36:34,020 INFO L273 TraceCheckUtils]: 9: Hoare triple {4875#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4879#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:36:34,021 INFO L273 TraceCheckUtils]: 10: Hoare triple {4879#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4883#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:36:34,021 INFO L273 TraceCheckUtils]: 11: Hoare triple {4883#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4887#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:36:34,022 INFO L273 TraceCheckUtils]: 12: Hoare triple {4887#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4891#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:36:34,022 INFO L273 TraceCheckUtils]: 13: Hoare triple {4891#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4895#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:36:34,023 INFO L273 TraceCheckUtils]: 14: Hoare triple {4895#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4899#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:36:34,024 INFO L273 TraceCheckUtils]: 15: Hoare triple {4899#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4903#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:36:34,024 INFO L273 TraceCheckUtils]: 16: Hoare triple {4903#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4907#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:36:34,025 INFO L273 TraceCheckUtils]: 17: Hoare triple {4907#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4911#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 17:36:34,026 INFO L273 TraceCheckUtils]: 18: Hoare triple {4911#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4915#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 17:36:34,027 INFO L273 TraceCheckUtils]: 19: Hoare triple {4915#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4919#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 17:36:34,028 INFO L273 TraceCheckUtils]: 20: Hoare triple {4919#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4923#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 17:36:34,029 INFO L273 TraceCheckUtils]: 21: Hoare triple {4923#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4927#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 17:36:34,030 INFO L273 TraceCheckUtils]: 22: Hoare triple {4927#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4931#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 17:36:34,031 INFO L273 TraceCheckUtils]: 23: Hoare triple {4931#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4935#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 17:36:34,032 INFO L273 TraceCheckUtils]: 24: Hoare triple {4935#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4939#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 17:36:34,033 INFO L273 TraceCheckUtils]: 25: Hoare triple {4939#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4943#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 17:36:34,034 INFO L273 TraceCheckUtils]: 26: Hoare triple {4943#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4947#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-14 17:36:34,035 INFO L273 TraceCheckUtils]: 27: Hoare triple {4947#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4951#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-14 17:36:34,035 INFO L273 TraceCheckUtils]: 28: Hoare triple {4951#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4955#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-14 17:36:34,036 INFO L273 TraceCheckUtils]: 29: Hoare triple {4955#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4959#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-14 17:36:34,037 INFO L273 TraceCheckUtils]: 30: Hoare triple {4959#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4963#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-14 17:36:34,038 INFO L273 TraceCheckUtils]: 31: Hoare triple {4963#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4967#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-14 17:36:34,039 INFO L273 TraceCheckUtils]: 32: Hoare triple {4967#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {4971#(and (= main_~main__sum~0 325) (<= main_~main__i~0 26) (<= 25 main_~main__n~0))} is VALID [2018-11-14 17:36:34,041 INFO L273 TraceCheckUtils]: 33: Hoare triple {4971#(and (= main_~main__sum~0 325) (<= main_~main__i~0 26) (<= 25 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4975#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:36:34,041 INFO L273 TraceCheckUtils]: 34: Hoare triple {4975#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {4846#false} is VALID [2018-11-14 17:36:34,042 INFO L273 TraceCheckUtils]: 35: Hoare triple {4846#false} assume !false; {4846#false} is VALID [2018-11-14 17:36:34,045 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:34,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:34,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-11-14 17:36:34,072 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 36 [2018-11-14 17:36:34,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:34,073 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-14 17:36:34,116 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:34,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-14 17:36:34,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-14 17:36:34,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-11-14 17:36:34,118 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 29 states. [2018-11-14 17:36:36,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:36,200 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-11-14 17:36:36,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-14 17:36:36,201 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 36 [2018-11-14 17:36:36,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:36,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 17:36:36,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2018-11-14 17:36:36,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 17:36:36,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2018-11-14 17:36:36,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 41 transitions. [2018-11-14 17:36:36,288 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:36,289 INFO L225 Difference]: With dead ends: 41 [2018-11-14 17:36:36,289 INFO L226 Difference]: Without dead ends: 38 [2018-11-14 17:36:36,290 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=811, Unknown=0, NotChecked=0, Total=870 [2018-11-14 17:36:36,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-14 17:36:36,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-14 17:36:36,392 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:36,392 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2018-11-14 17:36:36,392 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-14 17:36:36,392 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-14 17:36:36,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:36,393 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-11-14 17:36:36,393 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-14 17:36:36,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:36,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:36,394 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-14 17:36:36,394 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-14 17:36:36,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:36,395 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-11-14 17:36:36,395 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-14 17:36:36,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:36,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:36,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:36,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:36,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 17:36:36,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-11-14 17:36:36,397 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-11-14 17:36:36,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:36,397 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-11-14 17:36:36,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-14 17:36:36,397 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-14 17:36:36,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-14 17:36:36,398 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:36,398 INFO L375 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:36,398 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:36,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:36,398 INFO L82 PathProgramCache]: Analyzing trace with hash -839320896, now seen corresponding path program 21 times [2018-11-14 17:36:36,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:36,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:36,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:36,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:36:36,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:36,408 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:36,409 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:36,409 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:36:36,429 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:36:36,816 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-14 17:36:36,816 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:36:36,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:36,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:37,526 INFO L256 TraceCheckUtils]: 0: Hoare triple {5190#true} call ULTIMATE.init(); {5190#true} is VALID [2018-11-14 17:36:37,527 INFO L273 TraceCheckUtils]: 1: Hoare triple {5190#true} ~__return_main~0 := 0;~__return_96~0 := 0; {5190#true} is VALID [2018-11-14 17:36:37,527 INFO L273 TraceCheckUtils]: 2: Hoare triple {5190#true} assume true; {5190#true} is VALID [2018-11-14 17:36:37,527 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5190#true} {5190#true} #48#return; {5190#true} is VALID [2018-11-14 17:36:37,527 INFO L256 TraceCheckUtils]: 4: Hoare triple {5190#true} call #t~ret2 := main(); {5190#true} is VALID [2018-11-14 17:36:37,528 INFO L273 TraceCheckUtils]: 5: Hoare triple {5190#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {5190#true} is VALID [2018-11-14 17:36:37,528 INFO L273 TraceCheckUtils]: 6: Hoare triple {5190#true} assume !!(1 <= ~main__n~0); {5190#true} is VALID [2018-11-14 17:36:37,529 INFO L273 TraceCheckUtils]: 7: Hoare triple {5190#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {5216#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:36:37,529 INFO L273 TraceCheckUtils]: 8: Hoare triple {5216#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5220#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 17:36:37,530 INFO L273 TraceCheckUtils]: 9: Hoare triple {5220#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5224#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:36:37,530 INFO L273 TraceCheckUtils]: 10: Hoare triple {5224#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5228#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:36:37,531 INFO L273 TraceCheckUtils]: 11: Hoare triple {5228#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5232#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:36:37,532 INFO L273 TraceCheckUtils]: 12: Hoare triple {5232#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5236#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:36:37,533 INFO L273 TraceCheckUtils]: 13: Hoare triple {5236#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5240#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:36:37,534 INFO L273 TraceCheckUtils]: 14: Hoare triple {5240#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5244#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:36:37,535 INFO L273 TraceCheckUtils]: 15: Hoare triple {5244#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5248#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:36:37,536 INFO L273 TraceCheckUtils]: 16: Hoare triple {5248#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5252#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:36:37,537 INFO L273 TraceCheckUtils]: 17: Hoare triple {5252#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5256#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 17:36:37,538 INFO L273 TraceCheckUtils]: 18: Hoare triple {5256#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5260#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 17:36:37,539 INFO L273 TraceCheckUtils]: 19: Hoare triple {5260#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5264#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 17:36:37,540 INFO L273 TraceCheckUtils]: 20: Hoare triple {5264#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5268#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 17:36:37,540 INFO L273 TraceCheckUtils]: 21: Hoare triple {5268#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5272#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 17:36:37,541 INFO L273 TraceCheckUtils]: 22: Hoare triple {5272#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5276#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 17:36:37,542 INFO L273 TraceCheckUtils]: 23: Hoare triple {5276#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5280#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 17:36:37,543 INFO L273 TraceCheckUtils]: 24: Hoare triple {5280#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5284#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 17:36:37,544 INFO L273 TraceCheckUtils]: 25: Hoare triple {5284#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5288#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 17:36:37,545 INFO L273 TraceCheckUtils]: 26: Hoare triple {5288#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5292#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-14 17:36:37,546 INFO L273 TraceCheckUtils]: 27: Hoare triple {5292#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5296#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-14 17:36:37,547 INFO L273 TraceCheckUtils]: 28: Hoare triple {5296#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5300#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-14 17:36:37,548 INFO L273 TraceCheckUtils]: 29: Hoare triple {5300#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5304#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-14 17:36:37,549 INFO L273 TraceCheckUtils]: 30: Hoare triple {5304#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5308#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-14 17:36:37,550 INFO L273 TraceCheckUtils]: 31: Hoare triple {5308#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5312#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-14 17:36:37,551 INFO L273 TraceCheckUtils]: 32: Hoare triple {5312#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5316#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-14 17:36:37,552 INFO L273 TraceCheckUtils]: 33: Hoare triple {5316#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5320#(and (= main_~main__sum~0 351) (<= main_~main__i~0 27) (<= 26 main_~main__n~0))} is VALID [2018-11-14 17:36:37,553 INFO L273 TraceCheckUtils]: 34: Hoare triple {5320#(and (= main_~main__sum~0 351) (<= main_~main__i~0 27) (<= 26 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5324#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:36:37,554 INFO L273 TraceCheckUtils]: 35: Hoare triple {5324#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {5191#false} is VALID [2018-11-14 17:36:37,554 INFO L273 TraceCheckUtils]: 36: Hoare triple {5191#false} assume !false; {5191#false} is VALID [2018-11-14 17:36:37,557 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:37,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:37,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-11-14 17:36:37,578 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 37 [2018-11-14 17:36:37,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:37,578 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-14 17:36:37,618 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:37,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-14 17:36:37,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-14 17:36:37,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-11-14 17:36:37,619 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 30 states. [2018-11-14 17:36:39,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:39,726 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-14 17:36:39,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-14 17:36:39,726 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 37 [2018-11-14 17:36:39,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:39,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 17:36:39,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2018-11-14 17:36:39,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 17:36:39,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2018-11-14 17:36:39,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 42 transitions. [2018-11-14 17:36:39,770 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:39,771 INFO L225 Difference]: With dead ends: 42 [2018-11-14 17:36:39,771 INFO L226 Difference]: Without dead ends: 39 [2018-11-14 17:36:39,772 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=869, Unknown=0, NotChecked=0, Total=930 [2018-11-14 17:36:39,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-14 17:36:39,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-14 17:36:39,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:39,829 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 39 states. [2018-11-14 17:36:39,829 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-14 17:36:39,829 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-14 17:36:39,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:39,830 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-14 17:36:39,830 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-11-14 17:36:39,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:39,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:39,831 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-14 17:36:39,831 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-14 17:36:39,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:39,832 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-14 17:36:39,832 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-11-14 17:36:39,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:39,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:39,833 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:39,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:39,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-14 17:36:39,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-11-14 17:36:39,834 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-11-14 17:36:39,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:39,834 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-11-14 17:36:39,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-14 17:36:39,834 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-11-14 17:36:39,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-14 17:36:39,835 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:39,835 INFO L375 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:39,835 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:39,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:39,835 INFO L82 PathProgramCache]: Analyzing trace with hash -249206458, now seen corresponding path program 22 times [2018-11-14 17:36:39,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:39,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:39,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:39,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:36:39,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:39,845 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:39,845 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:39,845 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:36:39,861 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:36:40,228 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:36:40,228 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:36:40,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:40,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:41,449 INFO L256 TraceCheckUtils]: 0: Hoare triple {5545#true} call ULTIMATE.init(); {5545#true} is VALID [2018-11-14 17:36:41,449 INFO L273 TraceCheckUtils]: 1: Hoare triple {5545#true} ~__return_main~0 := 0;~__return_96~0 := 0; {5545#true} is VALID [2018-11-14 17:36:41,449 INFO L273 TraceCheckUtils]: 2: Hoare triple {5545#true} assume true; {5545#true} is VALID [2018-11-14 17:36:41,449 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5545#true} {5545#true} #48#return; {5545#true} is VALID [2018-11-14 17:36:41,449 INFO L256 TraceCheckUtils]: 4: Hoare triple {5545#true} call #t~ret2 := main(); {5545#true} is VALID [2018-11-14 17:36:41,449 INFO L273 TraceCheckUtils]: 5: Hoare triple {5545#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {5545#true} is VALID [2018-11-14 17:36:41,450 INFO L273 TraceCheckUtils]: 6: Hoare triple {5545#true} assume !!(1 <= ~main__n~0); {5545#true} is VALID [2018-11-14 17:36:41,450 INFO L273 TraceCheckUtils]: 7: Hoare triple {5545#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {5571#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:36:41,450 INFO L273 TraceCheckUtils]: 8: Hoare triple {5571#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5575#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 17:36:41,451 INFO L273 TraceCheckUtils]: 9: Hoare triple {5575#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5579#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:36:41,452 INFO L273 TraceCheckUtils]: 10: Hoare triple {5579#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5583#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:36:41,452 INFO L273 TraceCheckUtils]: 11: Hoare triple {5583#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5587#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:36:41,453 INFO L273 TraceCheckUtils]: 12: Hoare triple {5587#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5591#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:36:41,453 INFO L273 TraceCheckUtils]: 13: Hoare triple {5591#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5595#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:36:41,454 INFO L273 TraceCheckUtils]: 14: Hoare triple {5595#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5599#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:36:41,455 INFO L273 TraceCheckUtils]: 15: Hoare triple {5599#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5603#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:36:41,456 INFO L273 TraceCheckUtils]: 16: Hoare triple {5603#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5607#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:36:41,457 INFO L273 TraceCheckUtils]: 17: Hoare triple {5607#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5611#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 17:36:41,458 INFO L273 TraceCheckUtils]: 18: Hoare triple {5611#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5615#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 17:36:41,459 INFO L273 TraceCheckUtils]: 19: Hoare triple {5615#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5619#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 17:36:41,460 INFO L273 TraceCheckUtils]: 20: Hoare triple {5619#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5623#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 17:36:41,461 INFO L273 TraceCheckUtils]: 21: Hoare triple {5623#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5627#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 17:36:41,461 INFO L273 TraceCheckUtils]: 22: Hoare triple {5627#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5631#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 17:36:41,462 INFO L273 TraceCheckUtils]: 23: Hoare triple {5631#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5635#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 17:36:41,463 INFO L273 TraceCheckUtils]: 24: Hoare triple {5635#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5639#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 17:36:41,464 INFO L273 TraceCheckUtils]: 25: Hoare triple {5639#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5643#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 17:36:41,465 INFO L273 TraceCheckUtils]: 26: Hoare triple {5643#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5647#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-14 17:36:41,466 INFO L273 TraceCheckUtils]: 27: Hoare triple {5647#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5651#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-14 17:36:41,467 INFO L273 TraceCheckUtils]: 28: Hoare triple {5651#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5655#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-14 17:36:41,467 INFO L273 TraceCheckUtils]: 29: Hoare triple {5655#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5659#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-14 17:36:41,468 INFO L273 TraceCheckUtils]: 30: Hoare triple {5659#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5663#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-14 17:36:41,469 INFO L273 TraceCheckUtils]: 31: Hoare triple {5663#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5667#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-14 17:36:41,470 INFO L273 TraceCheckUtils]: 32: Hoare triple {5667#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5671#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-14 17:36:41,471 INFO L273 TraceCheckUtils]: 33: Hoare triple {5671#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5675#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-14 17:36:41,472 INFO L273 TraceCheckUtils]: 34: Hoare triple {5675#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5679#(and (<= 27 main_~main__n~0) (= main_~main__sum~0 378) (<= main_~main__i~0 28))} is VALID [2018-11-14 17:36:41,473 INFO L273 TraceCheckUtils]: 35: Hoare triple {5679#(and (<= 27 main_~main__n~0) (= main_~main__sum~0 378) (<= main_~main__i~0 28))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5683#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:36:41,474 INFO L273 TraceCheckUtils]: 36: Hoare triple {5683#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {5546#false} is VALID [2018-11-14 17:36:41,474 INFO L273 TraceCheckUtils]: 37: Hoare triple {5546#false} assume !false; {5546#false} is VALID [2018-11-14 17:36:41,477 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:41,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:41,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-11-14 17:36:41,498 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 38 [2018-11-14 17:36:41,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:41,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-14 17:36:41,535 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:41,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-14 17:36:41,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-14 17:36:41,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-11-14 17:36:41,537 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 31 states. [2018-11-14 17:36:43,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:43,711 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-11-14 17:36:43,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-14 17:36:43,712 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 38 [2018-11-14 17:36:43,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:43,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 17:36:43,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2018-11-14 17:36:43,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 17:36:43,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2018-11-14 17:36:43,715 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 43 transitions. [2018-11-14 17:36:43,755 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:43,755 INFO L225 Difference]: With dead ends: 43 [2018-11-14 17:36:43,756 INFO L226 Difference]: Without dead ends: 40 [2018-11-14 17:36:43,757 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=63, Invalid=929, Unknown=0, NotChecked=0, Total=992 [2018-11-14 17:36:43,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-14 17:36:43,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-14 17:36:43,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:43,824 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-14 17:36:43,824 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-14 17:36:43,824 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-14 17:36:43,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:43,825 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-11-14 17:36:43,825 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-11-14 17:36:43,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:43,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:43,826 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-14 17:36:43,826 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-14 17:36:43,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:43,827 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-11-14 17:36:43,827 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-11-14 17:36:43,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:43,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:43,828 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:43,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:43,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-14 17:36:43,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-11-14 17:36:43,829 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-11-14 17:36:43,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:43,829 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-11-14 17:36:43,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-14 17:36:43,829 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-11-14 17:36:43,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-14 17:36:43,830 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:43,830 INFO L375 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:43,830 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:43,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:43,831 INFO L82 PathProgramCache]: Analyzing trace with hash 864471936, now seen corresponding path program 23 times [2018-11-14 17:36:43,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:43,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:43,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:43,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:36:43,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:43,840 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:43,840 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:43,840 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:36:43,858 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 17:36:43,917 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-11-14 17:36:43,918 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:36:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:43,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:45,072 INFO L256 TraceCheckUtils]: 0: Hoare triple {5910#true} call ULTIMATE.init(); {5910#true} is VALID [2018-11-14 17:36:45,072 INFO L273 TraceCheckUtils]: 1: Hoare triple {5910#true} ~__return_main~0 := 0;~__return_96~0 := 0; {5910#true} is VALID [2018-11-14 17:36:45,072 INFO L273 TraceCheckUtils]: 2: Hoare triple {5910#true} assume true; {5910#true} is VALID [2018-11-14 17:36:45,072 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5910#true} {5910#true} #48#return; {5910#true} is VALID [2018-11-14 17:36:45,073 INFO L256 TraceCheckUtils]: 4: Hoare triple {5910#true} call #t~ret2 := main(); {5910#true} is VALID [2018-11-14 17:36:45,073 INFO L273 TraceCheckUtils]: 5: Hoare triple {5910#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {5910#true} is VALID [2018-11-14 17:36:45,073 INFO L273 TraceCheckUtils]: 6: Hoare triple {5910#true} assume !!(1 <= ~main__n~0); {5910#true} is VALID [2018-11-14 17:36:45,073 INFO L273 TraceCheckUtils]: 7: Hoare triple {5910#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {5936#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:36:45,074 INFO L273 TraceCheckUtils]: 8: Hoare triple {5936#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5940#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 17:36:45,074 INFO L273 TraceCheckUtils]: 9: Hoare triple {5940#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5944#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:36:45,075 INFO L273 TraceCheckUtils]: 10: Hoare triple {5944#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5948#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:36:45,075 INFO L273 TraceCheckUtils]: 11: Hoare triple {5948#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5952#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:36:45,076 INFO L273 TraceCheckUtils]: 12: Hoare triple {5952#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5956#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:36:45,077 INFO L273 TraceCheckUtils]: 13: Hoare triple {5956#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5960#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:36:45,078 INFO L273 TraceCheckUtils]: 14: Hoare triple {5960#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5964#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:36:45,079 INFO L273 TraceCheckUtils]: 15: Hoare triple {5964#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5968#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:36:45,080 INFO L273 TraceCheckUtils]: 16: Hoare triple {5968#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5972#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:36:45,081 INFO L273 TraceCheckUtils]: 17: Hoare triple {5972#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5976#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 17:36:45,082 INFO L273 TraceCheckUtils]: 18: Hoare triple {5976#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5980#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 17:36:45,082 INFO L273 TraceCheckUtils]: 19: Hoare triple {5980#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5984#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 17:36:45,083 INFO L273 TraceCheckUtils]: 20: Hoare triple {5984#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5988#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 17:36:45,084 INFO L273 TraceCheckUtils]: 21: Hoare triple {5988#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5992#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 17:36:45,085 INFO L273 TraceCheckUtils]: 22: Hoare triple {5992#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {5996#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 17:36:45,086 INFO L273 TraceCheckUtils]: 23: Hoare triple {5996#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6000#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 17:36:45,087 INFO L273 TraceCheckUtils]: 24: Hoare triple {6000#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6004#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 17:36:45,088 INFO L273 TraceCheckUtils]: 25: Hoare triple {6004#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6008#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 17:36:45,089 INFO L273 TraceCheckUtils]: 26: Hoare triple {6008#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6012#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-14 17:36:45,089 INFO L273 TraceCheckUtils]: 27: Hoare triple {6012#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6016#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-14 17:36:45,090 INFO L273 TraceCheckUtils]: 28: Hoare triple {6016#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6020#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-14 17:36:45,091 INFO L273 TraceCheckUtils]: 29: Hoare triple {6020#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6024#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-14 17:36:45,092 INFO L273 TraceCheckUtils]: 30: Hoare triple {6024#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6028#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-14 17:36:45,093 INFO L273 TraceCheckUtils]: 31: Hoare triple {6028#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6032#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-14 17:36:45,094 INFO L273 TraceCheckUtils]: 32: Hoare triple {6032#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6036#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-14 17:36:45,095 INFO L273 TraceCheckUtils]: 33: Hoare triple {6036#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6040#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-14 17:36:45,096 INFO L273 TraceCheckUtils]: 34: Hoare triple {6040#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6044#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-14 17:36:45,097 INFO L273 TraceCheckUtils]: 35: Hoare triple {6044#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6048#(and (<= 28 main_~main__n~0) (<= main_~main__i~0 29) (= main_~main__sum~0 406))} is VALID [2018-11-14 17:36:45,098 INFO L273 TraceCheckUtils]: 36: Hoare triple {6048#(and (<= 28 main_~main__n~0) (<= main_~main__i~0 29) (= main_~main__sum~0 406))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6052#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:36:45,099 INFO L273 TraceCheckUtils]: 37: Hoare triple {6052#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {5911#false} is VALID [2018-11-14 17:36:45,099 INFO L273 TraceCheckUtils]: 38: Hoare triple {5911#false} assume !false; {5911#false} is VALID [2018-11-14 17:36:45,102 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:45,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:45,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-11-14 17:36:45,123 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 39 [2018-11-14 17:36:45,124 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:45,124 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-14 17:36:45,162 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:45,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-14 17:36:45,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-14 17:36:45,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-11-14 17:36:45,164 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 32 states. [2018-11-14 17:36:47,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:47,724 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-11-14 17:36:47,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-14 17:36:47,725 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 39 [2018-11-14 17:36:47,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:47,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 17:36:47,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2018-11-14 17:36:47,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 17:36:47,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2018-11-14 17:36:47,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 44 transitions. [2018-11-14 17:36:48,276 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:48,277 INFO L225 Difference]: With dead ends: 44 [2018-11-14 17:36:48,278 INFO L226 Difference]: Without dead ends: 41 [2018-11-14 17:36:48,278 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=65, Invalid=991, Unknown=0, NotChecked=0, Total=1056 [2018-11-14 17:36:48,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-14 17:36:48,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-14 17:36:48,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:48,399 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 41 states. [2018-11-14 17:36:48,399 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2018-11-14 17:36:48,400 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2018-11-14 17:36:48,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:48,401 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-11-14 17:36:48,401 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-11-14 17:36:48,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:48,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:48,401 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2018-11-14 17:36:48,401 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2018-11-14 17:36:48,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:48,402 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-11-14 17:36:48,402 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-11-14 17:36:48,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:48,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:48,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:48,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:48,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-14 17:36:48,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-11-14 17:36:48,404 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-11-14 17:36:48,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:48,404 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-11-14 17:36:48,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-14 17:36:48,405 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-11-14 17:36:48,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-14 17:36:48,405 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:48,405 INFO L375 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:48,405 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:48,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:48,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1028763782, now seen corresponding path program 24 times [2018-11-14 17:36:48,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:48,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:48,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:48,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:36:48,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:48,414 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:48,415 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:48,415 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:36:48,436 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 17:36:48,577 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-14 17:36:48,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:36:48,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:48,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:49,625 INFO L256 TraceCheckUtils]: 0: Hoare triple {6285#true} call ULTIMATE.init(); {6285#true} is VALID [2018-11-14 17:36:49,626 INFO L273 TraceCheckUtils]: 1: Hoare triple {6285#true} ~__return_main~0 := 0;~__return_96~0 := 0; {6285#true} is VALID [2018-11-14 17:36:49,626 INFO L273 TraceCheckUtils]: 2: Hoare triple {6285#true} assume true; {6285#true} is VALID [2018-11-14 17:36:49,626 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6285#true} {6285#true} #48#return; {6285#true} is VALID [2018-11-14 17:36:49,626 INFO L256 TraceCheckUtils]: 4: Hoare triple {6285#true} call #t~ret2 := main(); {6285#true} is VALID [2018-11-14 17:36:49,627 INFO L273 TraceCheckUtils]: 5: Hoare triple {6285#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {6285#true} is VALID [2018-11-14 17:36:49,627 INFO L273 TraceCheckUtils]: 6: Hoare triple {6285#true} assume !!(1 <= ~main__n~0); {6285#true} is VALID [2018-11-14 17:36:49,648 INFO L273 TraceCheckUtils]: 7: Hoare triple {6285#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {6311#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:36:49,649 INFO L273 TraceCheckUtils]: 8: Hoare triple {6311#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6315#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-14 17:36:49,649 INFO L273 TraceCheckUtils]: 9: Hoare triple {6315#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6319#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:36:49,650 INFO L273 TraceCheckUtils]: 10: Hoare triple {6319#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6323#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:36:49,650 INFO L273 TraceCheckUtils]: 11: Hoare triple {6323#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6327#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:36:49,651 INFO L273 TraceCheckUtils]: 12: Hoare triple {6327#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6331#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:36:49,651 INFO L273 TraceCheckUtils]: 13: Hoare triple {6331#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6335#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:36:49,652 INFO L273 TraceCheckUtils]: 14: Hoare triple {6335#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6339#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:36:49,653 INFO L273 TraceCheckUtils]: 15: Hoare triple {6339#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6343#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:36:49,654 INFO L273 TraceCheckUtils]: 16: Hoare triple {6343#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6347#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:36:49,655 INFO L273 TraceCheckUtils]: 17: Hoare triple {6347#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6351#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 17:36:49,656 INFO L273 TraceCheckUtils]: 18: Hoare triple {6351#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6355#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 17:36:49,656 INFO L273 TraceCheckUtils]: 19: Hoare triple {6355#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6359#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 17:36:49,657 INFO L273 TraceCheckUtils]: 20: Hoare triple {6359#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6363#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 17:36:49,658 INFO L273 TraceCheckUtils]: 21: Hoare triple {6363#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6367#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 17:36:49,659 INFO L273 TraceCheckUtils]: 22: Hoare triple {6367#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6371#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 17:36:49,660 INFO L273 TraceCheckUtils]: 23: Hoare triple {6371#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6375#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 17:36:49,661 INFO L273 TraceCheckUtils]: 24: Hoare triple {6375#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6379#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 17:36:49,662 INFO L273 TraceCheckUtils]: 25: Hoare triple {6379#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6383#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 17:36:49,663 INFO L273 TraceCheckUtils]: 26: Hoare triple {6383#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6387#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-14 17:36:49,664 INFO L273 TraceCheckUtils]: 27: Hoare triple {6387#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6391#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-14 17:36:49,665 INFO L273 TraceCheckUtils]: 28: Hoare triple {6391#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6395#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-14 17:36:49,666 INFO L273 TraceCheckUtils]: 29: Hoare triple {6395#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6399#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-14 17:36:49,666 INFO L273 TraceCheckUtils]: 30: Hoare triple {6399#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6403#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-14 17:36:49,667 INFO L273 TraceCheckUtils]: 31: Hoare triple {6403#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6407#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-14 17:36:49,668 INFO L273 TraceCheckUtils]: 32: Hoare triple {6407#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6411#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-14 17:36:49,669 INFO L273 TraceCheckUtils]: 33: Hoare triple {6411#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6415#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-14 17:36:49,670 INFO L273 TraceCheckUtils]: 34: Hoare triple {6415#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6419#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-14 17:36:49,671 INFO L273 TraceCheckUtils]: 35: Hoare triple {6419#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6423#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-14 17:36:49,672 INFO L273 TraceCheckUtils]: 36: Hoare triple {6423#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6427#(and (= main_~main__sum~0 435) (<= main_~main__i~0 30) (<= 29 main_~main__n~0))} is VALID [2018-11-14 17:36:49,674 INFO L273 TraceCheckUtils]: 37: Hoare triple {6427#(and (= main_~main__sum~0 435) (<= main_~main__i~0 30) (<= 29 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6431#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:36:49,677 INFO L273 TraceCheckUtils]: 38: Hoare triple {6431#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {6286#false} is VALID [2018-11-14 17:36:49,678 INFO L273 TraceCheckUtils]: 39: Hoare triple {6286#false} assume !false; {6286#false} is VALID [2018-11-14 17:36:49,680 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:49,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:49,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-11-14 17:36:49,702 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 40 [2018-11-14 17:36:49,702 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:49,702 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-14 17:36:49,743 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:49,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-14 17:36:49,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-14 17:36:49,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-11-14 17:36:49,745 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 33 states. [2018-11-14 17:36:52,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:52,371 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-14 17:36:52,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-14 17:36:52,372 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 40 [2018-11-14 17:36:52,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:52,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 17:36:52,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2018-11-14 17:36:52,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 17:36:52,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2018-11-14 17:36:52,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 45 transitions. [2018-11-14 17:36:52,429 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:52,430 INFO L225 Difference]: With dead ends: 45 [2018-11-14 17:36:52,430 INFO L226 Difference]: Without dead ends: 42 [2018-11-14 17:36:52,431 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=67, Invalid=1055, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 17:36:52,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-14 17:36:52,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-14 17:36:52,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:52,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2018-11-14 17:36:52,509 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-14 17:36:52,509 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-14 17:36:52,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:52,510 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-14 17:36:52,511 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-14 17:36:52,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:52,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:52,511 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-14 17:36:52,511 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-14 17:36:52,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:52,513 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-14 17:36:52,513 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-14 17:36:52,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:52,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:52,514 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:52,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:52,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-14 17:36:52,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-11-14 17:36:52,515 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-11-14 17:36:52,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:52,515 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-11-14 17:36:52,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-14 17:36:52,515 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-14 17:36:52,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-14 17:36:52,516 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:52,516 INFO L375 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:52,516 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:52,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:52,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1826843712, now seen corresponding path program 25 times [2018-11-14 17:36:52,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:52,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:52,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:52,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:36:52,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:52,525 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:52,525 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:52,526 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:36:52,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:36:52,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:52,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:52,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:53,741 INFO L256 TraceCheckUtils]: 0: Hoare triple {6670#true} call ULTIMATE.init(); {6670#true} is VALID [2018-11-14 17:36:53,741 INFO L273 TraceCheckUtils]: 1: Hoare triple {6670#true} ~__return_main~0 := 0;~__return_96~0 := 0; {6670#true} is VALID [2018-11-14 17:36:53,741 INFO L273 TraceCheckUtils]: 2: Hoare triple {6670#true} assume true; {6670#true} is VALID [2018-11-14 17:36:53,741 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6670#true} {6670#true} #48#return; {6670#true} is VALID [2018-11-14 17:36:53,741 INFO L256 TraceCheckUtils]: 4: Hoare triple {6670#true} call #t~ret2 := main(); {6670#true} is VALID [2018-11-14 17:36:53,742 INFO L273 TraceCheckUtils]: 5: Hoare triple {6670#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {6670#true} is VALID [2018-11-14 17:36:53,742 INFO L273 TraceCheckUtils]: 6: Hoare triple {6670#true} assume !!(1 <= ~main__n~0); {6670#true} is VALID [2018-11-14 17:36:53,742 INFO L273 TraceCheckUtils]: 7: Hoare triple {6670#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {6696#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:36:53,743 INFO L273 TraceCheckUtils]: 8: Hoare triple {6696#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6700#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-14 17:36:53,743 INFO L273 TraceCheckUtils]: 9: Hoare triple {6700#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6704#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:36:53,744 INFO L273 TraceCheckUtils]: 10: Hoare triple {6704#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6708#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:36:53,744 INFO L273 TraceCheckUtils]: 11: Hoare triple {6708#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6712#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:36:53,745 INFO L273 TraceCheckUtils]: 12: Hoare triple {6712#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6716#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:36:53,746 INFO L273 TraceCheckUtils]: 13: Hoare triple {6716#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6720#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:36:53,747 INFO L273 TraceCheckUtils]: 14: Hoare triple {6720#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6724#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:36:53,748 INFO L273 TraceCheckUtils]: 15: Hoare triple {6724#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6728#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:36:53,749 INFO L273 TraceCheckUtils]: 16: Hoare triple {6728#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6732#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:36:53,750 INFO L273 TraceCheckUtils]: 17: Hoare triple {6732#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6736#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 17:36:53,750 INFO L273 TraceCheckUtils]: 18: Hoare triple {6736#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6740#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 17:36:53,756 INFO L273 TraceCheckUtils]: 19: Hoare triple {6740#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6744#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 17:36:53,757 INFO L273 TraceCheckUtils]: 20: Hoare triple {6744#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6748#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 17:36:53,758 INFO L273 TraceCheckUtils]: 21: Hoare triple {6748#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6752#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 17:36:53,758 INFO L273 TraceCheckUtils]: 22: Hoare triple {6752#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6756#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 17:36:53,759 INFO L273 TraceCheckUtils]: 23: Hoare triple {6756#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6760#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 17:36:53,759 INFO L273 TraceCheckUtils]: 24: Hoare triple {6760#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6764#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 17:36:53,760 INFO L273 TraceCheckUtils]: 25: Hoare triple {6764#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6768#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 17:36:53,760 INFO L273 TraceCheckUtils]: 26: Hoare triple {6768#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6772#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-14 17:36:53,761 INFO L273 TraceCheckUtils]: 27: Hoare triple {6772#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6776#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-14 17:36:53,762 INFO L273 TraceCheckUtils]: 28: Hoare triple {6776#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6780#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-14 17:36:53,763 INFO L273 TraceCheckUtils]: 29: Hoare triple {6780#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6784#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-14 17:36:53,764 INFO L273 TraceCheckUtils]: 30: Hoare triple {6784#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6788#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-14 17:36:53,765 INFO L273 TraceCheckUtils]: 31: Hoare triple {6788#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6792#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-14 17:36:53,766 INFO L273 TraceCheckUtils]: 32: Hoare triple {6792#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6796#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-14 17:36:53,767 INFO L273 TraceCheckUtils]: 33: Hoare triple {6796#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6800#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-14 17:36:53,767 INFO L273 TraceCheckUtils]: 34: Hoare triple {6800#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6804#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-14 17:36:53,768 INFO L273 TraceCheckUtils]: 35: Hoare triple {6804#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6808#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-14 17:36:53,769 INFO L273 TraceCheckUtils]: 36: Hoare triple {6808#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6812#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-14 17:36:53,770 INFO L273 TraceCheckUtils]: 37: Hoare triple {6812#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {6816#(and (<= main_~main__i~0 31) (= main_~main__sum~0 465) (<= 30 main_~main__n~0))} is VALID [2018-11-14 17:36:53,771 INFO L273 TraceCheckUtils]: 38: Hoare triple {6816#(and (<= main_~main__i~0 31) (= main_~main__sum~0 465) (<= 30 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6820#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:36:53,772 INFO L273 TraceCheckUtils]: 39: Hoare triple {6820#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {6671#false} is VALID [2018-11-14 17:36:53,772 INFO L273 TraceCheckUtils]: 40: Hoare triple {6671#false} assume !false; {6671#false} is VALID [2018-11-14 17:36:53,775 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:53,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:53,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-11-14 17:36:53,797 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 41 [2018-11-14 17:36:53,798 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:53,798 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-14 17:36:53,838 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:53,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-14 17:36:53,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-14 17:36:53,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 17:36:53,839 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 34 states. [2018-11-14 17:36:56,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:56,616 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-11-14 17:36:56,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-14 17:36:56,616 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 41 [2018-11-14 17:36:56,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:36:56,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 17:36:56,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2018-11-14 17:36:56,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 17:36:56,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2018-11-14 17:36:56,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 46 transitions. [2018-11-14 17:36:56,686 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:56,687 INFO L225 Difference]: With dead ends: 46 [2018-11-14 17:36:56,688 INFO L226 Difference]: Without dead ends: 43 [2018-11-14 17:36:56,689 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=1121, Unknown=0, NotChecked=0, Total=1190 [2018-11-14 17:36:56,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-14 17:36:56,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-14 17:36:56,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:36:56,759 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2018-11-14 17:36:56,759 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-14 17:36:56,759 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-14 17:36:56,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:56,761 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-11-14 17:36:56,761 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-11-14 17:36:56,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:56,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:56,762 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-14 17:36:56,762 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-14 17:36:56,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:36:56,763 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-11-14 17:36:56,763 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-11-14 17:36:56,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:36:56,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:36:56,764 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:36:56,764 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:36:56,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-14 17:36:56,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-11-14 17:36:56,765 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-11-14 17:36:56,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:36:56,765 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-11-14 17:36:56,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-14 17:36:56,765 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-11-14 17:36:56,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-14 17:36:56,766 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:36:56,766 INFO L375 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:36:56,766 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:36:56,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:36:56,766 INFO L82 PathProgramCache]: Analyzing trace with hash 797517766, now seen corresponding path program 26 times [2018-11-14 17:36:56,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:36:56,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:36:56,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:56,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:36:56,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:36:56,775 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:36:56,776 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:36:56,776 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:36:56,793 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:36:56,864 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:36:56,865 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:36:56,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:36:56,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:36:58,419 INFO L256 TraceCheckUtils]: 0: Hoare triple {7065#true} call ULTIMATE.init(); {7065#true} is VALID [2018-11-14 17:36:58,420 INFO L273 TraceCheckUtils]: 1: Hoare triple {7065#true} ~__return_main~0 := 0;~__return_96~0 := 0; {7065#true} is VALID [2018-11-14 17:36:58,420 INFO L273 TraceCheckUtils]: 2: Hoare triple {7065#true} assume true; {7065#true} is VALID [2018-11-14 17:36:58,420 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7065#true} {7065#true} #48#return; {7065#true} is VALID [2018-11-14 17:36:58,420 INFO L256 TraceCheckUtils]: 4: Hoare triple {7065#true} call #t~ret2 := main(); {7065#true} is VALID [2018-11-14 17:36:58,420 INFO L273 TraceCheckUtils]: 5: Hoare triple {7065#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {7065#true} is VALID [2018-11-14 17:36:58,420 INFO L273 TraceCheckUtils]: 6: Hoare triple {7065#true} assume !!(1 <= ~main__n~0); {7065#true} is VALID [2018-11-14 17:36:58,421 INFO L273 TraceCheckUtils]: 7: Hoare triple {7065#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {7091#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:36:58,421 INFO L273 TraceCheckUtils]: 8: Hoare triple {7091#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7095#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-14 17:36:58,422 INFO L273 TraceCheckUtils]: 9: Hoare triple {7095#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7099#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:36:58,423 INFO L273 TraceCheckUtils]: 10: Hoare triple {7099#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7103#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:36:58,423 INFO L273 TraceCheckUtils]: 11: Hoare triple {7103#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7107#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:36:58,424 INFO L273 TraceCheckUtils]: 12: Hoare triple {7107#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7111#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:36:58,424 INFO L273 TraceCheckUtils]: 13: Hoare triple {7111#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7115#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:36:58,425 INFO L273 TraceCheckUtils]: 14: Hoare triple {7115#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7119#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:36:58,426 INFO L273 TraceCheckUtils]: 15: Hoare triple {7119#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7123#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:36:58,427 INFO L273 TraceCheckUtils]: 16: Hoare triple {7123#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7127#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:36:58,428 INFO L273 TraceCheckUtils]: 17: Hoare triple {7127#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7131#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 17:36:58,429 INFO L273 TraceCheckUtils]: 18: Hoare triple {7131#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7135#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 17:36:58,430 INFO L273 TraceCheckUtils]: 19: Hoare triple {7135#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7139#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 17:36:58,431 INFO L273 TraceCheckUtils]: 20: Hoare triple {7139#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7143#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 17:36:58,432 INFO L273 TraceCheckUtils]: 21: Hoare triple {7143#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7147#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 17:36:58,434 INFO L273 TraceCheckUtils]: 22: Hoare triple {7147#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7151#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 17:36:58,435 INFO L273 TraceCheckUtils]: 23: Hoare triple {7151#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7155#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 17:36:58,436 INFO L273 TraceCheckUtils]: 24: Hoare triple {7155#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7159#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 17:36:58,437 INFO L273 TraceCheckUtils]: 25: Hoare triple {7159#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7163#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 17:36:58,438 INFO L273 TraceCheckUtils]: 26: Hoare triple {7163#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7167#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-14 17:36:58,438 INFO L273 TraceCheckUtils]: 27: Hoare triple {7167#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7171#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-14 17:36:58,439 INFO L273 TraceCheckUtils]: 28: Hoare triple {7171#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7175#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-14 17:36:58,440 INFO L273 TraceCheckUtils]: 29: Hoare triple {7175#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7179#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-14 17:36:58,441 INFO L273 TraceCheckUtils]: 30: Hoare triple {7179#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7183#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-14 17:36:58,442 INFO L273 TraceCheckUtils]: 31: Hoare triple {7183#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7187#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-14 17:36:58,443 INFO L273 TraceCheckUtils]: 32: Hoare triple {7187#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7191#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-14 17:36:58,444 INFO L273 TraceCheckUtils]: 33: Hoare triple {7191#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7195#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-14 17:36:58,445 INFO L273 TraceCheckUtils]: 34: Hoare triple {7195#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7199#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-14 17:36:58,446 INFO L273 TraceCheckUtils]: 35: Hoare triple {7199#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7203#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-14 17:36:58,466 INFO L273 TraceCheckUtils]: 36: Hoare triple {7203#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7207#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-14 17:36:58,481 INFO L273 TraceCheckUtils]: 37: Hoare triple {7207#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7211#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-14 17:36:58,497 INFO L273 TraceCheckUtils]: 38: Hoare triple {7211#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7215#(and (<= 31 main_~main__n~0) (= main_~main__sum~0 496) (<= main_~main__i~0 32))} is VALID [2018-11-14 17:36:58,511 INFO L273 TraceCheckUtils]: 39: Hoare triple {7215#(and (<= 31 main_~main__n~0) (= main_~main__sum~0 496) (<= main_~main__i~0 32))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7219#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:36:58,520 INFO L273 TraceCheckUtils]: 40: Hoare triple {7219#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {7066#false} is VALID [2018-11-14 17:36:58,520 INFO L273 TraceCheckUtils]: 41: Hoare triple {7066#false} assume !false; {7066#false} is VALID [2018-11-14 17:36:58,524 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:36:58,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:36:58,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-11-14 17:36:58,555 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 42 [2018-11-14 17:36:58,555 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:36:58,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-14 17:36:58,650 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:36:58,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-14 17:36:58,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-14 17:36:58,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-11-14 17:36:58,652 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 35 states. [2018-11-14 17:37:01,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:01,774 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-11-14 17:37:01,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-14 17:37:01,774 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 42 [2018-11-14 17:37:01,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:37:01,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 17:37:01,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2018-11-14 17:37:01,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 17:37:01,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2018-11-14 17:37:01,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 47 transitions. [2018-11-14 17:37:01,824 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:01,825 INFO L225 Difference]: With dead ends: 47 [2018-11-14 17:37:01,825 INFO L226 Difference]: Without dead ends: 44 [2018-11-14 17:37:01,826 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=71, Invalid=1189, Unknown=0, NotChecked=0, Total=1260 [2018-11-14 17:37:01,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-14 17:37:01,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-14 17:37:01,907 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:37:01,907 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2018-11-14 17:37:01,907 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-14 17:37:01,907 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-14 17:37:01,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:01,909 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-11-14 17:37:01,909 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-14 17:37:01,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:01,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:01,909 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-14 17:37:01,909 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-14 17:37:01,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:01,911 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-11-14 17:37:01,911 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-14 17:37:01,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:01,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:01,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:37:01,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:37:01,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 17:37:01,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-11-14 17:37:01,913 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-11-14 17:37:01,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:37:01,913 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-11-14 17:37:01,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-14 17:37:01,913 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-14 17:37:01,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-14 17:37:01,914 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:37:01,914 INFO L375 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:37:01,914 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:37:01,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:37:01,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1046815488, now seen corresponding path program 27 times [2018-11-14 17:37:01,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:37:01,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:37:01,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:01,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:37:01,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:01,924 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:37:01,924 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:37:01,924 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:37:01,950 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:37:02,553 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-14 17:37:02,553 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:37:02,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:02,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:37:03,503 INFO L256 TraceCheckUtils]: 0: Hoare triple {7470#true} call ULTIMATE.init(); {7470#true} is VALID [2018-11-14 17:37:03,503 INFO L273 TraceCheckUtils]: 1: Hoare triple {7470#true} ~__return_main~0 := 0;~__return_96~0 := 0; {7470#true} is VALID [2018-11-14 17:37:03,504 INFO L273 TraceCheckUtils]: 2: Hoare triple {7470#true} assume true; {7470#true} is VALID [2018-11-14 17:37:03,504 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7470#true} {7470#true} #48#return; {7470#true} is VALID [2018-11-14 17:37:03,504 INFO L256 TraceCheckUtils]: 4: Hoare triple {7470#true} call #t~ret2 := main(); {7470#true} is VALID [2018-11-14 17:37:03,504 INFO L273 TraceCheckUtils]: 5: Hoare triple {7470#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {7470#true} is VALID [2018-11-14 17:37:03,504 INFO L273 TraceCheckUtils]: 6: Hoare triple {7470#true} assume !!(1 <= ~main__n~0); {7470#true} is VALID [2018-11-14 17:37:03,505 INFO L273 TraceCheckUtils]: 7: Hoare triple {7470#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {7496#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:37:03,506 INFO L273 TraceCheckUtils]: 8: Hoare triple {7496#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7500#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} is VALID [2018-11-14 17:37:03,506 INFO L273 TraceCheckUtils]: 9: Hoare triple {7500#(and (= main_~main__sum~0 1) (= (+ main_~main__sum~0 1) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7504#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:37:03,507 INFO L273 TraceCheckUtils]: 10: Hoare triple {7504#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7508#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:37:03,507 INFO L273 TraceCheckUtils]: 11: Hoare triple {7508#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7512#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:37:03,508 INFO L273 TraceCheckUtils]: 12: Hoare triple {7512#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7516#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:37:03,509 INFO L273 TraceCheckUtils]: 13: Hoare triple {7516#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7520#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:37:03,510 INFO L273 TraceCheckUtils]: 14: Hoare triple {7520#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7524#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:37:03,511 INFO L273 TraceCheckUtils]: 15: Hoare triple {7524#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7528#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:37:03,512 INFO L273 TraceCheckUtils]: 16: Hoare triple {7528#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7532#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:37:03,513 INFO L273 TraceCheckUtils]: 17: Hoare triple {7532#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7536#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 17:37:03,513 INFO L273 TraceCheckUtils]: 18: Hoare triple {7536#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7540#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 17:37:03,514 INFO L273 TraceCheckUtils]: 19: Hoare triple {7540#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7544#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 17:37:03,515 INFO L273 TraceCheckUtils]: 20: Hoare triple {7544#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7548#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 17:37:03,516 INFO L273 TraceCheckUtils]: 21: Hoare triple {7548#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7552#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 17:37:03,517 INFO L273 TraceCheckUtils]: 22: Hoare triple {7552#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7556#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 17:37:03,518 INFO L273 TraceCheckUtils]: 23: Hoare triple {7556#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7560#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 17:37:03,519 INFO L273 TraceCheckUtils]: 24: Hoare triple {7560#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7564#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 17:37:03,520 INFO L273 TraceCheckUtils]: 25: Hoare triple {7564#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7568#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 17:37:03,521 INFO L273 TraceCheckUtils]: 26: Hoare triple {7568#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7572#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-14 17:37:03,522 INFO L273 TraceCheckUtils]: 27: Hoare triple {7572#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7576#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-14 17:37:03,523 INFO L273 TraceCheckUtils]: 28: Hoare triple {7576#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7580#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-14 17:37:03,523 INFO L273 TraceCheckUtils]: 29: Hoare triple {7580#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7584#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-14 17:37:03,524 INFO L273 TraceCheckUtils]: 30: Hoare triple {7584#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7588#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-14 17:37:03,525 INFO L273 TraceCheckUtils]: 31: Hoare triple {7588#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7592#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-14 17:37:03,526 INFO L273 TraceCheckUtils]: 32: Hoare triple {7592#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7596#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-14 17:37:03,527 INFO L273 TraceCheckUtils]: 33: Hoare triple {7596#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7600#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-14 17:37:03,528 INFO L273 TraceCheckUtils]: 34: Hoare triple {7600#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7604#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-14 17:37:03,529 INFO L273 TraceCheckUtils]: 35: Hoare triple {7604#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7608#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-14 17:37:03,530 INFO L273 TraceCheckUtils]: 36: Hoare triple {7608#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7612#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-14 17:37:03,531 INFO L273 TraceCheckUtils]: 37: Hoare triple {7612#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7616#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-14 17:37:03,532 INFO L273 TraceCheckUtils]: 38: Hoare triple {7616#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7620#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} is VALID [2018-11-14 17:37:03,533 INFO L273 TraceCheckUtils]: 39: Hoare triple {7620#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7624#(and (<= 32 main_~main__n~0) (<= main_~main__i~0 33) (= main_~main__sum~0 528))} is VALID [2018-11-14 17:37:03,534 INFO L273 TraceCheckUtils]: 40: Hoare triple {7624#(and (<= 32 main_~main__n~0) (<= main_~main__i~0 33) (= main_~main__sum~0 528))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7628#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:37:03,535 INFO L273 TraceCheckUtils]: 41: Hoare triple {7628#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {7471#false} is VALID [2018-11-14 17:37:03,535 INFO L273 TraceCheckUtils]: 42: Hoare triple {7471#false} assume !false; {7471#false} is VALID [2018-11-14 17:37:03,539 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:37:03,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:37:03,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-11-14 17:37:03,560 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 43 [2018-11-14 17:37:03,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:37:03,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-14 17:37:03,605 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:03,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-14 17:37:03,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-14 17:37:03,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-11-14 17:37:03,606 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 36 states. [2018-11-14 17:37:06,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:06,858 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-11-14 17:37:06,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-14 17:37:06,858 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 43 [2018-11-14 17:37:06,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:37:06,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 17:37:06,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2018-11-14 17:37:06,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 17:37:06,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2018-11-14 17:37:06,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 48 transitions. [2018-11-14 17:37:07,364 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:07,364 INFO L225 Difference]: With dead ends: 48 [2018-11-14 17:37:07,365 INFO L226 Difference]: Without dead ends: 45 [2018-11-14 17:37:07,366 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=1259, Unknown=0, NotChecked=0, Total=1332 [2018-11-14 17:37:07,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-14 17:37:07,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-14 17:37:07,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:37:07,987 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 45 states. [2018-11-14 17:37:07,987 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2018-11-14 17:37:07,987 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2018-11-14 17:37:07,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:07,988 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-14 17:37:07,988 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-11-14 17:37:07,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:07,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:07,989 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2018-11-14 17:37:07,989 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2018-11-14 17:37:07,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:07,990 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-14 17:37:07,990 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-11-14 17:37:07,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:07,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:07,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:37:07,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:37:07,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-14 17:37:07,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-11-14 17:37:07,993 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-11-14 17:37:07,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:37:07,993 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-11-14 17:37:07,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-14 17:37:07,993 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-11-14 17:37:07,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-14 17:37:07,994 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:37:07,994 INFO L375 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:37:07,994 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:37:07,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:37:07,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1908395782, now seen corresponding path program 28 times [2018-11-14 17:37:07,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:37:07,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:37:08,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:08,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:37:08,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:08,010 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:37:08,010 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:37:08,010 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:37:08,025 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:37:08,347 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:37:08,348 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:37:08,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:08,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:37:09,815 INFO L256 TraceCheckUtils]: 0: Hoare triple {7885#true} call ULTIMATE.init(); {7885#true} is VALID [2018-11-14 17:37:09,815 INFO L273 TraceCheckUtils]: 1: Hoare triple {7885#true} ~__return_main~0 := 0;~__return_96~0 := 0; {7885#true} is VALID [2018-11-14 17:37:09,815 INFO L273 TraceCheckUtils]: 2: Hoare triple {7885#true} assume true; {7885#true} is VALID [2018-11-14 17:37:09,816 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7885#true} {7885#true} #48#return; {7885#true} is VALID [2018-11-14 17:37:09,816 INFO L256 TraceCheckUtils]: 4: Hoare triple {7885#true} call #t~ret2 := main(); {7885#true} is VALID [2018-11-14 17:37:09,816 INFO L273 TraceCheckUtils]: 5: Hoare triple {7885#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {7885#true} is VALID [2018-11-14 17:37:09,816 INFO L273 TraceCheckUtils]: 6: Hoare triple {7885#true} assume !!(1 <= ~main__n~0); {7885#true} is VALID [2018-11-14 17:37:09,817 INFO L273 TraceCheckUtils]: 7: Hoare triple {7885#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {7911#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:37:09,817 INFO L273 TraceCheckUtils]: 8: Hoare triple {7911#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7915#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 17:37:09,818 INFO L273 TraceCheckUtils]: 9: Hoare triple {7915#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7919#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:37:09,819 INFO L273 TraceCheckUtils]: 10: Hoare triple {7919#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7923#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:37:09,819 INFO L273 TraceCheckUtils]: 11: Hoare triple {7923#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7927#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:37:09,820 INFO L273 TraceCheckUtils]: 12: Hoare triple {7927#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7931#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:37:09,821 INFO L273 TraceCheckUtils]: 13: Hoare triple {7931#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7935#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:37:09,822 INFO L273 TraceCheckUtils]: 14: Hoare triple {7935#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7939#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:37:09,823 INFO L273 TraceCheckUtils]: 15: Hoare triple {7939#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7943#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:37:09,824 INFO L273 TraceCheckUtils]: 16: Hoare triple {7943#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7947#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:37:09,825 INFO L273 TraceCheckUtils]: 17: Hoare triple {7947#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7951#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 17:37:09,826 INFO L273 TraceCheckUtils]: 18: Hoare triple {7951#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7955#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 17:37:09,827 INFO L273 TraceCheckUtils]: 19: Hoare triple {7955#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7959#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 17:37:09,828 INFO L273 TraceCheckUtils]: 20: Hoare triple {7959#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7963#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 17:37:09,829 INFO L273 TraceCheckUtils]: 21: Hoare triple {7963#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7967#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 17:37:09,830 INFO L273 TraceCheckUtils]: 22: Hoare triple {7967#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7971#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 17:37:09,831 INFO L273 TraceCheckUtils]: 23: Hoare triple {7971#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7975#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 17:37:09,832 INFO L273 TraceCheckUtils]: 24: Hoare triple {7975#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7979#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 17:37:09,832 INFO L273 TraceCheckUtils]: 25: Hoare triple {7979#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7983#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 17:37:09,833 INFO L273 TraceCheckUtils]: 26: Hoare triple {7983#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7987#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-14 17:37:09,834 INFO L273 TraceCheckUtils]: 27: Hoare triple {7987#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7991#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-14 17:37:09,835 INFO L273 TraceCheckUtils]: 28: Hoare triple {7991#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7995#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-14 17:37:09,836 INFO L273 TraceCheckUtils]: 29: Hoare triple {7995#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {7999#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-14 17:37:09,837 INFO L273 TraceCheckUtils]: 30: Hoare triple {7999#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8003#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-14 17:37:09,838 INFO L273 TraceCheckUtils]: 31: Hoare triple {8003#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8007#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-14 17:37:09,839 INFO L273 TraceCheckUtils]: 32: Hoare triple {8007#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8011#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-14 17:37:09,840 INFO L273 TraceCheckUtils]: 33: Hoare triple {8011#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8015#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-14 17:37:09,841 INFO L273 TraceCheckUtils]: 34: Hoare triple {8015#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8019#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-14 17:37:09,842 INFO L273 TraceCheckUtils]: 35: Hoare triple {8019#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8023#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-14 17:37:09,843 INFO L273 TraceCheckUtils]: 36: Hoare triple {8023#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8027#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-14 17:37:09,844 INFO L273 TraceCheckUtils]: 37: Hoare triple {8027#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8031#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-14 17:37:09,845 INFO L273 TraceCheckUtils]: 38: Hoare triple {8031#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8035#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} is VALID [2018-11-14 17:37:09,846 INFO L273 TraceCheckUtils]: 39: Hoare triple {8035#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8039#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} is VALID [2018-11-14 17:37:09,846 INFO L273 TraceCheckUtils]: 40: Hoare triple {8039#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8043#(and (<= main_~main__i~0 34) (= main_~main__sum~0 561) (<= 33 main_~main__n~0))} is VALID [2018-11-14 17:37:09,848 INFO L273 TraceCheckUtils]: 41: Hoare triple {8043#(and (<= main_~main__i~0 34) (= main_~main__sum~0 561) (<= 33 main_~main__n~0))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {8047#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:37:09,849 INFO L273 TraceCheckUtils]: 42: Hoare triple {8047#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {7886#false} is VALID [2018-11-14 17:37:09,850 INFO L273 TraceCheckUtils]: 43: Hoare triple {7886#false} assume !false; {7886#false} is VALID [2018-11-14 17:37:09,853 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:37:09,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:37:09,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-11-14 17:37:09,875 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 44 [2018-11-14 17:37:09,875 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:37:09,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states. [2018-11-14 17:37:09,931 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:09,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-14 17:37:09,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-14 17:37:09,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-11-14 17:37:09,933 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 37 states. [2018-11-14 17:37:13,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:13,340 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-11-14 17:37:13,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-14 17:37:13,340 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 44 [2018-11-14 17:37:13,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:37:13,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 17:37:13,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2018-11-14 17:37:13,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 17:37:13,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2018-11-14 17:37:13,344 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 49 transitions. [2018-11-14 17:37:13,390 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:13,391 INFO L225 Difference]: With dead ends: 49 [2018-11-14 17:37:13,391 INFO L226 Difference]: Without dead ends: 46 [2018-11-14 17:37:13,393 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=75, Invalid=1331, Unknown=0, NotChecked=0, Total=1406 [2018-11-14 17:37:13,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-14 17:37:13,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-14 17:37:13,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:37:13,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 46 states. [2018-11-14 17:37:13,474 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-14 17:37:13,475 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-14 17:37:13,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:13,476 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-11-14 17:37:13,476 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-11-14 17:37:13,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:13,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:13,477 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-14 17:37:13,477 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-14 17:37:13,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:13,478 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-11-14 17:37:13,478 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-11-14 17:37:13,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:13,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:13,478 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:37:13,478 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:37:13,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-14 17:37:13,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-11-14 17:37:13,479 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-11-14 17:37:13,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:37:13,480 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-11-14 17:37:13,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-14 17:37:13,480 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-11-14 17:37:13,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-14 17:37:13,480 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:37:13,481 INFO L375 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:37:13,481 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:37:13,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:37:13,481 INFO L82 PathProgramCache]: Analyzing trace with hash -969335360, now seen corresponding path program 29 times [2018-11-14 17:37:13,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:37:13,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:37:13,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:13,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:37:13,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:13,490 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:37:13,490 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:37:13,490 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:37:13,506 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 17:37:13,565 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-11-14 17:37:13,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:37:13,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:13,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:37:14,542 INFO L256 TraceCheckUtils]: 0: Hoare triple {8310#true} call ULTIMATE.init(); {8310#true} is VALID [2018-11-14 17:37:14,542 INFO L273 TraceCheckUtils]: 1: Hoare triple {8310#true} ~__return_main~0 := 0;~__return_96~0 := 0; {8310#true} is VALID [2018-11-14 17:37:14,543 INFO L273 TraceCheckUtils]: 2: Hoare triple {8310#true} assume true; {8310#true} is VALID [2018-11-14 17:37:14,543 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8310#true} {8310#true} #48#return; {8310#true} is VALID [2018-11-14 17:37:14,543 INFO L256 TraceCheckUtils]: 4: Hoare triple {8310#true} call #t~ret2 := main(); {8310#true} is VALID [2018-11-14 17:37:14,543 INFO L273 TraceCheckUtils]: 5: Hoare triple {8310#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__n~0 := #t~nondet1;havoc #t~nondet1; {8310#true} is VALID [2018-11-14 17:37:14,543 INFO L273 TraceCheckUtils]: 6: Hoare triple {8310#true} assume !!(1 <= ~main__n~0); {8310#true} is VALID [2018-11-14 17:37:14,544 INFO L273 TraceCheckUtils]: 7: Hoare triple {8310#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {8336#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} is VALID [2018-11-14 17:37:14,544 INFO L273 TraceCheckUtils]: 8: Hoare triple {8336#(and (= 1 main_~main__i~0) (= main_~main__sum~0 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8340#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} is VALID [2018-11-14 17:37:14,545 INFO L273 TraceCheckUtils]: 9: Hoare triple {8340#(and (= main_~main__sum~0 1) (= 2 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8344#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} is VALID [2018-11-14 17:37:14,545 INFO L273 TraceCheckUtils]: 10: Hoare triple {8344#(and (= main_~main__sum~0 3) (= 3 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8348#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} is VALID [2018-11-14 17:37:14,546 INFO L273 TraceCheckUtils]: 11: Hoare triple {8348#(and (= 4 main_~main__i~0) (= main_~main__sum~0 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8352#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2018-11-14 17:37:14,546 INFO L273 TraceCheckUtils]: 12: Hoare triple {8352#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8356#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2018-11-14 17:37:14,547 INFO L273 TraceCheckUtils]: 13: Hoare triple {8356#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8360#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} is VALID [2018-11-14 17:37:14,548 INFO L273 TraceCheckUtils]: 14: Hoare triple {8360#(and (= main_~main__sum~0 21) (= 7 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8364#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2018-11-14 17:37:14,549 INFO L273 TraceCheckUtils]: 15: Hoare triple {8364#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8368#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} is VALID [2018-11-14 17:37:14,550 INFO L273 TraceCheckUtils]: 16: Hoare triple {8368#(and (= 9 main_~main__i~0) (= main_~main__sum~0 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8372#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2018-11-14 17:37:14,551 INFO L273 TraceCheckUtils]: 17: Hoare triple {8372#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8376#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} is VALID [2018-11-14 17:37:14,552 INFO L273 TraceCheckUtils]: 18: Hoare triple {8376#(and (= main_~main__sum~0 55) (= 11 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8380#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} is VALID [2018-11-14 17:37:14,553 INFO L273 TraceCheckUtils]: 19: Hoare triple {8380#(and (= 12 main_~main__i~0) (= main_~main__sum~0 66))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8384#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2018-11-14 17:37:14,553 INFO L273 TraceCheckUtils]: 20: Hoare triple {8384#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8388#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} is VALID [2018-11-14 17:37:14,554 INFO L273 TraceCheckUtils]: 21: Hoare triple {8388#(and (= main_~main__sum~0 91) (= 14 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8392#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2018-11-14 17:37:14,555 INFO L273 TraceCheckUtils]: 22: Hoare triple {8392#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8396#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2018-11-14 17:37:14,556 INFO L273 TraceCheckUtils]: 23: Hoare triple {8396#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8400#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} is VALID [2018-11-14 17:37:14,557 INFO L273 TraceCheckUtils]: 24: Hoare triple {8400#(and (= main_~main__sum~0 136) (= 17 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8404#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} is VALID [2018-11-14 17:37:14,558 INFO L273 TraceCheckUtils]: 25: Hoare triple {8404#(and (= main_~main__sum~0 153) (= 18 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8408#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} is VALID [2018-11-14 17:37:14,559 INFO L273 TraceCheckUtils]: 26: Hoare triple {8408#(and (= 19 main_~main__i~0) (= main_~main__sum~0 171))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8412#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} is VALID [2018-11-14 17:37:14,559 INFO L273 TraceCheckUtils]: 27: Hoare triple {8412#(and (= main_~main__sum~0 190) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8416#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} is VALID [2018-11-14 17:37:14,560 INFO L273 TraceCheckUtils]: 28: Hoare triple {8416#(and (= main_~main__sum~0 210) (= 21 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8420#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} is VALID [2018-11-14 17:37:14,561 INFO L273 TraceCheckUtils]: 29: Hoare triple {8420#(and (= main_~main__sum~0 231) (= 22 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8424#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} is VALID [2018-11-14 17:37:14,562 INFO L273 TraceCheckUtils]: 30: Hoare triple {8424#(and (= 23 main_~main__i~0) (= main_~main__sum~0 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8428#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} is VALID [2018-11-14 17:37:14,563 INFO L273 TraceCheckUtils]: 31: Hoare triple {8428#(and (= main_~main__sum~0 276) (= 24 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8432#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} is VALID [2018-11-14 17:37:14,564 INFO L273 TraceCheckUtils]: 32: Hoare triple {8432#(and (= main_~main__sum~0 300) (= 25 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8436#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2018-11-14 17:37:14,565 INFO L273 TraceCheckUtils]: 33: Hoare triple {8436#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8440#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} is VALID [2018-11-14 17:37:14,566 INFO L273 TraceCheckUtils]: 34: Hoare triple {8440#(and (= main_~main__sum~0 351) (= 27 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8444#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2018-11-14 17:37:14,567 INFO L273 TraceCheckUtils]: 35: Hoare triple {8444#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8448#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} is VALID [2018-11-14 17:37:14,568 INFO L273 TraceCheckUtils]: 36: Hoare triple {8448#(and (= 29 main_~main__i~0) (= main_~main__sum~0 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8452#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2018-11-14 17:37:14,569 INFO L273 TraceCheckUtils]: 37: Hoare triple {8452#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8456#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} is VALID [2018-11-14 17:37:14,569 INFO L273 TraceCheckUtils]: 38: Hoare triple {8456#(and (= main_~main__sum~0 465) (= 31 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8460#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} is VALID [2018-11-14 17:37:14,570 INFO L273 TraceCheckUtils]: 39: Hoare triple {8460#(and (= 32 main_~main__i~0) (= main_~main__sum~0 496))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8464#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} is VALID [2018-11-14 17:37:14,571 INFO L273 TraceCheckUtils]: 40: Hoare triple {8464#(and (= 33 main_~main__i~0) (= main_~main__sum~0 528))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8468#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} is VALID [2018-11-14 17:37:14,572 INFO L273 TraceCheckUtils]: 41: Hoare triple {8468#(and (= 34 main_~main__i~0) (= main_~main__sum~0 561))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := ~main__i~0 + 1; {8472#(and (<= main_~main__i~0 35) (<= 34 main_~main__n~0) (= main_~main__sum~0 595))} is VALID [2018-11-14 17:37:14,574 INFO L273 TraceCheckUtils]: 42: Hoare triple {8472#(and (<= main_~main__i~0 35) (<= 34 main_~main__n~0) (= main_~main__sum~0 595))} assume !(~main__i~0 <= ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 2 * ~main__sum~0 == ~main__n~0 * (~main__n~0 + 1) then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {8476#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:37:14,574 INFO L273 TraceCheckUtils]: 43: Hoare triple {8476#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {8311#false} is VALID [2018-11-14 17:37:14,574 INFO L273 TraceCheckUtils]: 44: Hoare triple {8311#false} assume !false; {8311#false} is VALID [2018-11-14 17:37:14,578 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:37:14,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:37:14,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-11-14 17:37:14,599 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 45 [2018-11-14 17:37:14,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:37:14,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-14 17:37:14,643 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:14,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-14 17:37:14,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-14 17:37:14,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-11-14 17:37:14,645 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 38 states. [2018-11-14 17:37:18,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:18,139 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-11-14 17:37:18,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-14 17:37:18,139 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 45 [2018-11-14 17:37:18,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:37:18,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 17:37:18,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2018-11-14 17:37:18,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 17:37:18,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2018-11-14 17:37:18,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 50 transitions. [2018-11-14 17:37:18,205 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:18,206 INFO L225 Difference]: With dead ends: 50 [2018-11-14 17:37:18,206 INFO L226 Difference]: Without dead ends: 47 [2018-11-14 17:37:18,207 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=77, Invalid=1405, Unknown=0, NotChecked=0, Total=1482 [2018-11-14 17:37:18,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-14 17:37:18,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-11-14 17:37:18,283 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:37:18,283 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 47 states. [2018-11-14 17:37:18,283 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2018-11-14 17:37:18,283 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2018-11-14 17:37:18,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:18,285 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-11-14 17:37:18,285 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-11-14 17:37:18,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:18,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:18,285 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2018-11-14 17:37:18,285 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2018-11-14 17:37:18,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:18,286 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-11-14 17:37:18,286 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-11-14 17:37:18,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:18,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:18,286 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:37:18,287 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:37:18,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-14 17:37:18,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-11-14 17:37:18,287 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-11-14 17:37:18,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:37:18,287 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-11-14 17:37:18,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-14 17:37:18,288 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-11-14 17:37:18,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-14 17:37:18,288 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:37:18,288 INFO L375 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:37:18,288 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:37:18,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:37:18,289 INFO L82 PathProgramCache]: Analyzing trace with hash 15312454, now seen corresponding path program 30 times [2018-11-14 17:37:18,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:37:18,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:37:18,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:18,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:37:18,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:18,298 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:37:18,298 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:37:18,298 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:37:18,314 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 17:37:18,576 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-11-14 17:37:18,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:37:18,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:18,607 INFO L273 TraceCheckSpWp]: Computing forward predicates...