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_Bitvector.epf -i ../../../trunk/examples/svcomp/loop-new/gauss_sum_true-unreach-call.i.p+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 22:33:46,928 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 22:33:46,930 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 22:33:46,943 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 22:33:46,943 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 22:33:46,944 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 22:33:46,946 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 22:33:46,948 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 22:33:46,949 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 22:33:46,950 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 22:33:46,951 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 22:33:46,952 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 22:33:46,952 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 22:33:46,953 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 22:33:46,955 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 22:33:46,955 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 22:33:46,956 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 22:33:46,958 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 22:33:46,960 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 22:33:46,962 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 22:33:46,963 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 22:33:46,964 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 22:33:46,967 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 22:33:46,967 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 22:33:46,967 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 22:33:46,968 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 22:33:46,969 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 22:33:46,970 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 22:33:46,971 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 22:33:46,972 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 22:33:46,973 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 22:33:46,973 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 22:33:46,974 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 22:33:46,974 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 22:33:46,975 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 22:33:46,976 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 22:33:46,976 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-18 22:33:47,008 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 22:33:47,009 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 22:33:47,010 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 22:33:47,010 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 22:33:47,011 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 22:33:47,011 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 22:33:47,012 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 22:33:47,013 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 22:33:47,013 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 22:33:47,013 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 22:33:47,013 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 22:33:47,014 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 22:33:47,014 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 22:33:47,014 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 22:33:47,014 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 22:33:47,014 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 22:33:47,016 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 22:33:47,016 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 22:33:47,016 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 22:33:47,016 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 22:33:47,017 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 22:33:47,017 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 22:33:47,017 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 22:33:47,017 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 22:33:47,017 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:33:47,018 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 22:33:47,018 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 22:33:47,018 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 22:33:47,019 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 22:33:47,019 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 22:33:47,019 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 22:33:47,019 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 22:33:47,019 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 22:33:47,084 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 22:33:47,098 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 22:33:47,102 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 22:33:47,104 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 22:33:47,104 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 22:33:47,105 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+cfa-reducer.c [2018-11-18 22:33:47,174 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11da23bb1/e8ae8e1111454bc6afc3c9ceae193459/FLAG73cf44ae3 [2018-11-18 22:33:47,625 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 22:33:47,625 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/gauss_sum_true-unreach-call.i.p+cfa-reducer.c [2018-11-18 22:33:47,632 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11da23bb1/e8ae8e1111454bc6afc3c9ceae193459/FLAG73cf44ae3 [2018-11-18 22:33:47,992 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11da23bb1/e8ae8e1111454bc6afc3c9ceae193459 [2018-11-18 22:33:48,002 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 22:33:48,004 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 22:33:48,005 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 22:33:48,005 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 22:33:48,009 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 22:33:48,011 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:33:47" (1/1) ... [2018-11-18 22:33:48,014 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cd4950d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:33:48, skipping insertion in model container [2018-11-18 22:33:48,014 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:33:47" (1/1) ... [2018-11-18 22:33:48,025 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 22:33:48,055 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 22:33:48,310 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:33:48,318 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 22:33:48,340 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:33:48,361 INFO L195 MainTranslator]: Completed translation [2018-11-18 22:33:48,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:33:48 WrapperNode [2018-11-18 22:33:48,362 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 22:33:48,363 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 22:33:48,363 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 22:33:48,365 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 22:33:48,379 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:33:48" (1/1) ... [2018-11-18 22:33:48,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:33:48" (1/1) ... [2018-11-18 22:33:48,386 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:33:48" (1/1) ... [2018-11-18 22:33:48,387 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:33:48" (1/1) ... [2018-11-18 22:33:48,395 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:33:48" (1/1) ... [2018-11-18 22:33:48,398 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:33:48" (1/1) ... [2018-11-18 22:33:48,399 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:33:48" (1/1) ... [2018-11-18 22:33:48,401 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 22:33:48,402 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 22:33:48,402 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 22:33:48,402 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 22:33:48,403 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:33:48" (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-18 22:33:48,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 22:33:48,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 22:33:48,532 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 22:33:48,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 22:33:48,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-18 22:33:48,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 22:33:48,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 22:33:48,533 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 22:33:48,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 22:33:48,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 22:33:48,937 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 22:33:48,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:33:48 BoogieIcfgContainer [2018-11-18 22:33:48,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 22:33:48,939 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 22:33:48,940 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 22:33:48,943 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 22:33:48,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:33:47" (1/3) ... [2018-11-18 22:33:48,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e1e403 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:33:48, skipping insertion in model container [2018-11-18 22:33:48,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:33:48" (2/3) ... [2018-11-18 22:33:48,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e1e403 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:33:48, skipping insertion in model container [2018-11-18 22:33:48,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:33:48" (3/3) ... [2018-11-18 22:33:48,947 INFO L112 eAbstractionObserver]: Analyzing ICFG gauss_sum_true-unreach-call.i.p+cfa-reducer.c [2018-11-18 22:33:48,957 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 22:33:48,966 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 22:33:48,984 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 22:33:49,015 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 22:33:49,016 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 22:33:49,016 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 22:33:49,017 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 22:33:49,017 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 22:33:49,017 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 22:33:49,017 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 22:33:49,017 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 22:33:49,018 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 22:33:49,037 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2018-11-18 22:33:49,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-18 22:33:49,043 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:33:49,045 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:33:49,047 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:33:49,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:33:49,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1277702393, now seen corresponding path program 1 times [2018-11-18 22:33:49,058 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:33:49,059 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:33:49,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:33:49,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:33:49,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:33:49,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:33:49,312 INFO L256 TraceCheckUtils]: 0: Hoare triple {19#true} call ULTIMATE.init(); {19#true} is VALID [2018-11-18 22:33:49,315 INFO L273 TraceCheckUtils]: 1: Hoare triple {19#true} ~__return_main~0 := 0bv32;~__return_80~0 := 0bv32; {19#true} is VALID [2018-11-18 22:33:49,316 INFO L273 TraceCheckUtils]: 2: Hoare triple {19#true} assume true; {19#true} is VALID [2018-11-18 22:33:49,317 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19#true} {19#true} #28#return; {19#true} is VALID [2018-11-18 22:33:49,317 INFO L256 TraceCheckUtils]: 4: Hoare triple {19#true} call #t~ret2 := main(); {19#true} is VALID [2018-11-18 22:33:49,318 INFO L273 TraceCheckUtils]: 5: Hoare triple {19#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;~main__n~0 := #t~nondet1;havoc #t~nondet1; {19#true} is VALID [2018-11-18 22:33:49,319 INFO L273 TraceCheckUtils]: 6: Hoare triple {19#true} assume !!~bvsle32(1bv32, ~main__n~0); {42#(bvsle (_ bv1 32) main_~main__n~0)} is VALID [2018-11-18 22:33:49,320 INFO L273 TraceCheckUtils]: 7: Hoare triple {42#(bvsle (_ bv1 32) main_~main__n~0)} assume !!~bvsle32(~main__n~0, 1000bv32);~main__sum~0 := 0bv32;~main__i~0 := 1bv32; {46#(and (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv1 32) main_~main__i~0))} is VALID [2018-11-18 22:33:49,334 INFO L273 TraceCheckUtils]: 8: Hoare triple {46#(and (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv1 32) main_~main__i~0))} assume !~bvsle32(~main__i~0, ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvmul32(2bv32, ~main__sum~0) == ~bvmul32(~main__n~0, ~bvadd32(1bv32, ~main__n~0)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {20#false} is VALID [2018-11-18 22:33:49,335 INFO L273 TraceCheckUtils]: 9: Hoare triple {20#false} assume 0bv32 == ~__VERIFIER_assert__cond~0; {20#false} is VALID [2018-11-18 22:33:49,335 INFO L273 TraceCheckUtils]: 10: Hoare triple {20#false} assume !false; {20#false} is VALID [2018-11-18 22:33:49,338 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-18 22:33:49,339 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:33:49,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:33:49,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 22:33:49,348 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-18 22:33:49,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:33:49,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 22:33:49,420 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:33:49,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 22:33:49,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 22:33:49,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 22:33:49,434 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 4 states. [2018-11-18 22:33:49,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:33:49,894 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-18 22:33:49,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 22:33:49,894 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-18 22:33:49,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:33:49,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 22:33:49,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2018-11-18 22:33:49,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 22:33:49,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2018-11-18 22:33:49,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 30 transitions. [2018-11-18 22:33:50,004 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-18 22:33:50,014 INFO L225 Difference]: With dead ends: 26 [2018-11-18 22:33:50,014 INFO L226 Difference]: Without dead ends: 13 [2018-11-18 22:33:50,018 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 22:33:50,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-18 22:33:50,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-18 22:33:50,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:33:50,060 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2018-11-18 22:33:50,060 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-18 22:33:50,060 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-18 22:33:50,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:33:50,064 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-18 22:33:50,064 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-18 22:33:50,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:33:50,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:33:50,065 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-18 22:33:50,065 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-18 22:33:50,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:33:50,069 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-18 22:33:50,069 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-18 22:33:50,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:33:50,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:33:50,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:33:50,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:33:50,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 22:33:50,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-18 22:33:50,077 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-11-18 22:33:50,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:33:50,078 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-18 22:33:50,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 22:33:50,078 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-18 22:33:50,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-18 22:33:50,079 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:33:50,079 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:33:50,079 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:33:50,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:33:50,080 INFO L82 PathProgramCache]: Analyzing trace with hash -954130992, now seen corresponding path program 1 times [2018-11-18 22:33:50,080 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:33:50,080 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:33:50,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:33:50,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:33:50,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:33:50,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:33:50,475 INFO L256 TraceCheckUtils]: 0: Hoare triple {132#true} call ULTIMATE.init(); {132#true} is VALID [2018-11-18 22:33:50,476 INFO L273 TraceCheckUtils]: 1: Hoare triple {132#true} ~__return_main~0 := 0bv32;~__return_80~0 := 0bv32; {132#true} is VALID [2018-11-18 22:33:50,476 INFO L273 TraceCheckUtils]: 2: Hoare triple {132#true} assume true; {132#true} is VALID [2018-11-18 22:33:50,477 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {132#true} {132#true} #28#return; {132#true} is VALID [2018-11-18 22:33:50,477 INFO L256 TraceCheckUtils]: 4: Hoare triple {132#true} call #t~ret2 := main(); {132#true} is VALID [2018-11-18 22:33:50,477 INFO L273 TraceCheckUtils]: 5: Hoare triple {132#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;~main__n~0 := #t~nondet1;havoc #t~nondet1; {132#true} is VALID [2018-11-18 22:33:50,478 INFO L273 TraceCheckUtils]: 6: Hoare triple {132#true} assume !!~bvsle32(1bv32, ~main__n~0); {155#(bvsle (_ bv1 32) main_~main__n~0)} is VALID [2018-11-18 22:33:50,482 INFO L273 TraceCheckUtils]: 7: Hoare triple {155#(bvsle (_ bv1 32) main_~main__n~0)} assume !!~bvsle32(~main__n~0, 1000bv32);~main__sum~0 := 0bv32;~main__i~0 := 1bv32; {159#(and (= main_~main__sum~0 (_ bv0 32)) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv1 32) main_~main__i~0))} is VALID [2018-11-18 22:33:50,489 INFO L273 TraceCheckUtils]: 8: Hoare triple {159#(and (= main_~main__sum~0 (_ bv0 32)) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv1 32) main_~main__i~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {163#(and (bvsle (_ bv1 32) main_~main__n~0) (= (bvadd main_~main__sum~0 (_ bv1 32)) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (bvadd main_~main__sum~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:33:50,498 INFO L273 TraceCheckUtils]: 9: Hoare triple {163#(and (bvsle (_ bv1 32) main_~main__n~0) (= (bvadd main_~main__sum~0 (_ bv1 32)) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (bvadd main_~main__sum~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvsle32(~main__i~0, ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvmul32(2bv32, ~main__sum~0) == ~bvmul32(~main__n~0, ~bvadd32(1bv32, ~main__n~0)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {167#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:33:50,499 INFO L273 TraceCheckUtils]: 10: Hoare triple {167#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {133#false} is VALID [2018-11-18 22:33:50,500 INFO L273 TraceCheckUtils]: 11: Hoare triple {133#false} assume !false; {133#false} is VALID [2018-11-18 22:33:50,502 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-18 22:33:50,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:33:52,712 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-11-18 22:33:52,765 INFO L273 TraceCheckUtils]: 11: Hoare triple {133#false} assume !false; {133#false} is VALID [2018-11-18 22:33:52,767 INFO L273 TraceCheckUtils]: 10: Hoare triple {177#(not (= main_~__VERIFIER_assert__cond~0 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {133#false} is VALID [2018-11-18 22:33:52,776 INFO L273 TraceCheckUtils]: 9: Hoare triple {181#(or (bvsle main_~main__i~0 main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvmul (_ bv2 32) main_~main__sum~0)))} assume !~bvsle32(~main__i~0, ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvmul32(2bv32, ~main__sum~0) == ~bvmul32(~main__n~0, ~bvadd32(1bv32, ~main__n~0)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {177#(not (= main_~__VERIFIER_assert__cond~0 (_ bv0 32)))} is VALID [2018-11-18 22:33:54,787 INFO L273 TraceCheckUtils]: 8: Hoare triple {185#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0))) (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {181#(or (bvsle main_~main__i~0 main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvmul (_ bv2 32) main_~main__sum~0)))} is UNKNOWN [2018-11-18 22:33:54,794 INFO L273 TraceCheckUtils]: 7: Hoare triple {189#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (_ bv2 32)) (bvsle (_ bv2 32) main_~main__n~0))} assume !!~bvsle32(~main__n~0, 1000bv32);~main__sum~0 := 0bv32;~main__i~0 := 1bv32; {185#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0))) (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0))} is VALID [2018-11-18 22:33:54,802 INFO L273 TraceCheckUtils]: 6: Hoare triple {132#true} assume !!~bvsle32(1bv32, ~main__n~0); {189#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (_ bv2 32)) (bvsle (_ bv2 32) main_~main__n~0))} is VALID [2018-11-18 22:33:54,803 INFO L273 TraceCheckUtils]: 5: Hoare triple {132#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;~main__n~0 := #t~nondet1;havoc #t~nondet1; {132#true} is VALID [2018-11-18 22:33:54,803 INFO L256 TraceCheckUtils]: 4: Hoare triple {132#true} call #t~ret2 := main(); {132#true} is VALID [2018-11-18 22:33:54,804 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {132#true} {132#true} #28#return; {132#true} is VALID [2018-11-18 22:33:54,804 INFO L273 TraceCheckUtils]: 2: Hoare triple {132#true} assume true; {132#true} is VALID [2018-11-18 22:33:54,804 INFO L273 TraceCheckUtils]: 1: Hoare triple {132#true} ~__return_main~0 := 0bv32;~__return_80~0 := 0bv32; {132#true} is VALID [2018-11-18 22:33:54,805 INFO L256 TraceCheckUtils]: 0: Hoare triple {132#true} call ULTIMATE.init(); {132#true} is VALID [2018-11-18 22:33:54,806 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-18 22:33:54,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:33:54,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-18 22:33:54,811 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2018-11-18 22:33:54,812 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:33:54,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-18 22:33:54,983 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-18 22:33:54,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 22:33:54,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 22:33:54,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-18 22:33:54,985 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 10 states. [2018-11-18 22:33:56,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:33:56,230 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-18 22:33:56,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 22:33:56,230 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2018-11-18 22:33:56,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:33:56,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 22:33:56,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2018-11-18 22:33:56,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 22:33:56,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2018-11-18 22:33:56,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 20 transitions. [2018-11-18 22:33:56,294 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-18 22:33:56,296 INFO L225 Difference]: With dead ends: 19 [2018-11-18 22:33:56,296 INFO L226 Difference]: Without dead ends: 15 [2018-11-18 22:33:56,297 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-11-18 22:33:56,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-18 22:33:56,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-18 22:33:56,307 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:33:56,307 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-18 22:33:56,308 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-18 22:33:56,308 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-18 22:33:56,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:33:56,310 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-18 22:33:56,311 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-18 22:33:56,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:33:56,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:33:56,311 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-18 22:33:56,311 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-18 22:33:56,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:33:56,313 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-18 22:33:56,313 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-18 22:33:56,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:33:56,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:33:56,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:33:56,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:33:56,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 22:33:56,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-18 22:33:56,316 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-11-18 22:33:56,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:33:56,317 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-18 22:33:56,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 22:33:56,317 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-18 22:33:56,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 22:33:56,318 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:33:56,318 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:33:56,318 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:33:56,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:33:56,319 INFO L82 PathProgramCache]: Analyzing trace with hash -2093848400, now seen corresponding path program 2 times [2018-11-18 22:33:56,319 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:33:56,319 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:33:56,335 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 22:33:56,410 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:33:56,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:33:56,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:33:56,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:33:56,894 INFO L256 TraceCheckUtils]: 0: Hoare triple {299#true} call ULTIMATE.init(); {299#true} is VALID [2018-11-18 22:33:56,895 INFO L273 TraceCheckUtils]: 1: Hoare triple {299#true} ~__return_main~0 := 0bv32;~__return_80~0 := 0bv32; {299#true} is VALID [2018-11-18 22:33:56,896 INFO L273 TraceCheckUtils]: 2: Hoare triple {299#true} assume true; {299#true} is VALID [2018-11-18 22:33:56,896 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {299#true} {299#true} #28#return; {299#true} is VALID [2018-11-18 22:33:56,897 INFO L256 TraceCheckUtils]: 4: Hoare triple {299#true} call #t~ret2 := main(); {299#true} is VALID [2018-11-18 22:33:56,897 INFO L273 TraceCheckUtils]: 5: Hoare triple {299#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;~main__n~0 := #t~nondet1;havoc #t~nondet1; {299#true} is VALID [2018-11-18 22:33:56,898 INFO L273 TraceCheckUtils]: 6: Hoare triple {299#true} assume !!~bvsle32(1bv32, ~main__n~0); {322#(bvsle (_ bv1 32) main_~main__n~0)} is VALID [2018-11-18 22:33:56,899 INFO L273 TraceCheckUtils]: 7: Hoare triple {322#(bvsle (_ bv1 32) main_~main__n~0)} assume !!~bvsle32(~main__n~0, 1000bv32);~main__sum~0 := 0bv32;~main__i~0 := 1bv32; {326#(and (= main_~main__sum~0 (_ bv0 32)) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv1 32) main_~main__i~0))} is VALID [2018-11-18 22:33:56,900 INFO L273 TraceCheckUtils]: 8: Hoare triple {326#(and (= main_~main__sum~0 (_ bv0 32)) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv1 32) main_~main__i~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {330#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv2 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (bvadd main_~main__sum~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:33:56,902 INFO L273 TraceCheckUtils]: 9: Hoare triple {330#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv2 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (bvadd main_~main__sum~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {334#(and (= (_ bv3 32) main_~main__sum~0) (= (_ bv3 32) main_~main__i~0) (bvsle (_ bv2 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)))} is VALID [2018-11-18 22:33:56,904 INFO L273 TraceCheckUtils]: 10: Hoare triple {334#(and (= (_ bv3 32) main_~main__sum~0) (= (_ bv3 32) main_~main__i~0) (bvsle (_ bv2 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {338#(and (bvsle (_ bv3 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv4 32) main_~main__i~0) (= (_ bv6 32) main_~main__sum~0))} is VALID [2018-11-18 22:33:56,913 INFO L273 TraceCheckUtils]: 11: Hoare triple {338#(and (bvsle (_ bv3 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv4 32) main_~main__i~0) (= (_ bv6 32) main_~main__sum~0))} assume !~bvsle32(~main__i~0, ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvmul32(2bv32, ~main__sum~0) == ~bvmul32(~main__n~0, ~bvadd32(1bv32, ~main__n~0)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {342#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:33:56,914 INFO L273 TraceCheckUtils]: 12: Hoare triple {342#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {300#false} is VALID [2018-11-18 22:33:56,914 INFO L273 TraceCheckUtils]: 13: Hoare triple {300#false} assume !false; {300#false} is VALID [2018-11-18 22:33:56,916 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-18 22:33:56,916 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:33:59,340 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-18 22:34:01,781 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-18 22:34:04,257 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-18 22:34:04,430 INFO L273 TraceCheckUtils]: 13: Hoare triple {300#false} assume !false; {300#false} is VALID [2018-11-18 22:34:04,431 INFO L273 TraceCheckUtils]: 12: Hoare triple {352#(not (= main_~__VERIFIER_assert__cond~0 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {300#false} is VALID [2018-11-18 22:34:04,442 INFO L273 TraceCheckUtils]: 11: Hoare triple {356#(or (bvsle main_~main__i~0 main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvmul (_ bv2 32) main_~main__sum~0)))} assume !~bvsle32(~main__i~0, ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvmul32(2bv32, ~main__sum~0) == ~bvmul32(~main__n~0, ~bvadd32(1bv32, ~main__n~0)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {352#(not (= main_~__VERIFIER_assert__cond~0 (_ bv0 32)))} is VALID [2018-11-18 22:34:06,455 INFO L273 TraceCheckUtils]: 10: Hoare triple {360#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0))) (not (bvsle main_~main__i~0 main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {356#(or (bvsle main_~main__i~0 main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvmul (_ bv2 32) main_~main__sum~0)))} is UNKNOWN [2018-11-18 22:34:08,460 INFO L273 TraceCheckUtils]: 9: Hoare triple {364#(or (not (bvsle main_~main__i~0 main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv2 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv4 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv2 32))))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {360#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0))) (not (bvsle main_~main__i~0 main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0))} is UNKNOWN [2018-11-18 22:34:10,469 INFO L273 TraceCheckUtils]: 8: Hoare triple {368#(or (not (bvsle (bvadd main_~main__i~0 (_ bv2 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv6 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv6 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv3 32)) main_~main__n~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {364#(or (not (bvsle main_~main__i~0 main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv2 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv4 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv2 32))))} is UNKNOWN [2018-11-18 22:34:10,479 INFO L273 TraceCheckUtils]: 7: Hoare triple {299#true} assume !!~bvsle32(~main__n~0, 1000bv32);~main__sum~0 := 0bv32;~main__i~0 := 1bv32; {368#(or (not (bvsle (bvadd main_~main__i~0 (_ bv2 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv6 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv6 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv3 32)) main_~main__n~0))} is VALID [2018-11-18 22:34:10,480 INFO L273 TraceCheckUtils]: 6: Hoare triple {299#true} assume !!~bvsle32(1bv32, ~main__n~0); {299#true} is VALID [2018-11-18 22:34:10,480 INFO L273 TraceCheckUtils]: 5: Hoare triple {299#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;~main__n~0 := #t~nondet1;havoc #t~nondet1; {299#true} is VALID [2018-11-18 22:34:10,480 INFO L256 TraceCheckUtils]: 4: Hoare triple {299#true} call #t~ret2 := main(); {299#true} is VALID [2018-11-18 22:34:10,481 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {299#true} {299#true} #28#return; {299#true} is VALID [2018-11-18 22:34:10,481 INFO L273 TraceCheckUtils]: 2: Hoare triple {299#true} assume true; {299#true} is VALID [2018-11-18 22:34:10,481 INFO L273 TraceCheckUtils]: 1: Hoare triple {299#true} ~__return_main~0 := 0bv32;~__return_80~0 := 0bv32; {299#true} is VALID [2018-11-18 22:34:10,481 INFO L256 TraceCheckUtils]: 0: Hoare triple {299#true} call ULTIMATE.init(); {299#true} is VALID [2018-11-18 22:34:10,483 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-18 22:34:10,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:34:10,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-18 22:34:10,491 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2018-11-18 22:34:10,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:34:10,491 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-18 22:34:15,167 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 19 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2018-11-18 22:34:15,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 22:34:15,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 22:34:15,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-11-18 22:34:15,168 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 13 states. [2018-11-18 22:34:17,382 WARN L180 SmtUtils]: Spent 994.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2018-11-18 22:34:18,248 WARN L180 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 28 [2018-11-18 22:34:19,506 WARN L180 SmtUtils]: Spent 886.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2018-11-18 22:34:19,930 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-18 22:34:21,838 WARN L180 SmtUtils]: Spent 770.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2018-11-18 22:34:22,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:34:22,033 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-18 22:34:22,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 22:34:22,034 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2018-11-18 22:34:22,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:34:22,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 22:34:22,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2018-11-18 22:34:22,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 22:34:22,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2018-11-18 22:34:22,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 28 transitions. [2018-11-18 22:34:28,490 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 25 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2018-11-18 22:34:28,492 INFO L225 Difference]: With dead ends: 24 [2018-11-18 22:34:28,492 INFO L226 Difference]: Without dead ends: 20 [2018-11-18 22:34:28,493 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2018-11-18 22:34:28,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-18 22:34:28,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-18 22:34:28,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:34:28,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-18 22:34:28,516 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-18 22:34:28,517 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-18 22:34:28,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:34:28,518 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-18 22:34:28,519 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-18 22:34:28,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:34:28,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:34:28,519 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-18 22:34:28,520 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-18 22:34:28,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:34:28,524 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-18 22:34:28,524 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-18 22:34:28,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:34:28,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:34:28,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:34:28,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:34:28,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 22:34:28,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-11-18 22:34:28,527 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 14 [2018-11-18 22:34:28,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:34:28,527 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-11-18 22:34:28,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 22:34:28,528 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-18 22:34:28,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 22:34:28,528 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:34:28,529 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:34:28,529 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:34:28,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:34:28,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1859945351, now seen corresponding path program 3 times [2018-11-18 22:34:28,530 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:34:28,530 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:34:28,546 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-18 22:34:28,803 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-18 22:34:28,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:34:28,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:34:28,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:34:29,556 INFO L256 TraceCheckUtils]: 0: Hoare triple {519#true} call ULTIMATE.init(); {519#true} is VALID [2018-11-18 22:34:29,557 INFO L273 TraceCheckUtils]: 1: Hoare triple {519#true} ~__return_main~0 := 0bv32;~__return_80~0 := 0bv32; {519#true} is VALID [2018-11-18 22:34:29,557 INFO L273 TraceCheckUtils]: 2: Hoare triple {519#true} assume true; {519#true} is VALID [2018-11-18 22:34:29,557 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {519#true} {519#true} #28#return; {519#true} is VALID [2018-11-18 22:34:29,558 INFO L256 TraceCheckUtils]: 4: Hoare triple {519#true} call #t~ret2 := main(); {519#true} is VALID [2018-11-18 22:34:29,558 INFO L273 TraceCheckUtils]: 5: Hoare triple {519#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;~main__n~0 := #t~nondet1;havoc #t~nondet1; {519#true} is VALID [2018-11-18 22:34:29,558 INFO L273 TraceCheckUtils]: 6: Hoare triple {519#true} assume !!~bvsle32(1bv32, ~main__n~0); {542#(bvsle (_ bv1 32) main_~main__n~0)} is VALID [2018-11-18 22:34:29,559 INFO L273 TraceCheckUtils]: 7: Hoare triple {542#(bvsle (_ bv1 32) main_~main__n~0)} assume !!~bvsle32(~main__n~0, 1000bv32);~main__sum~0 := 0bv32;~main__i~0 := 1bv32; {546#(and (= main_~main__sum~0 (_ bv0 32)) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv1 32) main_~main__i~0))} is VALID [2018-11-18 22:34:29,560 INFO L273 TraceCheckUtils]: 8: Hoare triple {546#(and (= main_~main__sum~0 (_ bv0 32)) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv1 32) main_~main__i~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {550#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv2 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (bvadd main_~main__sum~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:34:29,562 INFO L273 TraceCheckUtils]: 9: Hoare triple {550#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv2 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (bvadd main_~main__sum~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {554#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv3 32) main_~main__sum~0) (= (_ bv3 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)))} is VALID [2018-11-18 22:34:29,564 INFO L273 TraceCheckUtils]: 10: Hoare triple {554#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv3 32) main_~main__sum~0) (= (_ bv3 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {558#(and (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv4 32) main_~main__i~0) (= (_ bv6 32) main_~main__sum~0))} is VALID [2018-11-18 22:34:29,566 INFO L273 TraceCheckUtils]: 11: Hoare triple {558#(and (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv4 32) main_~main__i~0) (= (_ bv6 32) main_~main__sum~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {562#(and (= (_ bv10 32) main_~main__sum~0) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv5 32) main_~main__i~0))} is VALID [2018-11-18 22:34:29,568 INFO L273 TraceCheckUtils]: 12: Hoare triple {562#(and (= (_ bv10 32) main_~main__sum~0) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv5 32) main_~main__i~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {566#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv6 32) main_~main__i~0) (= (_ bv15 32) main_~main__sum~0) (bvsle main_~main__n~0 (_ bv1000 32)))} is VALID [2018-11-18 22:34:29,569 INFO L273 TraceCheckUtils]: 13: Hoare triple {566#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv6 32) main_~main__i~0) (= (_ bv15 32) main_~main__sum~0) (bvsle main_~main__n~0 (_ bv1000 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {570#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv7 32) main_~main__i~0) (= (_ bv21 32) main_~main__sum~0) (bvsle main_~main__n~0 (_ bv1000 32)))} is VALID [2018-11-18 22:34:29,570 INFO L273 TraceCheckUtils]: 14: Hoare triple {570#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv7 32) main_~main__i~0) (= (_ bv21 32) main_~main__sum~0) (bvsle main_~main__n~0 (_ bv1000 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {574#(and (= (_ bv28 32) main_~main__sum~0) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv8 32) main_~main__i~0))} is VALID [2018-11-18 22:34:29,571 INFO L273 TraceCheckUtils]: 15: Hoare triple {574#(and (= (_ bv28 32) main_~main__sum~0) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv8 32) main_~main__i~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {578#(and (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv36 32) main_~main__sum~0) (= (_ bv9 32) main_~main__i~0) (bvsle (_ bv8 32) main_~main__n~0))} is VALID [2018-11-18 22:34:29,583 INFO L273 TraceCheckUtils]: 16: Hoare triple {578#(and (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv36 32) main_~main__sum~0) (= (_ bv9 32) main_~main__i~0) (bvsle (_ bv8 32) main_~main__n~0))} assume !~bvsle32(~main__i~0, ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvmul32(2bv32, ~main__sum~0) == ~bvmul32(~main__n~0, ~bvadd32(1bv32, ~main__n~0)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {582#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:34:29,584 INFO L273 TraceCheckUtils]: 17: Hoare triple {582#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {520#false} is VALID [2018-11-18 22:34:29,584 INFO L273 TraceCheckUtils]: 18: Hoare triple {520#false} assume !false; {520#false} is VALID [2018-11-18 22:34:29,586 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-18 22:34:29,587 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:34:34,596 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-18 22:34:37,037 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-18 22:34:39,553 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-18 22:34:44,715 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-18 22:34:47,396 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-18 22:34:50,105 INFO L273 TraceCheckUtils]: 18: Hoare triple {520#false} assume !false; {520#false} is VALID [2018-11-18 22:34:50,106 INFO L273 TraceCheckUtils]: 17: Hoare triple {592#(not (= main_~__VERIFIER_assert__cond~0 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {520#false} is VALID [2018-11-18 22:34:50,114 INFO L273 TraceCheckUtils]: 16: Hoare triple {596#(or (bvsle main_~main__i~0 main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvmul (_ bv2 32) main_~main__sum~0)))} assume !~bvsle32(~main__i~0, ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvmul32(2bv32, ~main__sum~0) == ~bvmul32(~main__n~0, ~bvadd32(1bv32, ~main__n~0)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {592#(not (= main_~__VERIFIER_assert__cond~0 (_ bv0 32)))} is VALID [2018-11-18 22:34:52,119 INFO L273 TraceCheckUtils]: 15: Hoare triple {600#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0))) (not (bvsle main_~main__i~0 main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {596#(or (bvsle main_~main__i~0 main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvmul (_ bv2 32) main_~main__sum~0)))} is UNKNOWN [2018-11-18 22:34:54,125 INFO L273 TraceCheckUtils]: 14: Hoare triple {604#(or (not (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv2 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv4 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv2 32))))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {600#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0))) (not (bvsle main_~main__i~0 main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0))} is UNKNOWN [2018-11-18 22:34:56,132 INFO L273 TraceCheckUtils]: 13: Hoare triple {608#(or (not (bvsle (bvadd main_~main__i~0 (_ bv2 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv6 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv6 32))) (bvsle (bvadd main_~main__i~0 (_ bv3 32)) main_~main__n~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {604#(or (not (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv2 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv4 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv2 32))))} is UNKNOWN [2018-11-18 22:34:58,138 INFO L273 TraceCheckUtils]: 12: Hoare triple {612#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv8 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv12 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv3 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv4 32)) main_~main__n~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {608#(or (not (bvsle (bvadd main_~main__i~0 (_ bv2 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv6 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv6 32))) (bvsle (bvadd main_~main__i~0 (_ bv3 32)) main_~main__n~0))} is UNKNOWN [2018-11-18 22:35:00,144 INFO L273 TraceCheckUtils]: 11: Hoare triple {616#(or (not (bvsle (bvadd main_~main__i~0 (_ bv4 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv5 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv10 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv20 32))))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {612#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv8 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv12 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv3 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv4 32)) main_~main__n~0))} is UNKNOWN [2018-11-18 22:35:02,153 INFO L273 TraceCheckUtils]: 10: Hoare triple {620#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv12 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv30 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv5 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv6 32)) main_~main__n~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {616#(or (not (bvsle (bvadd main_~main__i~0 (_ bv4 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv5 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv10 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv20 32))))} is UNKNOWN [2018-11-18 22:35:04,159 INFO L273 TraceCheckUtils]: 9: Hoare triple {624#(or (not (bvsle (bvadd main_~main__i~0 (_ bv6 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv7 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv14 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv42 32))))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {620#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv12 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv30 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv5 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv6 32)) main_~main__n~0))} is UNKNOWN [2018-11-18 22:35:06,165 INFO L273 TraceCheckUtils]: 8: Hoare triple {628#(or (bvsle (bvadd main_~main__i~0 (_ bv8 32)) main_~main__n~0) (not (bvsle (bvadd main_~main__i~0 (_ bv7 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv16 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv56 32))))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {624#(or (not (bvsle (bvadd main_~main__i~0 (_ bv6 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv7 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv14 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv42 32))))} is UNKNOWN [2018-11-18 22:35:06,174 INFO L273 TraceCheckUtils]: 7: Hoare triple {519#true} assume !!~bvsle32(~main__n~0, 1000bv32);~main__sum~0 := 0bv32;~main__i~0 := 1bv32; {628#(or (bvsle (bvadd main_~main__i~0 (_ bv8 32)) main_~main__n~0) (not (bvsle (bvadd main_~main__i~0 (_ bv7 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv16 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv56 32))))} is VALID [2018-11-18 22:35:06,174 INFO L273 TraceCheckUtils]: 6: Hoare triple {519#true} assume !!~bvsle32(1bv32, ~main__n~0); {519#true} is VALID [2018-11-18 22:35:06,175 INFO L273 TraceCheckUtils]: 5: Hoare triple {519#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;~main__n~0 := #t~nondet1;havoc #t~nondet1; {519#true} is VALID [2018-11-18 22:35:06,175 INFO L256 TraceCheckUtils]: 4: Hoare triple {519#true} call #t~ret2 := main(); {519#true} is VALID [2018-11-18 22:35:06,175 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {519#true} {519#true} #28#return; {519#true} is VALID [2018-11-18 22:35:06,175 INFO L273 TraceCheckUtils]: 2: Hoare triple {519#true} assume true; {519#true} is VALID [2018-11-18 22:35:06,176 INFO L273 TraceCheckUtils]: 1: Hoare triple {519#true} ~__return_main~0 := 0bv32;~__return_80~0 := 0bv32; {519#true} is VALID [2018-11-18 22:35:06,176 INFO L256 TraceCheckUtils]: 0: Hoare triple {519#true} call ULTIMATE.init(); {519#true} is VALID [2018-11-18 22:35:06,179 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-18 22:35:06,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:35:06,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2018-11-18 22:35:06,182 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 19 [2018-11-18 22:35:06,182 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:35:06,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-18 22:35:20,781 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 24 inductive. 0 not inductive. 7 times theorem prover too weak to decide inductivity. [2018-11-18 22:35:20,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-18 22:35:20,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-18 22:35:20,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2018-11-18 22:35:20,782 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 23 states. [2018-11-18 22:35:23,129 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-18 22:35:23,614 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-18 22:35:24,039 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-18 22:35:24,494 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-18 22:35:25,006 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-18 22:35:25,478 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-18 22:35:27,482 WARN L180 SmtUtils]: Spent 1.04 s on a formula simplification that was a NOOP. DAG size: 83 [2018-11-18 22:35:29,307 WARN L180 SmtUtils]: Spent 816.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2018-11-18 22:35:30,850 WARN L180 SmtUtils]: Spent 1.05 s on a formula simplification that was a NOOP. DAG size: 88 [2018-11-18 22:35:32,305 WARN L180 SmtUtils]: Spent 681.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-11-18 22:35:33,802 WARN L180 SmtUtils]: Spent 562.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-11-18 22:35:35,341 WARN L180 SmtUtils]: Spent 429.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-18 22:35:36,839 WARN L180 SmtUtils]: Spent 383.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-18 22:35:38,266 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-11-18 22:35:39,511 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-18 22:35:44,331 WARN L180 SmtUtils]: Spent 800.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2018-11-18 22:35:45,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:35:45,182 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2018-11-18 22:35:45,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-18 22:35:45,183 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 19 [2018-11-18 22:35:45,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:35:45,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 22:35:45,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 43 transitions. [2018-11-18 22:35:45,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 22:35:45,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 43 transitions. [2018-11-18 22:35:45,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 43 transitions. [2018-11-18 22:36:04,681 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 35 inductive. 0 not inductive. 8 times theorem prover too weak to decide inductivity. [2018-11-18 22:36:04,684 INFO L225 Difference]: With dead ends: 34 [2018-11-18 22:36:04,684 INFO L226 Difference]: Without dead ends: 30 [2018-11-18 22:36:04,685 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=472, Invalid=1168, Unknown=0, NotChecked=0, Total=1640 [2018-11-18 22:36:04,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-18 22:36:04,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-18 22:36:04,796 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:36:04,797 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2018-11-18 22:36:04,797 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-18 22:36:04,797 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-18 22:36:04,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:36:04,800 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-18 22:36:04,800 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-18 22:36:04,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:36:04,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:36:04,800 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-18 22:36:04,800 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-18 22:36:04,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:36:04,803 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-18 22:36:04,803 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-18 22:36:04,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:36:04,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:36:04,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:36:04,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:36:04,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 22:36:04,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-11-18 22:36:04,806 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 19 [2018-11-18 22:36:04,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:36:04,806 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-11-18 22:36:04,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-18 22:36:04,807 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-18 22:36:04,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 22:36:04,808 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:36:04,808 INFO L375 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:36:04,808 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:36:04,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:36:04,808 INFO L82 PathProgramCache]: Analyzing trace with hash 800608551, now seen corresponding path program 4 times [2018-11-18 22:36:04,809 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:36:04,809 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:36:04,831 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:36:04,933 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:36:04,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:36:04,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:36:04,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:36:05,274 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-18 22:36:06,616 INFO L256 TraceCheckUtils]: 0: Hoare triple {861#true} call ULTIMATE.init(); {861#true} is VALID [2018-11-18 22:36:06,617 INFO L273 TraceCheckUtils]: 1: Hoare triple {861#true} ~__return_main~0 := 0bv32;~__return_80~0 := 0bv32; {861#true} is VALID [2018-11-18 22:36:06,617 INFO L273 TraceCheckUtils]: 2: Hoare triple {861#true} assume true; {861#true} is VALID [2018-11-18 22:36:06,617 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {861#true} {861#true} #28#return; {861#true} is VALID [2018-11-18 22:36:06,617 INFO L256 TraceCheckUtils]: 4: Hoare triple {861#true} call #t~ret2 := main(); {861#true} is VALID [2018-11-18 22:36:06,618 INFO L273 TraceCheckUtils]: 5: Hoare triple {861#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;~main__n~0 := #t~nondet1;havoc #t~nondet1; {861#true} is VALID [2018-11-18 22:36:06,622 INFO L273 TraceCheckUtils]: 6: Hoare triple {861#true} assume !!~bvsle32(1bv32, ~main__n~0); {884#(bvsle (_ bv1 32) main_~main__n~0)} is VALID [2018-11-18 22:36:06,623 INFO L273 TraceCheckUtils]: 7: Hoare triple {884#(bvsle (_ bv1 32) main_~main__n~0)} assume !!~bvsle32(~main__n~0, 1000bv32);~main__sum~0 := 0bv32;~main__i~0 := 1bv32; {888#(and (= main_~main__sum~0 (_ bv0 32)) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv1 32) main_~main__i~0))} is VALID [2018-11-18 22:36:06,624 INFO L273 TraceCheckUtils]: 8: Hoare triple {888#(and (= main_~main__sum~0 (_ bv0 32)) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv1 32) main_~main__i~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {892#(and (= (_ bv1 32) main_~main__sum~0) (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv2 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)))} is VALID [2018-11-18 22:36:06,626 INFO L273 TraceCheckUtils]: 9: Hoare triple {892#(and (= (_ bv1 32) main_~main__sum~0) (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv2 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {896#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv3 32) main_~main__sum~0) (= (_ bv3 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)))} is VALID [2018-11-18 22:36:06,628 INFO L273 TraceCheckUtils]: 10: Hoare triple {896#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv3 32) main_~main__sum~0) (= (_ bv3 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {900#(and (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (bvadd main_~main__i~0 (_ bv2 32)) main_~main__sum~0) (= (_ bv6 32) main_~main__sum~0))} is VALID [2018-11-18 22:36:06,629 INFO L273 TraceCheckUtils]: 11: Hoare triple {900#(and (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (bvadd main_~main__i~0 (_ bv2 32)) main_~main__sum~0) (= (_ bv6 32) main_~main__sum~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {904#(and (= (bvadd main_~main__i~0 (_ bv5 32)) main_~main__sum~0) (= (_ bv10 32) main_~main__sum~0) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)))} is VALID [2018-11-18 22:36:06,630 INFO L273 TraceCheckUtils]: 12: Hoare triple {904#(and (= (bvadd main_~main__i~0 (_ bv5 32)) main_~main__sum~0) (= (_ bv10 32) main_~main__sum~0) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {908#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv6 32) main_~main__i~0) (= (_ bv15 32) main_~main__sum~0) (bvsle main_~main__n~0 (_ bv1000 32)))} is VALID [2018-11-18 22:36:06,633 INFO L273 TraceCheckUtils]: 13: Hoare triple {908#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv6 32) main_~main__i~0) (= (_ bv15 32) main_~main__sum~0) (bvsle main_~main__n~0 (_ bv1000 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {912#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv21 32) main_~main__sum~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (bvadd main_~main__sum~0 (_ bv4294967282 32)) main_~main__i~0))} is VALID [2018-11-18 22:36:06,637 INFO L273 TraceCheckUtils]: 14: Hoare triple {912#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv21 32) main_~main__sum~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (bvadd main_~main__sum~0 (_ bv4294967282 32)) main_~main__i~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {916#(and (= (_ bv28 32) main_~main__sum~0) (= (bvadd main_~main__sum~0 (_ bv4294967276 32)) main_~main__i~0) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)))} is VALID [2018-11-18 22:36:06,641 INFO L273 TraceCheckUtils]: 15: Hoare triple {916#(and (= (_ bv28 32) main_~main__sum~0) (= (bvadd main_~main__sum~0 (_ bv4294967276 32)) main_~main__i~0) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {920#(and (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv9 32) main_~main__i~0) (= (bvadd main_~main__sum~0 (_ bv4294967260 32)) (_ bv0 32)))} is VALID [2018-11-18 22:36:06,642 INFO L273 TraceCheckUtils]: 16: Hoare triple {920#(and (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv9 32) main_~main__i~0) (= (bvadd main_~main__sum~0 (_ bv4294967260 32)) (_ bv0 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {924#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv10 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv45 32) main_~main__sum~0))} is VALID [2018-11-18 22:36:06,643 INFO L273 TraceCheckUtils]: 17: Hoare triple {924#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv10 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv45 32) main_~main__sum~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {928#(and (= (_ bv11 32) main_~main__i~0) (= (_ bv55 32) main_~main__sum~0) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)))} is VALID [2018-11-18 22:36:06,644 INFO L273 TraceCheckUtils]: 18: Hoare triple {928#(and (= (_ bv11 32) main_~main__i~0) (= (_ bv55 32) main_~main__sum~0) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {932#(and (= (_ bv66 32) main_~main__sum~0) (= (_ bv12 32) main_~main__i~0) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)))} is VALID [2018-11-18 22:36:06,646 INFO L273 TraceCheckUtils]: 19: Hoare triple {932#(and (= (_ bv66 32) main_~main__sum~0) (= (_ bv12 32) main_~main__i~0) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {936#(and (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv78 32) main_~main__sum~0) (= (_ bv13 32) main_~main__i~0))} is VALID [2018-11-18 22:36:06,662 INFO L273 TraceCheckUtils]: 20: Hoare triple {936#(and (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv78 32) main_~main__sum~0) (= (_ bv13 32) main_~main__i~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {940#(and (= (_ bv91 32) main_~main__sum~0) (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv14 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)))} is VALID [2018-11-18 22:36:06,663 INFO L273 TraceCheckUtils]: 21: Hoare triple {940#(and (= (_ bv91 32) main_~main__sum~0) (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv14 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {944#(and (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (bvadd main_~main__sum~0 (_ bv4294967206 32)) main_~main__i~0) (= (_ bv105 32) main_~main__sum~0))} is VALID [2018-11-18 22:36:06,666 INFO L273 TraceCheckUtils]: 22: Hoare triple {944#(and (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (bvadd main_~main__sum~0 (_ bv4294967206 32)) main_~main__i~0) (= (_ bv105 32) main_~main__sum~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {948#(and (= (_ bv16 32) main_~main__i~0) (= (_ bv120 32) main_~main__sum~0) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)))} is VALID [2018-11-18 22:36:06,669 INFO L273 TraceCheckUtils]: 23: Hoare triple {948#(and (= (_ bv16 32) main_~main__i~0) (= (_ bv120 32) main_~main__sum~0) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {952#(and (bvsle (_ bv16 32) main_~main__n~0) (= (_ bv17 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv136 32) main_~main__sum~0))} is VALID [2018-11-18 22:36:06,670 INFO L273 TraceCheckUtils]: 24: Hoare triple {952#(and (bvsle (_ bv16 32) main_~main__n~0) (= (_ bv17 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv136 32) main_~main__sum~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {956#(and (= (bvadd main_~main__sum~0 (_ bv4294967143 32)) (_ bv0 32)) (bvsle (_ bv16 32) main_~main__n~0) (= (bvadd main_~main__sum~0 (_ bv4294967161 32)) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)))} is VALID [2018-11-18 22:36:06,674 INFO L273 TraceCheckUtils]: 25: Hoare triple {956#(and (= (bvadd main_~main__sum~0 (_ bv4294967143 32)) (_ bv0 32)) (bvsle (_ bv16 32) main_~main__n~0) (= (bvadd main_~main__sum~0 (_ bv4294967161 32)) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {960#(and (= (_ bv171 32) main_~main__sum~0) (bvsle (bvadd main_~main__sum~0 (_ bv4294967143 32)) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (bvadd main_~main__sum~0 (_ bv4294967144 32)) main_~main__i~0))} is VALID [2018-11-18 22:36:06,684 INFO L273 TraceCheckUtils]: 26: Hoare triple {960#(and (= (_ bv171 32) main_~main__sum~0) (bvsle (bvadd main_~main__sum~0 (_ bv4294967143 32)) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (bvadd main_~main__sum~0 (_ bv4294967144 32)) main_~main__i~0))} assume !~bvsle32(~main__i~0, ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvmul32(2bv32, ~main__sum~0) == ~bvmul32(~main__n~0, ~bvadd32(1bv32, ~main__n~0)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {964#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:36:06,688 INFO L273 TraceCheckUtils]: 27: Hoare triple {964#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {862#false} is VALID [2018-11-18 22:36:06,689 INFO L273 TraceCheckUtils]: 28: Hoare triple {862#false} assume !false; {862#false} is VALID [2018-11-18 22:36:06,691 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-18 22:36:06,692 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:36:11,868 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-18 22:36:14,466 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-18 22:36:17,204 WARN L180 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-18 22:36:19,990 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-18 22:36:22,814 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-18 22:36:25,709 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-18 22:36:28,698 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-18 22:36:31,718 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-18 22:36:34,663 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-18 22:36:37,814 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-18 22:36:40,887 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-18 22:36:44,110 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-18 22:36:47,576 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-18 22:36:50,964 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-18 22:36:54,432 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-18 22:36:57,617 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-18 22:37:01,173 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-18 22:37:01,229 INFO L273 TraceCheckUtils]: 28: Hoare triple {862#false} assume !false; {862#false} is VALID [2018-11-18 22:37:01,230 INFO L273 TraceCheckUtils]: 27: Hoare triple {974#(not (= main_~__VERIFIER_assert__cond~0 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {862#false} is VALID [2018-11-18 22:37:01,239 INFO L273 TraceCheckUtils]: 26: Hoare triple {978#(or (bvsle main_~main__i~0 main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvmul (_ bv2 32) main_~main__sum~0)))} assume !~bvsle32(~main__i~0, ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvmul32(2bv32, ~main__sum~0) == ~bvmul32(~main__n~0, ~bvadd32(1bv32, ~main__n~0)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {974#(not (= main_~__VERIFIER_assert__cond~0 (_ bv0 32)))} is VALID [2018-11-18 22:37:03,249 INFO L273 TraceCheckUtils]: 25: Hoare triple {982#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0))) (not (bvsle main_~main__i~0 main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {978#(or (bvsle main_~main__i~0 main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvmul (_ bv2 32) main_~main__sum~0)))} is UNKNOWN [2018-11-18 22:37:05,256 INFO L273 TraceCheckUtils]: 24: Hoare triple {986#(or (not (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv2 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv4 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv2 32))))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {982#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0))) (not (bvsle main_~main__i~0 main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0))} is UNKNOWN [2018-11-18 22:37:07,263 INFO L273 TraceCheckUtils]: 23: Hoare triple {990#(or (not (bvsle (bvadd main_~main__i~0 (_ bv2 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv6 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv6 32))) (not (bvsle main_~main__i~0 main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv3 32)) main_~main__n~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {986#(or (not (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv2 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv4 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv2 32))))} is UNKNOWN [2018-11-18 22:37:09,270 INFO L273 TraceCheckUtils]: 22: Hoare triple {994#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv8 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv12 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv3 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv4 32)) main_~main__n~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {990#(or (not (bvsle (bvadd main_~main__i~0 (_ bv2 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv6 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv6 32))) (not (bvsle main_~main__i~0 main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv3 32)) main_~main__n~0))} is UNKNOWN [2018-11-18 22:37:11,277 INFO L273 TraceCheckUtils]: 21: Hoare triple {998#(or (not (bvsle (bvadd main_~main__i~0 (_ bv2 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv4 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv5 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv10 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv20 32))))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {994#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv8 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv12 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv3 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv4 32)) main_~main__n~0))} is UNKNOWN [2018-11-18 22:37:13,284 INFO L273 TraceCheckUtils]: 20: Hoare triple {1002#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv12 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv30 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv3 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv5 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv6 32)) main_~main__n~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {998#(or (not (bvsle (bvadd main_~main__i~0 (_ bv2 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv4 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv5 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv10 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv20 32))))} is UNKNOWN [2018-11-18 22:37:15,294 INFO L273 TraceCheckUtils]: 19: Hoare triple {1006#(or (not (bvsle (bvadd main_~main__i~0 (_ bv6 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv4 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv7 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv14 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv42 32))))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {1002#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv12 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv30 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv3 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv5 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv6 32)) main_~main__n~0))} is UNKNOWN [2018-11-18 22:37:17,302 INFO L273 TraceCheckUtils]: 18: Hoare triple {1010#(or (bvsle (bvadd main_~main__i~0 (_ bv8 32)) main_~main__n~0) (not (bvsle (bvadd main_~main__i~0 (_ bv5 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv7 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv16 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv56 32))))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {1006#(or (not (bvsle (bvadd main_~main__i~0 (_ bv6 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv4 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv7 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv14 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv42 32))))} is UNKNOWN [2018-11-18 22:37:19,309 INFO L273 TraceCheckUtils]: 17: Hoare triple {1014#(or (not (bvsle (bvadd main_~main__i~0 (_ bv6 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv9 32)) main_~main__n~0) (not (bvsle (bvadd main_~main__i~0 (_ bv8 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv18 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv72 32))))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {1010#(or (bvsle (bvadd main_~main__i~0 (_ bv8 32)) main_~main__n~0) (not (bvsle (bvadd main_~main__i~0 (_ bv5 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv7 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv16 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv56 32))))} is UNKNOWN [2018-11-18 22:37:21,316 INFO L273 TraceCheckUtils]: 16: Hoare triple {1018#(or (bvsle (bvadd main_~main__i~0 (_ bv10 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv20 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv90 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv9 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv7 32)) main_~main__n~0)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {1014#(or (not (bvsle (bvadd main_~main__i~0 (_ bv6 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv9 32)) main_~main__n~0) (not (bvsle (bvadd main_~main__i~0 (_ bv8 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv18 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv72 32))))} is UNKNOWN [2018-11-18 22:37:23,323 INFO L273 TraceCheckUtils]: 15: Hoare triple {1022#(or (not (bvsle (bvadd main_~main__i~0 (_ bv10 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv11 32)) main_~main__n~0) (not (bvsle (bvadd main_~main__i~0 (_ bv8 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv22 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv110 32))))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {1018#(or (bvsle (bvadd main_~main__i~0 (_ bv10 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv20 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv90 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv9 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv7 32)) main_~main__n~0)))} is UNKNOWN [2018-11-18 22:37:25,332 INFO L273 TraceCheckUtils]: 14: Hoare triple {1026#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv24 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv132 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv11 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv12 32)) main_~main__n~0) (not (bvsle (bvadd main_~main__i~0 (_ bv9 32)) main_~main__n~0)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {1022#(or (not (bvsle (bvadd main_~main__i~0 (_ bv10 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv11 32)) main_~main__n~0) (not (bvsle (bvadd main_~main__i~0 (_ bv8 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv22 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv110 32))))} is UNKNOWN [2018-11-18 22:37:27,339 INFO L273 TraceCheckUtils]: 13: Hoare triple {1030#(or (not (bvsle (bvadd main_~main__i~0 (_ bv12 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv10 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv26 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv156 32))) (bvsle (bvadd main_~main__i~0 (_ bv13 32)) main_~main__n~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {1026#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv24 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv132 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv11 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv12 32)) main_~main__n~0) (not (bvsle (bvadd main_~main__i~0 (_ bv9 32)) main_~main__n~0)))} is UNKNOWN [2018-11-18 22:37:29,347 INFO L273 TraceCheckUtils]: 12: Hoare triple {1034#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv28 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv182 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv11 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv13 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv14 32)) main_~main__n~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {1030#(or (not (bvsle (bvadd main_~main__i~0 (_ bv12 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv10 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv26 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv156 32))) (bvsle (bvadd main_~main__i~0 (_ bv13 32)) main_~main__n~0))} is UNKNOWN [2018-11-18 22:37:31,355 INFO L273 TraceCheckUtils]: 11: Hoare triple {1038#(or (not (bvsle (bvadd main_~main__i~0 (_ bv14 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv12 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv15 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv30 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv210 32))))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {1034#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv28 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv182 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv11 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv13 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv14 32)) main_~main__n~0))} is UNKNOWN [2018-11-18 22:37:33,362 INFO L273 TraceCheckUtils]: 10: Hoare triple {1042#(or (bvsle (bvadd main_~main__i~0 (_ bv16 32)) main_~main__n~0) (not (bvsle (bvadd main_~main__i~0 (_ bv15 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv13 32)) main_~main__n~0)) (= (bvadd (bvmul (_ bv32 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv240 32)) (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32)))))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {1038#(or (not (bvsle (bvadd main_~main__i~0 (_ bv14 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv12 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv15 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv30 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv210 32))))} is UNKNOWN [2018-11-18 22:37:35,370 INFO L273 TraceCheckUtils]: 9: Hoare triple {1046#(or (not (bvsle (bvadd main_~main__i~0 (_ bv14 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv34 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv272 32))) (bvsle (bvadd main_~main__i~0 (_ bv17 32)) main_~main__n~0) (not (bvsle (bvadd main_~main__i~0 (_ bv16 32)) main_~main__n~0)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {1042#(or (bvsle (bvadd main_~main__i~0 (_ bv16 32)) main_~main__n~0) (not (bvsle (bvadd main_~main__i~0 (_ bv15 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv13 32)) main_~main__n~0)) (= (bvadd (bvmul (_ bv32 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv240 32)) (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32)))))} is UNKNOWN