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-Const.epf -i ../../../trunk/examples/svcomp/loop-invgen/down_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:30:40,323 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:30:40,326 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:30:40,339 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:30:40,340 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:30:40,341 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:30:40,342 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:30:40,344 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:30:40,346 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:30:40,349 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:30:40,350 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:30:40,352 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:30:40,353 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:30:40,356 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:30:40,364 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:30:40,365 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:30:40,366 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:30:40,369 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:30:40,372 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:30:40,375 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:30:40,376 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:30:40,377 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:30:40,379 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:30:40,379 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:30:40,380 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:30:40,381 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:30:40,382 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:30:40,383 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:30:40,384 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:30:40,385 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:30:40,385 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:30:40,386 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:30:40,386 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:30:40,386 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:30:40,387 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:30:40,388 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:30:40,388 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf [2018-11-14 18:30:40,403 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:30:40,403 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:30:40,404 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:30:40,404 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:30:40,405 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:30:40,405 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:30:40,405 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:30:40,406 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:30:40,406 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:30:40,406 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:30:40,406 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:30:40,406 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:30:40,407 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:30:40,407 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:30:40,407 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 18:30:40,407 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 18:30:40,407 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:30:40,408 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:30:40,408 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:30:40,408 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:30:40,408 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:30:40,408 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:30:40,409 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:30:40,409 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:30:40,409 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:30:40,409 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:30:40,409 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:30:40,410 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:30:40,410 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 18:30:40,410 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:30:40,410 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 18:30:40,410 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 18:30:40,410 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:30:40,466 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:30:40,482 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:30:40,486 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:30:40,488 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:30:40,488 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:30:40,489 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/down_true-unreach-call_true-termination.i [2018-11-14 18:30:40,564 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54170c0c6/56ec100cbf1d41379ab851977a4c2c2a/FLAG4ae3c2921 [2018-11-14 18:30:41,052 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:30:41,053 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/down_true-unreach-call_true-termination.i [2018-11-14 18:30:41,059 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54170c0c6/56ec100cbf1d41379ab851977a4c2c2a/FLAG4ae3c2921 [2018-11-14 18:30:41,073 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54170c0c6/56ec100cbf1d41379ab851977a4c2c2a [2018-11-14 18:30:41,084 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:30:41,087 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:30:41,088 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:30:41,089 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:30:41,094 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:30:41,095 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:30:41" (1/1) ... [2018-11-14 18:30:41,099 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c8ae422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:30:41, skipping insertion in model container [2018-11-14 18:30:41,099 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:30:41" (1/1) ... [2018-11-14 18:30:41,111 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:30:41,136 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:30:41,346 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:30:41,351 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:30:41,369 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:30:41,385 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:30:41,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:30:41 WrapperNode [2018-11-14 18:30:41,386 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:30:41,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:30:41,387 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:30:41,387 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:30:41,403 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:30:41" (1/1) ... [2018-11-14 18:30:41,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:30:41" (1/1) ... [2018-11-14 18:30:41,411 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:30:41" (1/1) ... [2018-11-14 18:30:41,412 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:30:41" (1/1) ... [2018-11-14 18:30:41,420 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:30:41" (1/1) ... [2018-11-14 18:30:41,426 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:30:41" (1/1) ... [2018-11-14 18:30:41,427 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:30:41" (1/1) ... [2018-11-14 18:30:41,429 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:30:41,430 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:30:41,430 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:30:41,430 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:30:41,431 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:30:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:30:41,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:30:41,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:30:41,576 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 18:30:41,576 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:30:41,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:30:41,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 18:30:41,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 18:30:41,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 18:30:41,576 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:30:41,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:30:41,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:30:42,058 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:30:42,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:30:42 BoogieIcfgContainer [2018-11-14 18:30:42,059 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:30:42,061 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:30:42,061 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:30:42,064 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:30:42,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:30:41" (1/3) ... [2018-11-14 18:30:42,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31fd9d05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:30:42, skipping insertion in model container [2018-11-14 18:30:42,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:30:41" (2/3) ... [2018-11-14 18:30:42,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31fd9d05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:30:42, skipping insertion in model container [2018-11-14 18:30:42,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:30:42" (3/3) ... [2018-11-14 18:30:42,068 INFO L112 eAbstractionObserver]: Analyzing ICFG down_true-unreach-call_true-termination.i [2018-11-14 18:30:42,078 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:30:42,086 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:30:42,100 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:30:42,133 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:30:42,134 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:30:42,134 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:30:42,135 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:30:42,135 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:30:42,135 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:30:42,135 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:30:42,135 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:30:42,135 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:30:42,155 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-14 18:30:42,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-14 18:30:42,162 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:30:42,163 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:30:42,168 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:30:42,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:30:42,174 INFO L82 PathProgramCache]: Analyzing trace with hash 123585964, now seen corresponding path program 1 times [2018-11-14 18:30:42,179 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:30:42,179 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-14 18:30:42,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:30:42,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:30:42,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:30:42,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:30:42,303 INFO L256 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {26#true} is VALID [2018-11-14 18:30:42,307 INFO L273 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2018-11-14 18:30:42,307 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #48#return; {26#true} is VALID [2018-11-14 18:30:42,308 INFO L256 TraceCheckUtils]: 3: Hoare triple {26#true} call #t~ret6 := main(); {26#true} is VALID [2018-11-14 18:30:42,308 INFO L273 TraceCheckUtils]: 4: Hoare triple {26#true} havoc ~n~0;~k~0 := 0bv32;~i~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {26#true} is VALID [2018-11-14 18:30:42,311 INFO L273 TraceCheckUtils]: 5: Hoare triple {26#true} assume !true; {27#false} is VALID [2018-11-14 18:30:42,311 INFO L273 TraceCheckUtils]: 6: Hoare triple {27#false} ~j~0 := ~n~0; {27#false} is VALID [2018-11-14 18:30:42,312 INFO L273 TraceCheckUtils]: 7: Hoare triple {27#false} assume true; {27#false} is VALID [2018-11-14 18:30:42,312 INFO L273 TraceCheckUtils]: 8: Hoare triple {27#false} assume !!~bvsgt32(~j~0, 0bv32); {27#false} is VALID [2018-11-14 18:30:42,312 INFO L256 TraceCheckUtils]: 9: Hoare triple {27#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {27#false} is VALID [2018-11-14 18:30:42,313 INFO L273 TraceCheckUtils]: 10: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2018-11-14 18:30:42,313 INFO L273 TraceCheckUtils]: 11: Hoare triple {27#false} assume ~cond == 0bv32; {27#false} is VALID [2018-11-14 18:30:42,314 INFO L273 TraceCheckUtils]: 12: Hoare triple {27#false} assume !false; {27#false} is VALID [2018-11-14 18:30:42,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:30:42,317 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:30:42,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:30:42,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:30:42,326 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-14 18:30:42,329 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:30:42,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:30:42,378 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:30:42,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:30:42,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:30:42,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:30:42,389 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2018-11-14 18:30:42,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:30:42,558 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-11-14 18:30:42,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:30:42,558 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-14 18:30:42,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:30:42,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:30:42,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions. [2018-11-14 18:30:42,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:30:42,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions. [2018-11-14 18:30:42,575 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 46 transitions. [2018-11-14 18:30:42,903 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:30:42,913 INFO L225 Difference]: With dead ends: 39 [2018-11-14 18:30:42,913 INFO L226 Difference]: Without dead ends: 18 [2018-11-14 18:30:42,917 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:30:42,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-14 18:30:42,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-14 18:30:42,979 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:30:42,980 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-14 18:30:42,980 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-14 18:30:42,980 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-14 18:30:42,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:30:42,984 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-14 18:30:42,984 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-14 18:30:42,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:30:42,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:30:42,985 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-14 18:30:42,985 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-14 18:30:42,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:30:42,989 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-14 18:30:42,989 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-14 18:30:42,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:30:42,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:30:42,990 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:30:42,990 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:30:42,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 18:30:42,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-14 18:30:42,994 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2018-11-14 18:30:42,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:30:42,994 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-14 18:30:42,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:30:42,995 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-14 18:30:42,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-14 18:30:42,995 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:30:42,996 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:30:42,996 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:30:42,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:30:42,996 INFO L82 PathProgramCache]: Analyzing trace with hash -203615370, now seen corresponding path program 1 times [2018-11-14 18:30:42,997 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:30:42,997 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-14 18:30:43,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:30:43,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:30:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:30:43,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:30:43,283 INFO L256 TraceCheckUtils]: 0: Hoare triple {178#true} call ULTIMATE.init(); {178#true} is VALID [2018-11-14 18:30:43,283 INFO L273 TraceCheckUtils]: 1: Hoare triple {178#true} assume true; {178#true} is VALID [2018-11-14 18:30:43,284 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {178#true} {178#true} #48#return; {178#true} is VALID [2018-11-14 18:30:43,284 INFO L256 TraceCheckUtils]: 3: Hoare triple {178#true} call #t~ret6 := main(); {178#true} is VALID [2018-11-14 18:30:43,300 INFO L273 TraceCheckUtils]: 4: Hoare triple {178#true} havoc ~n~0;~k~0 := 0bv32;~i~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {195#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 18:30:43,304 INFO L273 TraceCheckUtils]: 5: Hoare triple {195#(= main_~i~0 (_ bv0 32))} assume true; {195#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 18:30:43,305 INFO L273 TraceCheckUtils]: 6: Hoare triple {195#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, ~n~0); {202#(not (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-14 18:30:43,306 INFO L273 TraceCheckUtils]: 7: Hoare triple {202#(not (bvslt (_ bv0 32) main_~n~0))} ~j~0 := ~n~0; {206#(not (bvslt (_ bv0 32) main_~j~0))} is VALID [2018-11-14 18:30:43,310 INFO L273 TraceCheckUtils]: 8: Hoare triple {206#(not (bvslt (_ bv0 32) main_~j~0))} assume true; {206#(not (bvslt (_ bv0 32) main_~j~0))} is VALID [2018-11-14 18:30:43,314 INFO L273 TraceCheckUtils]: 9: Hoare triple {206#(not (bvslt (_ bv0 32) main_~j~0))} assume !!~bvsgt32(~j~0, 0bv32); {179#false} is VALID [2018-11-14 18:30:43,314 INFO L256 TraceCheckUtils]: 10: Hoare triple {179#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {179#false} is VALID [2018-11-14 18:30:43,315 INFO L273 TraceCheckUtils]: 11: Hoare triple {179#false} ~cond := #in~cond; {179#false} is VALID [2018-11-14 18:30:43,315 INFO L273 TraceCheckUtils]: 12: Hoare triple {179#false} assume ~cond == 0bv32; {179#false} is VALID [2018-11-14 18:30:43,315 INFO L273 TraceCheckUtils]: 13: Hoare triple {179#false} assume !false; {179#false} is VALID [2018-11-14 18:30:43,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:30:43,317 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:30:43,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:30:43,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 18:30:43,325 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-14 18:30:43,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:30:43,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:30:43,356 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:30:43,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:30:43,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:30:43,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:30:43,357 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 5 states. [2018-11-14 18:30:43,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:30:43,811 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-11-14 18:30:43,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 18:30:43,811 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-14 18:30:43,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:30:43,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:30:43,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2018-11-14 18:30:43,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:30:43,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2018-11-14 18:30:43,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2018-11-14 18:30:44,042 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:30:44,043 INFO L225 Difference]: With dead ends: 33 [2018-11-14 18:30:44,044 INFO L226 Difference]: Without dead ends: 20 [2018-11-14 18:30:44,045 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:30:44,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-14 18:30:44,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-14 18:30:44,056 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:30:44,056 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-14 18:30:44,056 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-14 18:30:44,056 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-14 18:30:44,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:30:44,058 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-14 18:30:44,058 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-14 18:30:44,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:30:44,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:30:44,059 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-14 18:30:44,060 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-14 18:30:44,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:30:44,062 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-14 18:30:44,062 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-14 18:30:44,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:30:44,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:30:44,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:30:44,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:30:44,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 18:30:44,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-14 18:30:44,065 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 14 [2018-11-14 18:30:44,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:30:44,066 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-14 18:30:44,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:30:44,066 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-14 18:30:44,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 18:30:44,067 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:30:44,067 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:30:44,067 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:30:44,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:30:44,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1025157488, now seen corresponding path program 1 times [2018-11-14 18:30:44,068 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:30:44,068 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-14 18:30:44,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:30:44,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:30:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:30:44,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:30:44,271 INFO L256 TraceCheckUtils]: 0: Hoare triple {343#true} call ULTIMATE.init(); {343#true} is VALID [2018-11-14 18:30:44,271 INFO L273 TraceCheckUtils]: 1: Hoare triple {343#true} assume true; {343#true} is VALID [2018-11-14 18:30:44,272 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {343#true} {343#true} #48#return; {343#true} is VALID [2018-11-14 18:30:44,272 INFO L256 TraceCheckUtils]: 3: Hoare triple {343#true} call #t~ret6 := main(); {343#true} is VALID [2018-11-14 18:30:44,272 INFO L273 TraceCheckUtils]: 4: Hoare triple {343#true} havoc ~n~0;~k~0 := 0bv32;~i~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {360#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-14 18:30:44,274 INFO L273 TraceCheckUtils]: 5: Hoare triple {360#(= main_~k~0 (_ bv0 32))} assume true; {360#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-14 18:30:44,293 INFO L273 TraceCheckUtils]: 6: Hoare triple {360#(= main_~k~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {367#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:44,309 INFO L273 TraceCheckUtils]: 7: Hoare triple {367#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {367#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:44,311 INFO L273 TraceCheckUtils]: 8: Hoare triple {367#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, ~n~0); {367#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:44,312 INFO L273 TraceCheckUtils]: 9: Hoare triple {367#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} ~j~0 := ~n~0; {367#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:44,317 INFO L273 TraceCheckUtils]: 10: Hoare triple {367#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {367#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:44,317 INFO L273 TraceCheckUtils]: 11: Hoare triple {367#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvsgt32(~j~0, 0bv32); {367#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:44,318 INFO L256 TraceCheckUtils]: 12: Hoare triple {367#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {386#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:44,319 INFO L273 TraceCheckUtils]: 13: Hoare triple {386#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {390#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:44,320 INFO L273 TraceCheckUtils]: 14: Hoare triple {390#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {344#false} is VALID [2018-11-14 18:30:44,320 INFO L273 TraceCheckUtils]: 15: Hoare triple {344#false} assume !false; {344#false} is VALID [2018-11-14 18:30:44,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:30:44,321 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:30:44,535 INFO L273 TraceCheckUtils]: 15: Hoare triple {344#false} assume !false; {344#false} is VALID [2018-11-14 18:30:44,536 INFO L273 TraceCheckUtils]: 14: Hoare triple {400#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume ~cond == 0bv32; {344#false} is VALID [2018-11-14 18:30:44,538 INFO L273 TraceCheckUtils]: 13: Hoare triple {404#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {400#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-14 18:30:44,539 INFO L256 TraceCheckUtils]: 12: Hoare triple {408#(bvsgt main_~k~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {404#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-14 18:30:44,540 INFO L273 TraceCheckUtils]: 11: Hoare triple {408#(bvsgt main_~k~0 (_ bv0 32))} assume !!~bvsgt32(~j~0, 0bv32); {408#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 18:30:44,541 INFO L273 TraceCheckUtils]: 10: Hoare triple {408#(bvsgt main_~k~0 (_ bv0 32))} assume true; {408#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 18:30:44,541 INFO L273 TraceCheckUtils]: 9: Hoare triple {408#(bvsgt main_~k~0 (_ bv0 32))} ~j~0 := ~n~0; {408#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 18:30:44,542 INFO L273 TraceCheckUtils]: 8: Hoare triple {408#(bvsgt main_~k~0 (_ bv0 32))} assume !~bvslt32(~i~0, ~n~0); {408#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 18:30:44,549 INFO L273 TraceCheckUtils]: 7: Hoare triple {408#(bvsgt main_~k~0 (_ bv0 32))} assume true; {408#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 18:30:44,566 INFO L273 TraceCheckUtils]: 6: Hoare triple {427#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {408#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 18:30:44,568 INFO L273 TraceCheckUtils]: 5: Hoare triple {427#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} assume true; {427#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:44,571 INFO L273 TraceCheckUtils]: 4: Hoare triple {343#true} havoc ~n~0;~k~0 := 0bv32;~i~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {427#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:44,571 INFO L256 TraceCheckUtils]: 3: Hoare triple {343#true} call #t~ret6 := main(); {343#true} is VALID [2018-11-14 18:30:44,572 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {343#true} {343#true} #48#return; {343#true} is VALID [2018-11-14 18:30:44,572 INFO L273 TraceCheckUtils]: 1: Hoare triple {343#true} assume true; {343#true} is VALID [2018-11-14 18:30:44,572 INFO L256 TraceCheckUtils]: 0: Hoare triple {343#true} call ULTIMATE.init(); {343#true} is VALID [2018-11-14 18:30:44,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:30:44,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:30:44,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-14 18:30:44,575 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-11-14 18:30:44,576 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:30:44,576 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 18:30:44,644 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:30:44,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 18:30:44,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 18:30:44,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-14 18:30:44,646 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 10 states. [2018-11-14 18:30:45,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:30:45,510 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-11-14 18:30:45,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 18:30:45,510 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-11-14 18:30:45,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:30:45,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 18:30:45,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 63 transitions. [2018-11-14 18:30:45,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 18:30:45,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 63 transitions. [2018-11-14 18:30:45,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 63 transitions. [2018-11-14 18:30:45,650 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:30:45,655 INFO L225 Difference]: With dead ends: 55 [2018-11-14 18:30:45,655 INFO L226 Difference]: Without dead ends: 53 [2018-11-14 18:30:45,656 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-11-14 18:30:45,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-14 18:30:45,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2018-11-14 18:30:45,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:30:45,722 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 34 states. [2018-11-14 18:30:45,722 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 34 states. [2018-11-14 18:30:45,722 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 34 states. [2018-11-14 18:30:45,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:30:45,729 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2018-11-14 18:30:45,729 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2018-11-14 18:30:45,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:30:45,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:30:45,731 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 53 states. [2018-11-14 18:30:45,731 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 53 states. [2018-11-14 18:30:45,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:30:45,736 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2018-11-14 18:30:45,736 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2018-11-14 18:30:45,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:30:45,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:30:45,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:30:45,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:30:45,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 18:30:45,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-14 18:30:45,741 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 16 [2018-11-14 18:30:45,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:30:45,741 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-14 18:30:45,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 18:30:45,742 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-14 18:30:45,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 18:30:45,743 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:30:45,743 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:30:45,743 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:30:45,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:30:45,743 INFO L82 PathProgramCache]: Analyzing trace with hash 575169630, now seen corresponding path program 2 times [2018-11-14 18:30:45,744 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:30:45,744 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-14 18:30:45,765 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 18:30:45,798 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:30:45,799 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:30:45,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:30:45,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:30:45,967 INFO L256 TraceCheckUtils]: 0: Hoare triple {685#true} call ULTIMATE.init(); {685#true} is VALID [2018-11-14 18:30:45,968 INFO L273 TraceCheckUtils]: 1: Hoare triple {685#true} assume true; {685#true} is VALID [2018-11-14 18:30:45,968 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {685#true} {685#true} #48#return; {685#true} is VALID [2018-11-14 18:30:45,968 INFO L256 TraceCheckUtils]: 3: Hoare triple {685#true} call #t~ret6 := main(); {685#true} is VALID [2018-11-14 18:30:45,971 INFO L273 TraceCheckUtils]: 4: Hoare triple {685#true} havoc ~n~0;~k~0 := 0bv32;~i~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {702#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-14 18:30:45,972 INFO L273 TraceCheckUtils]: 5: Hoare triple {702#(= main_~k~0 (_ bv0 32))} assume true; {702#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-14 18:30:45,973 INFO L273 TraceCheckUtils]: 6: Hoare triple {702#(= main_~k~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {709#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:45,974 INFO L273 TraceCheckUtils]: 7: Hoare triple {709#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {709#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:45,976 INFO L273 TraceCheckUtils]: 8: Hoare triple {709#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {716#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-14 18:30:45,977 INFO L273 TraceCheckUtils]: 9: Hoare triple {716#(= (_ bv2 32) main_~k~0)} assume true; {716#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-14 18:30:45,978 INFO L273 TraceCheckUtils]: 10: Hoare triple {716#(= (_ bv2 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {723#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:45,979 INFO L273 TraceCheckUtils]: 11: Hoare triple {723#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {723#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:45,981 INFO L273 TraceCheckUtils]: 12: Hoare triple {723#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {730#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:45,982 INFO L273 TraceCheckUtils]: 13: Hoare triple {730#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume true; {730#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:45,983 INFO L273 TraceCheckUtils]: 14: Hoare triple {730#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume !~bvslt32(~i~0, ~n~0); {730#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:45,983 INFO L273 TraceCheckUtils]: 15: Hoare triple {730#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} ~j~0 := ~n~0; {730#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:45,984 INFO L273 TraceCheckUtils]: 16: Hoare triple {730#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume true; {730#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:45,985 INFO L273 TraceCheckUtils]: 17: Hoare triple {730#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvsgt32(~j~0, 0bv32); {730#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:45,986 INFO L256 TraceCheckUtils]: 18: Hoare triple {730#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {749#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:45,987 INFO L273 TraceCheckUtils]: 19: Hoare triple {749#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {753#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:45,988 INFO L273 TraceCheckUtils]: 20: Hoare triple {753#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {686#false} is VALID [2018-11-14 18:30:45,989 INFO L273 TraceCheckUtils]: 21: Hoare triple {686#false} assume !false; {686#false} is VALID [2018-11-14 18:30:45,991 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:30:45,992 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:30:46,369 INFO L273 TraceCheckUtils]: 21: Hoare triple {686#false} assume !false; {686#false} is VALID [2018-11-14 18:30:46,370 INFO L273 TraceCheckUtils]: 20: Hoare triple {763#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume ~cond == 0bv32; {686#false} is VALID [2018-11-14 18:30:46,371 INFO L273 TraceCheckUtils]: 19: Hoare triple {767#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {763#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-14 18:30:46,372 INFO L256 TraceCheckUtils]: 18: Hoare triple {771#(bvsgt main_~k~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {767#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-14 18:30:46,372 INFO L273 TraceCheckUtils]: 17: Hoare triple {771#(bvsgt main_~k~0 (_ bv0 32))} assume !!~bvsgt32(~j~0, 0bv32); {771#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 18:30:46,373 INFO L273 TraceCheckUtils]: 16: Hoare triple {771#(bvsgt main_~k~0 (_ bv0 32))} assume true; {771#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 18:30:46,373 INFO L273 TraceCheckUtils]: 15: Hoare triple {771#(bvsgt main_~k~0 (_ bv0 32))} ~j~0 := ~n~0; {771#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 18:30:46,374 INFO L273 TraceCheckUtils]: 14: Hoare triple {771#(bvsgt main_~k~0 (_ bv0 32))} assume !~bvslt32(~i~0, ~n~0); {771#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 18:30:46,375 INFO L273 TraceCheckUtils]: 13: Hoare triple {771#(bvsgt main_~k~0 (_ bv0 32))} assume true; {771#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 18:30:46,376 INFO L273 TraceCheckUtils]: 12: Hoare triple {790#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {771#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 18:30:46,377 INFO L273 TraceCheckUtils]: 11: Hoare triple {790#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} assume true; {790#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:46,381 INFO L273 TraceCheckUtils]: 10: Hoare triple {797#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {790#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:46,382 INFO L273 TraceCheckUtils]: 9: Hoare triple {797#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} assume true; {797#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:46,385 INFO L273 TraceCheckUtils]: 8: Hoare triple {804#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {797#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:46,389 INFO L273 TraceCheckUtils]: 7: Hoare triple {804#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} assume true; {804#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:46,392 INFO L273 TraceCheckUtils]: 6: Hoare triple {811#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {804#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:46,393 INFO L273 TraceCheckUtils]: 5: Hoare triple {811#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} assume true; {811#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:46,394 INFO L273 TraceCheckUtils]: 4: Hoare triple {685#true} havoc ~n~0;~k~0 := 0bv32;~i~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {811#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:46,394 INFO L256 TraceCheckUtils]: 3: Hoare triple {685#true} call #t~ret6 := main(); {685#true} is VALID [2018-11-14 18:30:46,394 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {685#true} {685#true} #48#return; {685#true} is VALID [2018-11-14 18:30:46,395 INFO L273 TraceCheckUtils]: 1: Hoare triple {685#true} assume true; {685#true} is VALID [2018-11-14 18:30:46,395 INFO L256 TraceCheckUtils]: 0: Hoare triple {685#true} call ULTIMATE.init(); {685#true} is VALID [2018-11-14 18:30:46,397 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:30:46,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:30:46,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-14 18:30:46,399 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2018-11-14 18:30:46,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:30:46,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 18:30:46,554 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:30:46,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 18:30:46,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 18:30:46,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-11-14 18:30:46,555 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 16 states. [2018-11-14 18:30:49,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:30:49,855 INFO L93 Difference]: Finished difference Result 146 states and 177 transitions. [2018-11-14 18:30:49,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-14 18:30:49,855 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2018-11-14 18:30:49,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:30:49,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 18:30:49,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 162 transitions. [2018-11-14 18:30:49,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 18:30:49,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 162 transitions. [2018-11-14 18:30:49,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 162 transitions. [2018-11-14 18:30:50,260 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:30:50,270 INFO L225 Difference]: With dead ends: 146 [2018-11-14 18:30:50,270 INFO L226 Difference]: Without dead ends: 144 [2018-11-14 18:30:50,271 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=182, Invalid=520, Unknown=0, NotChecked=0, Total=702 [2018-11-14 18:30:50,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-14 18:30:50,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 75. [2018-11-14 18:30:50,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:30:50,394 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand 75 states. [2018-11-14 18:30:50,394 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 75 states. [2018-11-14 18:30:50,394 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 75 states. [2018-11-14 18:30:50,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:30:50,408 INFO L93 Difference]: Finished difference Result 144 states and 175 transitions. [2018-11-14 18:30:50,408 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 175 transitions. [2018-11-14 18:30:50,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:30:50,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:30:50,411 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 144 states. [2018-11-14 18:30:50,412 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 144 states. [2018-11-14 18:30:50,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:30:50,423 INFO L93 Difference]: Finished difference Result 144 states and 175 transitions. [2018-11-14 18:30:50,423 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 175 transitions. [2018-11-14 18:30:50,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:30:50,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:30:50,426 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:30:50,426 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:30:50,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-14 18:30:50,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 90 transitions. [2018-11-14 18:30:50,431 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 90 transitions. Word has length 22 [2018-11-14 18:30:50,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:30:50,431 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 90 transitions. [2018-11-14 18:30:50,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 18:30:50,432 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 90 transitions. [2018-11-14 18:30:50,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 18:30:50,433 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:30:50,433 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:30:50,434 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:30:50,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:30:50,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1392733261, now seen corresponding path program 1 times [2018-11-14 18:30:50,434 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:30:50,434 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-14 18:30:50,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:30:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:30:50,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:30:50,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:30:50,740 INFO L256 TraceCheckUtils]: 0: Hoare triple {1463#true} call ULTIMATE.init(); {1463#true} is VALID [2018-11-14 18:30:50,740 INFO L273 TraceCheckUtils]: 1: Hoare triple {1463#true} assume true; {1463#true} is VALID [2018-11-14 18:30:50,740 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1463#true} {1463#true} #48#return; {1463#true} is VALID [2018-11-14 18:30:50,741 INFO L256 TraceCheckUtils]: 3: Hoare triple {1463#true} call #t~ret6 := main(); {1463#true} is VALID [2018-11-14 18:30:50,746 INFO L273 TraceCheckUtils]: 4: Hoare triple {1463#true} havoc ~n~0;~k~0 := 0bv32;~i~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {1480#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 18:30:50,746 INFO L273 TraceCheckUtils]: 5: Hoare triple {1480#(= main_~i~0 (_ bv0 32))} assume true; {1480#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 18:30:50,748 INFO L273 TraceCheckUtils]: 6: Hoare triple {1480#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1487#(and (bvslt (_ bv0 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:30:50,749 INFO L273 TraceCheckUtils]: 7: Hoare triple {1487#(and (bvslt (_ bv0 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {1487#(and (bvslt (_ bv0 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:30:50,749 INFO L273 TraceCheckUtils]: 8: Hoare triple {1487#(and (bvslt (_ bv0 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~n~0); {1494#(and (not (bvslt (_ bv1 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-14 18:30:50,750 INFO L273 TraceCheckUtils]: 9: Hoare triple {1494#(and (not (bvslt (_ bv1 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} ~j~0 := ~n~0; {1498#(and (not (bvslt (_ bv1 32) main_~j~0)) (bvslt (_ bv0 32) main_~j~0))} is VALID [2018-11-14 18:30:50,751 INFO L273 TraceCheckUtils]: 10: Hoare triple {1498#(and (not (bvslt (_ bv1 32) main_~j~0)) (bvslt (_ bv0 32) main_~j~0))} assume true; {1498#(and (not (bvslt (_ bv1 32) main_~j~0)) (bvslt (_ bv0 32) main_~j~0))} is VALID [2018-11-14 18:30:50,751 INFO L273 TraceCheckUtils]: 11: Hoare triple {1498#(and (not (bvslt (_ bv1 32) main_~j~0)) (bvslt (_ bv0 32) main_~j~0))} assume !!~bvsgt32(~j~0, 0bv32); {1498#(and (not (bvslt (_ bv1 32) main_~j~0)) (bvslt (_ bv0 32) main_~j~0))} is VALID [2018-11-14 18:30:50,751 INFO L256 TraceCheckUtils]: 12: Hoare triple {1498#(and (not (bvslt (_ bv1 32) main_~j~0)) (bvslt (_ bv0 32) main_~j~0))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {1463#true} is VALID [2018-11-14 18:30:50,752 INFO L273 TraceCheckUtils]: 13: Hoare triple {1463#true} ~cond := #in~cond; {1463#true} is VALID [2018-11-14 18:30:50,752 INFO L273 TraceCheckUtils]: 14: Hoare triple {1463#true} assume !(~cond == 0bv32); {1463#true} is VALID [2018-11-14 18:30:50,752 INFO L273 TraceCheckUtils]: 15: Hoare triple {1463#true} assume true; {1463#true} is VALID [2018-11-14 18:30:50,753 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {1463#true} {1498#(and (not (bvslt (_ bv1 32) main_~j~0)) (bvslt (_ bv0 32) main_~j~0))} #52#return; {1498#(and (not (bvslt (_ bv1 32) main_~j~0)) (bvslt (_ bv0 32) main_~j~0))} is VALID [2018-11-14 18:30:50,755 INFO L273 TraceCheckUtils]: 17: Hoare triple {1498#(and (not (bvslt (_ bv1 32) main_~j~0)) (bvslt (_ bv0 32) main_~j~0))} #t~post4 := ~j~0;~j~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {1523#(and (bvslt (_ bv0 32) (bvadd main_~j~0 (_ bv1 32))) (not (bvslt (_ bv1 32) (bvadd main_~j~0 (_ bv1 32)))))} is VALID [2018-11-14 18:30:50,772 INFO L273 TraceCheckUtils]: 18: Hoare triple {1523#(and (bvslt (_ bv0 32) (bvadd main_~j~0 (_ bv1 32))) (not (bvslt (_ bv1 32) (bvadd main_~j~0 (_ bv1 32)))))} assume true; {1523#(and (bvslt (_ bv0 32) (bvadd main_~j~0 (_ bv1 32))) (not (bvslt (_ bv1 32) (bvadd main_~j~0 (_ bv1 32)))))} is VALID [2018-11-14 18:30:50,773 INFO L273 TraceCheckUtils]: 19: Hoare triple {1523#(and (bvslt (_ bv0 32) (bvadd main_~j~0 (_ bv1 32))) (not (bvslt (_ bv1 32) (bvadd main_~j~0 (_ bv1 32)))))} assume !!~bvsgt32(~j~0, 0bv32); {1464#false} is VALID [2018-11-14 18:30:50,773 INFO L256 TraceCheckUtils]: 20: Hoare triple {1464#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {1464#false} is VALID [2018-11-14 18:30:50,774 INFO L273 TraceCheckUtils]: 21: Hoare triple {1464#false} ~cond := #in~cond; {1464#false} is VALID [2018-11-14 18:30:50,774 INFO L273 TraceCheckUtils]: 22: Hoare triple {1464#false} assume ~cond == 0bv32; {1464#false} is VALID [2018-11-14 18:30:50,774 INFO L273 TraceCheckUtils]: 23: Hoare triple {1464#false} assume !false; {1464#false} is VALID [2018-11-14 18:30:50,776 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:30:50,777 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:30:51,089 INFO L273 TraceCheckUtils]: 23: Hoare triple {1464#false} assume !false; {1464#false} is VALID [2018-11-14 18:30:51,090 INFO L273 TraceCheckUtils]: 22: Hoare triple {1464#false} assume ~cond == 0bv32; {1464#false} is VALID [2018-11-14 18:30:51,090 INFO L273 TraceCheckUtils]: 21: Hoare triple {1464#false} ~cond := #in~cond; {1464#false} is VALID [2018-11-14 18:30:51,090 INFO L256 TraceCheckUtils]: 20: Hoare triple {1464#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {1464#false} is VALID [2018-11-14 18:30:51,093 INFO L273 TraceCheckUtils]: 19: Hoare triple {1554#(not (bvsgt main_~j~0 (_ bv0 32)))} assume !!~bvsgt32(~j~0, 0bv32); {1464#false} is VALID [2018-11-14 18:30:51,094 INFO L273 TraceCheckUtils]: 18: Hoare triple {1554#(not (bvsgt main_~j~0 (_ bv0 32)))} assume true; {1554#(not (bvsgt main_~j~0 (_ bv0 32)))} is VALID [2018-11-14 18:30:51,094 INFO L273 TraceCheckUtils]: 17: Hoare triple {1561#(not (bvsgt (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post4 := ~j~0;~j~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {1554#(not (bvsgt main_~j~0 (_ bv0 32)))} is VALID [2018-11-14 18:30:51,095 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {1463#true} {1561#(not (bvsgt (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} #52#return; {1561#(not (bvsgt (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:30:51,096 INFO L273 TraceCheckUtils]: 15: Hoare triple {1463#true} assume true; {1463#true} is VALID [2018-11-14 18:30:51,096 INFO L273 TraceCheckUtils]: 14: Hoare triple {1463#true} assume !(~cond == 0bv32); {1463#true} is VALID [2018-11-14 18:30:51,096 INFO L273 TraceCheckUtils]: 13: Hoare triple {1463#true} ~cond := #in~cond; {1463#true} is VALID [2018-11-14 18:30:51,112 INFO L256 TraceCheckUtils]: 12: Hoare triple {1561#(not (bvsgt (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {1463#true} is VALID [2018-11-14 18:30:51,124 INFO L273 TraceCheckUtils]: 11: Hoare triple {1561#(not (bvsgt (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsgt32(~j~0, 0bv32); {1561#(not (bvsgt (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:30:51,132 INFO L273 TraceCheckUtils]: 10: Hoare triple {1561#(not (bvsgt (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {1561#(not (bvsgt (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:30:51,134 INFO L273 TraceCheckUtils]: 9: Hoare triple {1586#(not (bvsgt (bvadd main_~n~0 (_ bv4294967295 32)) (_ bv0 32)))} ~j~0 := ~n~0; {1561#(not (bvsgt (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:30:51,136 INFO L273 TraceCheckUtils]: 8: Hoare triple {1590#(or (not (bvsgt (bvadd main_~n~0 (_ bv4294967295 32)) (_ bv0 32))) (bvslt main_~i~0 main_~n~0))} assume !~bvslt32(~i~0, ~n~0); {1586#(not (bvsgt (bvadd main_~n~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:30:51,137 INFO L273 TraceCheckUtils]: 7: Hoare triple {1590#(or (not (bvsgt (bvadd main_~n~0 (_ bv4294967295 32)) (_ bv0 32))) (bvslt main_~i~0 main_~n~0))} assume true; {1590#(or (not (bvsgt (bvadd main_~n~0 (_ bv4294967295 32)) (_ bv0 32))) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-14 18:30:51,139 INFO L273 TraceCheckUtils]: 6: Hoare triple {1597#(forall ((main_~n~0 (_ BitVec 32))) (or (not (bvsgt (bvadd main_~n~0 (_ bv4294967295 32)) (_ bv0 32))) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0))))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1590#(or (not (bvsgt (bvadd main_~n~0 (_ bv4294967295 32)) (_ bv0 32))) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-14 18:30:51,140 INFO L273 TraceCheckUtils]: 5: Hoare triple {1597#(forall ((main_~n~0 (_ BitVec 32))) (or (not (bvsgt (bvadd main_~n~0 (_ bv4294967295 32)) (_ bv0 32))) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0))))} assume true; {1597#(forall ((main_~n~0 (_ BitVec 32))) (or (not (bvsgt (bvadd main_~n~0 (_ bv4294967295 32)) (_ bv0 32))) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0))))} is VALID [2018-11-14 18:30:51,142 INFO L273 TraceCheckUtils]: 4: Hoare triple {1463#true} havoc ~n~0;~k~0 := 0bv32;~i~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {1597#(forall ((main_~n~0 (_ BitVec 32))) (or (not (bvsgt (bvadd main_~n~0 (_ bv4294967295 32)) (_ bv0 32))) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0))))} is VALID [2018-11-14 18:30:51,142 INFO L256 TraceCheckUtils]: 3: Hoare triple {1463#true} call #t~ret6 := main(); {1463#true} is VALID [2018-11-14 18:30:51,142 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1463#true} {1463#true} #48#return; {1463#true} is VALID [2018-11-14 18:30:51,143 INFO L273 TraceCheckUtils]: 1: Hoare triple {1463#true} assume true; {1463#true} is VALID [2018-11-14 18:30:51,143 INFO L256 TraceCheckUtils]: 0: Hoare triple {1463#true} call ULTIMATE.init(); {1463#true} is VALID [2018-11-14 18:30:51,144 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (6)] Exception during sending of exit command (exit): Broken pipe [2018-11-14 18:30:51,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:30:51,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-14 18:30:51,154 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2018-11-14 18:30:51,154 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:30:51,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 18:30:51,273 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:30:51,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 18:30:51,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 18:30:51,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-14 18:30:51,274 INFO L87 Difference]: Start difference. First operand 75 states and 90 transitions. Second operand 12 states. [2018-11-14 18:30:51,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:30:51,999 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2018-11-14 18:30:51,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 18:30:52,000 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2018-11-14 18:30:52,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:30:52,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:30:52,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2018-11-14 18:30:52,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:30:52,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2018-11-14 18:30:52,004 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2018-11-14 18:30:52,129 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:30:52,132 INFO L225 Difference]: With dead ends: 88 [2018-11-14 18:30:52,132 INFO L226 Difference]: Without dead ends: 71 [2018-11-14 18:30:52,133 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-11-14 18:30:52,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-14 18:30:52,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-11-14 18:30:52,194 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:30:52,194 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 71 states. [2018-11-14 18:30:52,194 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 71 states. [2018-11-14 18:30:52,194 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 71 states. [2018-11-14 18:30:52,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:30:52,198 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2018-11-14 18:30:52,199 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2018-11-14 18:30:52,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:30:52,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:30:52,200 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 71 states. [2018-11-14 18:30:52,200 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 71 states. [2018-11-14 18:30:52,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:30:52,204 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2018-11-14 18:30:52,204 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2018-11-14 18:30:52,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:30:52,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:30:52,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:30:52,205 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:30:52,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-14 18:30:52,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2018-11-14 18:30:52,208 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 84 transitions. Word has length 24 [2018-11-14 18:30:52,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:30:52,209 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 84 transitions. [2018-11-14 18:30:52,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 18:30:52,209 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2018-11-14 18:30:52,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 18:30:52,210 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:30:52,210 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:30:52,210 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:30:52,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:30:52,211 INFO L82 PathProgramCache]: Analyzing trace with hash 2026234523, now seen corresponding path program 2 times [2018-11-14 18:30:52,211 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:30:52,211 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 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 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:30:52,237 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 18:30:52,279 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:30:52,280 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:30:52,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:30:52,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:30:52,426 INFO L256 TraceCheckUtils]: 0: Hoare triple {1995#true} call ULTIMATE.init(); {1995#true} is VALID [2018-11-14 18:30:52,427 INFO L273 TraceCheckUtils]: 1: Hoare triple {1995#true} assume true; {1995#true} is VALID [2018-11-14 18:30:52,427 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1995#true} {1995#true} #48#return; {1995#true} is VALID [2018-11-14 18:30:52,428 INFO L256 TraceCheckUtils]: 3: Hoare triple {1995#true} call #t~ret6 := main(); {1995#true} is VALID [2018-11-14 18:30:52,429 INFO L273 TraceCheckUtils]: 4: Hoare triple {1995#true} havoc ~n~0;~k~0 := 0bv32;~i~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {2012#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-14 18:30:52,430 INFO L273 TraceCheckUtils]: 5: Hoare triple {2012#(= main_~k~0 (_ bv0 32))} assume true; {2012#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-14 18:30:52,430 INFO L273 TraceCheckUtils]: 6: Hoare triple {2012#(= main_~k~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2019#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:52,431 INFO L273 TraceCheckUtils]: 7: Hoare triple {2019#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {2019#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:52,432 INFO L273 TraceCheckUtils]: 8: Hoare triple {2019#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2026#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-14 18:30:52,432 INFO L273 TraceCheckUtils]: 9: Hoare triple {2026#(= (_ bv2 32) main_~k~0)} assume true; {2026#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-14 18:30:52,434 INFO L273 TraceCheckUtils]: 10: Hoare triple {2026#(= (_ bv2 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2033#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:52,435 INFO L273 TraceCheckUtils]: 11: Hoare triple {2033#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {2033#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:52,436 INFO L273 TraceCheckUtils]: 12: Hoare triple {2033#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2040#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:52,437 INFO L273 TraceCheckUtils]: 13: Hoare triple {2040#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume true; {2040#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:52,437 INFO L273 TraceCheckUtils]: 14: Hoare triple {2040#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2047#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:52,437 INFO L273 TraceCheckUtils]: 15: Hoare triple {2047#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {2047#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:52,438 INFO L273 TraceCheckUtils]: 16: Hoare triple {2047#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume !~bvslt32(~i~0, ~n~0); {2047#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:52,438 INFO L273 TraceCheckUtils]: 17: Hoare triple {2047#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} ~j~0 := ~n~0; {2047#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:52,439 INFO L273 TraceCheckUtils]: 18: Hoare triple {2047#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {2047#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:52,439 INFO L273 TraceCheckUtils]: 19: Hoare triple {2047#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvsgt32(~j~0, 0bv32); {2047#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:52,439 INFO L256 TraceCheckUtils]: 20: Hoare triple {2047#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {1995#true} is VALID [2018-11-14 18:30:52,440 INFO L273 TraceCheckUtils]: 21: Hoare triple {1995#true} ~cond := #in~cond; {1995#true} is VALID [2018-11-14 18:30:52,440 INFO L273 TraceCheckUtils]: 22: Hoare triple {1995#true} assume !(~cond == 0bv32); {1995#true} is VALID [2018-11-14 18:30:52,440 INFO L273 TraceCheckUtils]: 23: Hoare triple {1995#true} assume true; {1995#true} is VALID [2018-11-14 18:30:52,441 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1995#true} {2047#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} #52#return; {2047#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:52,442 INFO L273 TraceCheckUtils]: 25: Hoare triple {2047#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post4 := ~j~0;~j~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {2040#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:52,442 INFO L273 TraceCheckUtils]: 26: Hoare triple {2040#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume true; {2040#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:52,443 INFO L273 TraceCheckUtils]: 27: Hoare triple {2040#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvsgt32(~j~0, 0bv32); {2040#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:52,444 INFO L256 TraceCheckUtils]: 28: Hoare triple {2040#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {2090#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:52,445 INFO L273 TraceCheckUtils]: 29: Hoare triple {2090#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {2094#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:52,446 INFO L273 TraceCheckUtils]: 30: Hoare triple {2094#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {1996#false} is VALID [2018-11-14 18:30:52,446 INFO L273 TraceCheckUtils]: 31: Hoare triple {1996#false} assume !false; {1996#false} is VALID [2018-11-14 18:30:52,449 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:30:52,449 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:30:52,756 INFO L273 TraceCheckUtils]: 31: Hoare triple {1996#false} assume !false; {1996#false} is VALID [2018-11-14 18:30:52,757 INFO L273 TraceCheckUtils]: 30: Hoare triple {2104#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume ~cond == 0bv32; {1996#false} is VALID [2018-11-14 18:30:52,758 INFO L273 TraceCheckUtils]: 29: Hoare triple {2108#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {2104#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-14 18:30:52,758 INFO L256 TraceCheckUtils]: 28: Hoare triple {2112#(bvsgt main_~k~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {2108#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-14 18:30:52,759 INFO L273 TraceCheckUtils]: 27: Hoare triple {2112#(bvsgt main_~k~0 (_ bv0 32))} assume !!~bvsgt32(~j~0, 0bv32); {2112#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 18:30:52,759 INFO L273 TraceCheckUtils]: 26: Hoare triple {2112#(bvsgt main_~k~0 (_ bv0 32))} assume true; {2112#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 18:30:52,760 INFO L273 TraceCheckUtils]: 25: Hoare triple {2122#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post4 := ~j~0;~j~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {2112#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 18:30:52,760 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1995#true} {2122#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} #52#return; {2122#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:52,760 INFO L273 TraceCheckUtils]: 23: Hoare triple {1995#true} assume true; {1995#true} is VALID [2018-11-14 18:30:52,761 INFO L273 TraceCheckUtils]: 22: Hoare triple {1995#true} assume !(~cond == 0bv32); {1995#true} is VALID [2018-11-14 18:30:52,761 INFO L273 TraceCheckUtils]: 21: Hoare triple {1995#true} ~cond := #in~cond; {1995#true} is VALID [2018-11-14 18:30:52,761 INFO L256 TraceCheckUtils]: 20: Hoare triple {2122#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {1995#true} is VALID [2018-11-14 18:30:52,762 INFO L273 TraceCheckUtils]: 19: Hoare triple {2122#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvsgt32(~j~0, 0bv32); {2122#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:52,763 INFO L273 TraceCheckUtils]: 18: Hoare triple {2122#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {2122#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:52,763 INFO L273 TraceCheckUtils]: 17: Hoare triple {2122#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} ~j~0 := ~n~0; {2122#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:52,763 INFO L273 TraceCheckUtils]: 16: Hoare triple {2122#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, ~n~0); {2122#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:52,764 INFO L273 TraceCheckUtils]: 15: Hoare triple {2122#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {2122#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:52,767 INFO L273 TraceCheckUtils]: 14: Hoare triple {2112#(bvsgt main_~k~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2122#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:52,767 INFO L273 TraceCheckUtils]: 13: Hoare triple {2112#(bvsgt main_~k~0 (_ bv0 32))} assume true; {2112#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 18:30:52,768 INFO L273 TraceCheckUtils]: 12: Hoare triple {2162#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2112#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 18:30:52,775 INFO L273 TraceCheckUtils]: 11: Hoare triple {2162#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} assume true; {2162#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:52,778 INFO L273 TraceCheckUtils]: 10: Hoare triple {2169#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2162#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:52,778 INFO L273 TraceCheckUtils]: 9: Hoare triple {2169#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} assume true; {2169#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:52,781 INFO L273 TraceCheckUtils]: 8: Hoare triple {2176#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2169#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:52,785 INFO L273 TraceCheckUtils]: 7: Hoare triple {2176#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} assume true; {2176#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:52,789 INFO L273 TraceCheckUtils]: 6: Hoare triple {2183#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2176#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:52,790 INFO L273 TraceCheckUtils]: 5: Hoare triple {2183#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} assume true; {2183#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:52,791 INFO L273 TraceCheckUtils]: 4: Hoare triple {1995#true} havoc ~n~0;~k~0 := 0bv32;~i~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {2183#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:52,791 INFO L256 TraceCheckUtils]: 3: Hoare triple {1995#true} call #t~ret6 := main(); {1995#true} is VALID [2018-11-14 18:30:52,792 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1995#true} {1995#true} #48#return; {1995#true} is VALID [2018-11-14 18:30:52,792 INFO L273 TraceCheckUtils]: 1: Hoare triple {1995#true} assume true; {1995#true} is VALID [2018-11-14 18:30:52,793 INFO L256 TraceCheckUtils]: 0: Hoare triple {1995#true} call ULTIMATE.init(); {1995#true} is VALID [2018-11-14 18:30:52,795 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:30:52,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:30:52,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-11-14 18:30:52,803 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-11-14 18:30:52,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:30:52,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 18:30:53,088 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:30:53,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 18:30:53,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 18:30:53,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-11-14 18:30:53,089 INFO L87 Difference]: Start difference. First operand 71 states and 84 transitions. Second operand 18 states. [2018-11-14 18:30:57,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:30:57,304 INFO L93 Difference]: Finished difference Result 195 states and 236 transitions. [2018-11-14 18:30:57,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-14 18:30:57,304 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-11-14 18:30:57,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:30:57,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 18:30:57,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 203 transitions. [2018-11-14 18:30:57,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 18:30:57,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 203 transitions. [2018-11-14 18:30:57,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 203 transitions. [2018-11-14 18:30:57,717 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:30:57,722 INFO L225 Difference]: With dead ends: 195 [2018-11-14 18:30:57,722 INFO L226 Difference]: Without dead ends: 193 [2018-11-14 18:30:57,723 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=285, Invalid=837, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 18:30:57,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-11-14 18:30:57,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 107. [2018-11-14 18:30:57,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:30:57,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 193 states. Second operand 107 states. [2018-11-14 18:30:57,937 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states. Second operand 107 states. [2018-11-14 18:30:57,937 INFO L87 Difference]: Start difference. First operand 193 states. Second operand 107 states. [2018-11-14 18:30:57,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:30:57,948 INFO L93 Difference]: Finished difference Result 193 states and 234 transitions. [2018-11-14 18:30:57,949 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 234 transitions. [2018-11-14 18:30:57,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:30:57,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:30:57,950 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 193 states. [2018-11-14 18:30:57,950 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 193 states. [2018-11-14 18:30:57,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:30:57,962 INFO L93 Difference]: Finished difference Result 193 states and 234 transitions. [2018-11-14 18:30:57,962 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 234 transitions. [2018-11-14 18:30:57,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:30:57,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:30:57,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:30:57,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:30:57,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-14 18:30:57,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 128 transitions. [2018-11-14 18:30:57,971 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 128 transitions. Word has length 32 [2018-11-14 18:30:57,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:30:57,971 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 128 transitions. [2018-11-14 18:30:57,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 18:30:57,971 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 128 transitions. [2018-11-14 18:30:57,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-14 18:30:57,972 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:30:57,972 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:30:57,973 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:30:57,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:30:57,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1585665648, now seen corresponding path program 3 times [2018-11-14 18:30:57,974 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:30:57,974 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 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 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:30:57,993 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-14 18:30:58,044 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-14 18:30:58,044 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:30:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:30:58,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:30:58,314 INFO L256 TraceCheckUtils]: 0: Hoare triple {3062#true} call ULTIMATE.init(); {3062#true} is VALID [2018-11-14 18:30:58,315 INFO L273 TraceCheckUtils]: 1: Hoare triple {3062#true} assume true; {3062#true} is VALID [2018-11-14 18:30:58,315 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3062#true} {3062#true} #48#return; {3062#true} is VALID [2018-11-14 18:30:58,315 INFO L256 TraceCheckUtils]: 3: Hoare triple {3062#true} call #t~ret6 := main(); {3062#true} is VALID [2018-11-14 18:30:58,315 INFO L273 TraceCheckUtils]: 4: Hoare triple {3062#true} havoc ~n~0;~k~0 := 0bv32;~i~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {3079#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 18:30:58,316 INFO L273 TraceCheckUtils]: 5: Hoare triple {3079#(= main_~i~0 (_ bv0 32))} assume true; {3079#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 18:30:58,320 INFO L273 TraceCheckUtils]: 6: Hoare triple {3079#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3086#(and (bvslt (_ bv0 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:30:58,320 INFO L273 TraceCheckUtils]: 7: Hoare triple {3086#(and (bvslt (_ bv0 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {3086#(and (bvslt (_ bv0 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:30:58,322 INFO L273 TraceCheckUtils]: 8: Hoare triple {3086#(and (bvslt (_ bv0 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3093#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-14 18:30:58,322 INFO L273 TraceCheckUtils]: 9: Hoare triple {3093#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv2 32) main_~i~0))} assume true; {3093#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-14 18:30:58,323 INFO L273 TraceCheckUtils]: 10: Hoare triple {3093#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv2 32) main_~i~0))} assume !~bvslt32(~i~0, ~n~0); {3100#(and (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (_ bv1 32) main_~n~0))} is VALID [2018-11-14 18:30:58,324 INFO L273 TraceCheckUtils]: 11: Hoare triple {3100#(and (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (_ bv1 32) main_~n~0))} ~j~0 := ~n~0; {3104#(and (bvslt (_ bv1 32) main_~j~0) (not (bvslt (_ bv2 32) main_~j~0)))} is VALID [2018-11-14 18:30:58,324 INFO L273 TraceCheckUtils]: 12: Hoare triple {3104#(and (bvslt (_ bv1 32) main_~j~0) (not (bvslt (_ bv2 32) main_~j~0)))} assume true; {3104#(and (bvslt (_ bv1 32) main_~j~0) (not (bvslt (_ bv2 32) main_~j~0)))} is VALID [2018-11-14 18:30:58,325 INFO L273 TraceCheckUtils]: 13: Hoare triple {3104#(and (bvslt (_ bv1 32) main_~j~0) (not (bvslt (_ bv2 32) main_~j~0)))} assume !!~bvsgt32(~j~0, 0bv32); {3104#(and (bvslt (_ bv1 32) main_~j~0) (not (bvslt (_ bv2 32) main_~j~0)))} is VALID [2018-11-14 18:30:58,325 INFO L256 TraceCheckUtils]: 14: Hoare triple {3104#(and (bvslt (_ bv1 32) main_~j~0) (not (bvslt (_ bv2 32) main_~j~0)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {3062#true} is VALID [2018-11-14 18:30:58,326 INFO L273 TraceCheckUtils]: 15: Hoare triple {3062#true} ~cond := #in~cond; {3062#true} is VALID [2018-11-14 18:30:58,326 INFO L273 TraceCheckUtils]: 16: Hoare triple {3062#true} assume !(~cond == 0bv32); {3062#true} is VALID [2018-11-14 18:30:58,326 INFO L273 TraceCheckUtils]: 17: Hoare triple {3062#true} assume true; {3062#true} is VALID [2018-11-14 18:30:58,327 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {3062#true} {3104#(and (bvslt (_ bv1 32) main_~j~0) (not (bvslt (_ bv2 32) main_~j~0)))} #52#return; {3104#(and (bvslt (_ bv1 32) main_~j~0) (not (bvslt (_ bv2 32) main_~j~0)))} is VALID [2018-11-14 18:30:58,330 INFO L273 TraceCheckUtils]: 19: Hoare triple {3104#(and (bvslt (_ bv1 32) main_~j~0) (not (bvslt (_ bv2 32) main_~j~0)))} #t~post4 := ~j~0;~j~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {3129#(and (bvslt (_ bv1 32) (bvadd main_~j~0 (_ bv1 32))) (not (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv1 32)))))} is VALID [2018-11-14 18:30:58,331 INFO L273 TraceCheckUtils]: 20: Hoare triple {3129#(and (bvslt (_ bv1 32) (bvadd main_~j~0 (_ bv1 32))) (not (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv1 32)))))} assume true; {3129#(and (bvslt (_ bv1 32) (bvadd main_~j~0 (_ bv1 32))) (not (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv1 32)))))} is VALID [2018-11-14 18:30:58,331 INFO L273 TraceCheckUtils]: 21: Hoare triple {3129#(and (bvslt (_ bv1 32) (bvadd main_~j~0 (_ bv1 32))) (not (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv1 32)))))} assume !!~bvsgt32(~j~0, 0bv32); {3129#(and (bvslt (_ bv1 32) (bvadd main_~j~0 (_ bv1 32))) (not (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv1 32)))))} is VALID [2018-11-14 18:30:58,331 INFO L256 TraceCheckUtils]: 22: Hoare triple {3129#(and (bvslt (_ bv1 32) (bvadd main_~j~0 (_ bv1 32))) (not (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv1 32)))))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {3062#true} is VALID [2018-11-14 18:30:58,331 INFO L273 TraceCheckUtils]: 23: Hoare triple {3062#true} ~cond := #in~cond; {3062#true} is VALID [2018-11-14 18:30:58,332 INFO L273 TraceCheckUtils]: 24: Hoare triple {3062#true} assume !(~cond == 0bv32); {3062#true} is VALID [2018-11-14 18:30:58,332 INFO L273 TraceCheckUtils]: 25: Hoare triple {3062#true} assume true; {3062#true} is VALID [2018-11-14 18:30:58,332 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {3062#true} {3129#(and (bvslt (_ bv1 32) (bvadd main_~j~0 (_ bv1 32))) (not (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv1 32)))))} #52#return; {3129#(and (bvslt (_ bv1 32) (bvadd main_~j~0 (_ bv1 32))) (not (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv1 32)))))} is VALID [2018-11-14 18:30:58,335 INFO L273 TraceCheckUtils]: 27: Hoare triple {3129#(and (bvslt (_ bv1 32) (bvadd main_~j~0 (_ bv1 32))) (not (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv1 32)))))} #t~post4 := ~j~0;~j~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {3154#(and (not (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv2 32)))) (bvslt (_ bv1 32) (bvadd main_~j~0 (_ bv2 32))))} is VALID [2018-11-14 18:30:58,336 INFO L273 TraceCheckUtils]: 28: Hoare triple {3154#(and (not (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv2 32)))) (bvslt (_ bv1 32) (bvadd main_~j~0 (_ bv2 32))))} assume true; {3154#(and (not (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv2 32)))) (bvslt (_ bv1 32) (bvadd main_~j~0 (_ bv2 32))))} is VALID [2018-11-14 18:30:58,337 INFO L273 TraceCheckUtils]: 29: Hoare triple {3154#(and (not (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv2 32)))) (bvslt (_ bv1 32) (bvadd main_~j~0 (_ bv2 32))))} assume !!~bvsgt32(~j~0, 0bv32); {3063#false} is VALID [2018-11-14 18:30:58,337 INFO L256 TraceCheckUtils]: 30: Hoare triple {3063#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {3063#false} is VALID [2018-11-14 18:30:58,337 INFO L273 TraceCheckUtils]: 31: Hoare triple {3063#false} ~cond := #in~cond; {3063#false} is VALID [2018-11-14 18:30:58,337 INFO L273 TraceCheckUtils]: 32: Hoare triple {3063#false} assume ~cond == 0bv32; {3063#false} is VALID [2018-11-14 18:30:58,337 INFO L273 TraceCheckUtils]: 33: Hoare triple {3063#false} assume !false; {3063#false} is VALID [2018-11-14 18:30:58,339 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 18:30:58,340 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:30:58,883 INFO L273 TraceCheckUtils]: 33: Hoare triple {3063#false} assume !false; {3063#false} is VALID [2018-11-14 18:30:58,884 INFO L273 TraceCheckUtils]: 32: Hoare triple {3063#false} assume ~cond == 0bv32; {3063#false} is VALID [2018-11-14 18:30:58,884 INFO L273 TraceCheckUtils]: 31: Hoare triple {3063#false} ~cond := #in~cond; {3063#false} is VALID [2018-11-14 18:30:58,884 INFO L256 TraceCheckUtils]: 30: Hoare triple {3063#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {3063#false} is VALID [2018-11-14 18:30:58,886 INFO L273 TraceCheckUtils]: 29: Hoare triple {3185#(not (bvsgt main_~j~0 (_ bv0 32)))} assume !!~bvsgt32(~j~0, 0bv32); {3063#false} is VALID [2018-11-14 18:30:58,890 INFO L273 TraceCheckUtils]: 28: Hoare triple {3185#(not (bvsgt main_~j~0 (_ bv0 32)))} assume true; {3185#(not (bvsgt main_~j~0 (_ bv0 32)))} is VALID [2018-11-14 18:30:58,893 INFO L273 TraceCheckUtils]: 27: Hoare triple {3192#(not (bvsgt (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post4 := ~j~0;~j~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {3185#(not (bvsgt main_~j~0 (_ bv0 32)))} is VALID [2018-11-14 18:30:58,895 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {3062#true} {3192#(not (bvsgt (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} #52#return; {3192#(not (bvsgt (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:30:58,895 INFO L273 TraceCheckUtils]: 25: Hoare triple {3062#true} assume true; {3062#true} is VALID [2018-11-14 18:30:58,895 INFO L273 TraceCheckUtils]: 24: Hoare triple {3062#true} assume !(~cond == 0bv32); {3062#true} is VALID [2018-11-14 18:30:58,896 INFO L273 TraceCheckUtils]: 23: Hoare triple {3062#true} ~cond := #in~cond; {3062#true} is VALID [2018-11-14 18:30:58,896 INFO L256 TraceCheckUtils]: 22: Hoare triple {3192#(not (bvsgt (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {3062#true} is VALID [2018-11-14 18:30:58,896 INFO L273 TraceCheckUtils]: 21: Hoare triple {3192#(not (bvsgt (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsgt32(~j~0, 0bv32); {3192#(not (bvsgt (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:30:58,897 INFO L273 TraceCheckUtils]: 20: Hoare triple {3192#(not (bvsgt (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {3192#(not (bvsgt (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:30:58,900 INFO L273 TraceCheckUtils]: 19: Hoare triple {3217#(not (bvsgt (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)))} #t~post4 := ~j~0;~j~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {3192#(not (bvsgt (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:30:58,902 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {3062#true} {3217#(not (bvsgt (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)))} #52#return; {3217#(not (bvsgt (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:30:58,902 INFO L273 TraceCheckUtils]: 17: Hoare triple {3062#true} assume true; {3062#true} is VALID [2018-11-14 18:30:58,902 INFO L273 TraceCheckUtils]: 16: Hoare triple {3062#true} assume !(~cond == 0bv32); {3062#true} is VALID [2018-11-14 18:30:58,902 INFO L273 TraceCheckUtils]: 15: Hoare triple {3062#true} ~cond := #in~cond; {3062#true} is VALID [2018-11-14 18:30:58,902 INFO L256 TraceCheckUtils]: 14: Hoare triple {3217#(not (bvsgt (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {3062#true} is VALID [2018-11-14 18:30:58,903 INFO L273 TraceCheckUtils]: 13: Hoare triple {3217#(not (bvsgt (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvsgt32(~j~0, 0bv32); {3217#(not (bvsgt (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:30:58,903 INFO L273 TraceCheckUtils]: 12: Hoare triple {3217#(not (bvsgt (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)))} assume true; {3217#(not (bvsgt (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:30:58,904 INFO L273 TraceCheckUtils]: 11: Hoare triple {3242#(not (bvsgt (bvadd main_~n~0 (_ bv4294967294 32)) (_ bv0 32)))} ~j~0 := ~n~0; {3217#(not (bvsgt (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:30:58,905 INFO L273 TraceCheckUtils]: 10: Hoare triple {3246#(or (not (bvsgt (bvadd main_~n~0 (_ bv4294967294 32)) (_ bv0 32))) (bvslt main_~i~0 main_~n~0))} assume !~bvslt32(~i~0, ~n~0); {3242#(not (bvsgt (bvadd main_~n~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:30:58,906 INFO L273 TraceCheckUtils]: 9: Hoare triple {3246#(or (not (bvsgt (bvadd main_~n~0 (_ bv4294967294 32)) (_ bv0 32))) (bvslt main_~i~0 main_~n~0))} assume true; {3246#(or (not (bvsgt (bvadd main_~n~0 (_ bv4294967294 32)) (_ bv0 32))) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-14 18:30:58,907 INFO L273 TraceCheckUtils]: 8: Hoare triple {3253#(or (not (bvsgt (bvadd main_~n~0 (_ bv4294967294 32)) (_ bv0 32))) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0)))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3246#(or (not (bvsgt (bvadd main_~n~0 (_ bv4294967294 32)) (_ bv0 32))) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-14 18:30:58,907 INFO L273 TraceCheckUtils]: 7: Hoare triple {3253#(or (not (bvsgt (bvadd main_~n~0 (_ bv4294967294 32)) (_ bv0 32))) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0)))} assume true; {3253#(or (not (bvsgt (bvadd main_~n~0 (_ bv4294967294 32)) (_ bv0 32))) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0)))} is VALID [2018-11-14 18:30:58,950 INFO L273 TraceCheckUtils]: 6: Hoare triple {3260#(forall ((main_~n~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvsgt (bvadd main_~n~0 (_ bv4294967294 32)) (_ bv0 32))) (not (bvslt main_~i~0 main_~n~0))))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3253#(or (not (bvsgt (bvadd main_~n~0 (_ bv4294967294 32)) (_ bv0 32))) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0)))} is VALID [2018-11-14 18:30:58,951 INFO L273 TraceCheckUtils]: 5: Hoare triple {3260#(forall ((main_~n~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvsgt (bvadd main_~n~0 (_ bv4294967294 32)) (_ bv0 32))) (not (bvslt main_~i~0 main_~n~0))))} assume true; {3260#(forall ((main_~n~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvsgt (bvadd main_~n~0 (_ bv4294967294 32)) (_ bv0 32))) (not (bvslt main_~i~0 main_~n~0))))} is VALID [2018-11-14 18:30:58,953 INFO L273 TraceCheckUtils]: 4: Hoare triple {3062#true} havoc ~n~0;~k~0 := 0bv32;~i~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {3260#(forall ((main_~n~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvsgt (bvadd main_~n~0 (_ bv4294967294 32)) (_ bv0 32))) (not (bvslt main_~i~0 main_~n~0))))} is VALID [2018-11-14 18:30:58,953 INFO L256 TraceCheckUtils]: 3: Hoare triple {3062#true} call #t~ret6 := main(); {3062#true} is VALID [2018-11-14 18:30:58,953 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3062#true} {3062#true} #48#return; {3062#true} is VALID [2018-11-14 18:30:58,953 INFO L273 TraceCheckUtils]: 1: Hoare triple {3062#true} assume true; {3062#true} is VALID [2018-11-14 18:30:58,954 INFO L256 TraceCheckUtils]: 0: Hoare triple {3062#true} call ULTIMATE.init(); {3062#true} is VALID [2018-11-14 18:30:58,955 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 18:30:58,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:30:58,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-14 18:30:58,958 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2018-11-14 18:30:58,958 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:30:58,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 18:30:59,079 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:30:59,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 18:30:59,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 18:30:59,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-11-14 18:30:59,080 INFO L87 Difference]: Start difference. First operand 107 states and 128 transitions. Second operand 16 states. [2018-11-14 18:31:00,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:31:00,521 INFO L93 Difference]: Finished difference Result 124 states and 146 transitions. [2018-11-14 18:31:00,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 18:31:00,521 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2018-11-14 18:31:00,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:31:00,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 18:31:00,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 49 transitions. [2018-11-14 18:31:00,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 18:31:00,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 49 transitions. [2018-11-14 18:31:00,526 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 49 transitions. [2018-11-14 18:31:00,612 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:31:00,615 INFO L225 Difference]: With dead ends: 124 [2018-11-14 18:31:00,616 INFO L226 Difference]: Without dead ends: 103 [2018-11-14 18:31:00,617 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2018-11-14 18:31:00,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-14 18:31:00,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-11-14 18:31:00,942 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:31:00,942 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 103 states. [2018-11-14 18:31:00,942 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 103 states. [2018-11-14 18:31:00,943 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 103 states. [2018-11-14 18:31:00,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:31:00,949 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2018-11-14 18:31:00,949 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2018-11-14 18:31:00,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:31:00,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:31:00,950 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 103 states. [2018-11-14 18:31:00,950 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 103 states. [2018-11-14 18:31:00,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:31:00,956 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2018-11-14 18:31:00,956 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2018-11-14 18:31:00,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:31:00,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:31:00,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:31:00,957 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:31:00,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-14 18:31:00,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 122 transitions. [2018-11-14 18:31:00,962 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 122 transitions. Word has length 34 [2018-11-14 18:31:00,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:31:00,963 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 122 transitions. [2018-11-14 18:31:00,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 18:31:00,963 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2018-11-14 18:31:00,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-14 18:31:00,966 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:31:00,966 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:31:00,966 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:31:00,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:31:00,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1040535476, now seen corresponding path program 3 times [2018-11-14 18:31:00,968 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:31:00,968 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 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 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:31:00,994 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:31:01,250 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-14 18:31:01,250 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:31:01,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:31:01,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:31:01,518 INFO L256 TraceCheckUtils]: 0: Hoare triple {3824#true} call ULTIMATE.init(); {3824#true} is VALID [2018-11-14 18:31:01,518 INFO L273 TraceCheckUtils]: 1: Hoare triple {3824#true} assume true; {3824#true} is VALID [2018-11-14 18:31:01,519 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3824#true} {3824#true} #48#return; {3824#true} is VALID [2018-11-14 18:31:01,519 INFO L256 TraceCheckUtils]: 3: Hoare triple {3824#true} call #t~ret6 := main(); {3824#true} is VALID [2018-11-14 18:31:01,520 INFO L273 TraceCheckUtils]: 4: Hoare triple {3824#true} havoc ~n~0;~k~0 := 0bv32;~i~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {3841#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-14 18:31:01,521 INFO L273 TraceCheckUtils]: 5: Hoare triple {3841#(= main_~k~0 (_ bv0 32))} assume true; {3841#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-14 18:31:01,522 INFO L273 TraceCheckUtils]: 6: Hoare triple {3841#(= main_~k~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3848#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:01,522 INFO L273 TraceCheckUtils]: 7: Hoare triple {3848#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {3848#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:01,524 INFO L273 TraceCheckUtils]: 8: Hoare triple {3848#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3855#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-14 18:31:01,525 INFO L273 TraceCheckUtils]: 9: Hoare triple {3855#(= (_ bv2 32) main_~k~0)} assume true; {3855#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-14 18:31:01,526 INFO L273 TraceCheckUtils]: 10: Hoare triple {3855#(= (_ bv2 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3862#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:01,527 INFO L273 TraceCheckUtils]: 11: Hoare triple {3862#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {3862#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:01,528 INFO L273 TraceCheckUtils]: 12: Hoare triple {3862#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3869#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:01,528 INFO L273 TraceCheckUtils]: 13: Hoare triple {3869#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume true; {3869#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:01,529 INFO L273 TraceCheckUtils]: 14: Hoare triple {3869#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3876#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:01,529 INFO L273 TraceCheckUtils]: 15: Hoare triple {3876#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {3876#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:01,530 INFO L273 TraceCheckUtils]: 16: Hoare triple {3876#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3883#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-14 18:31:01,530 INFO L273 TraceCheckUtils]: 17: Hoare triple {3883#(= (_ bv6 32) main_~k~0)} assume true; {3883#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-14 18:31:01,530 INFO L273 TraceCheckUtils]: 18: Hoare triple {3883#(= (_ bv6 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3890#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:01,531 INFO L273 TraceCheckUtils]: 19: Hoare triple {3890#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} assume true; {3890#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:01,531 INFO L273 TraceCheckUtils]: 20: Hoare triple {3890#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3897#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:01,532 INFO L273 TraceCheckUtils]: 21: Hoare triple {3897#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} assume true; {3897#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:01,532 INFO L273 TraceCheckUtils]: 22: Hoare triple {3897#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3904#(= (_ bv9 32) main_~k~0)} is VALID [2018-11-14 18:31:01,533 INFO L273 TraceCheckUtils]: 23: Hoare triple {3904#(= (_ bv9 32) main_~k~0)} assume true; {3904#(= (_ bv9 32) main_~k~0)} is VALID [2018-11-14 18:31:01,536 INFO L273 TraceCheckUtils]: 24: Hoare triple {3904#(= (_ bv9 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3911#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:01,537 INFO L273 TraceCheckUtils]: 25: Hoare triple {3911#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} assume true; {3911#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:01,538 INFO L273 TraceCheckUtils]: 26: Hoare triple {3911#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3918#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-14 18:31:01,538 INFO L273 TraceCheckUtils]: 27: Hoare triple {3918#(= (_ bv11 32) main_~k~0)} assume true; {3918#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-14 18:31:01,539 INFO L273 TraceCheckUtils]: 28: Hoare triple {3918#(= (_ bv11 32) main_~k~0)} assume !~bvslt32(~i~0, ~n~0); {3918#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-14 18:31:01,539 INFO L273 TraceCheckUtils]: 29: Hoare triple {3918#(= (_ bv11 32) main_~k~0)} ~j~0 := ~n~0; {3918#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-14 18:31:01,539 INFO L273 TraceCheckUtils]: 30: Hoare triple {3918#(= (_ bv11 32) main_~k~0)} assume true; {3918#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-14 18:31:01,540 INFO L273 TraceCheckUtils]: 31: Hoare triple {3918#(= (_ bv11 32) main_~k~0)} assume !!~bvsgt32(~j~0, 0bv32); {3918#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-14 18:31:01,540 INFO L256 TraceCheckUtils]: 32: Hoare triple {3918#(= (_ bv11 32) main_~k~0)} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {3937#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:01,541 INFO L273 TraceCheckUtils]: 33: Hoare triple {3937#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {3941#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:01,542 INFO L273 TraceCheckUtils]: 34: Hoare triple {3941#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {3825#false} is VALID [2018-11-14 18:31:01,542 INFO L273 TraceCheckUtils]: 35: Hoare triple {3825#false} assume !false; {3825#false} is VALID [2018-11-14 18:31:01,544 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:31:01,544 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:31:02,442 INFO L273 TraceCheckUtils]: 35: Hoare triple {3825#false} assume !false; {3825#false} is VALID [2018-11-14 18:31:02,442 INFO L273 TraceCheckUtils]: 34: Hoare triple {3951#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume ~cond == 0bv32; {3825#false} is VALID [2018-11-14 18:31:02,443 INFO L273 TraceCheckUtils]: 33: Hoare triple {3955#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {3951#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-14 18:31:02,443 INFO L256 TraceCheckUtils]: 32: Hoare triple {3959#(bvsgt main_~k~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {3955#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-14 18:31:02,444 INFO L273 TraceCheckUtils]: 31: Hoare triple {3959#(bvsgt main_~k~0 (_ bv0 32))} assume !!~bvsgt32(~j~0, 0bv32); {3959#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 18:31:02,444 INFO L273 TraceCheckUtils]: 30: Hoare triple {3959#(bvsgt main_~k~0 (_ bv0 32))} assume true; {3959#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 18:31:02,447 INFO L273 TraceCheckUtils]: 29: Hoare triple {3959#(bvsgt main_~k~0 (_ bv0 32))} ~j~0 := ~n~0; {3959#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 18:31:02,448 INFO L273 TraceCheckUtils]: 28: Hoare triple {3959#(bvsgt main_~k~0 (_ bv0 32))} assume !~bvslt32(~i~0, ~n~0); {3959#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 18:31:02,448 INFO L273 TraceCheckUtils]: 27: Hoare triple {3959#(bvsgt main_~k~0 (_ bv0 32))} assume true; {3959#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 18:31:02,448 INFO L273 TraceCheckUtils]: 26: Hoare triple {3978#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3959#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 18:31:02,449 INFO L273 TraceCheckUtils]: 25: Hoare triple {3978#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} assume true; {3978#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:02,452 INFO L273 TraceCheckUtils]: 24: Hoare triple {3985#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3978#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:02,453 INFO L273 TraceCheckUtils]: 23: Hoare triple {3985#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} assume true; {3985#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:02,456 INFO L273 TraceCheckUtils]: 22: Hoare triple {3992#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3985#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:02,456 INFO L273 TraceCheckUtils]: 21: Hoare triple {3992#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} assume true; {3992#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:02,459 INFO L273 TraceCheckUtils]: 20: Hoare triple {3999#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3992#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:02,460 INFO L273 TraceCheckUtils]: 19: Hoare triple {3999#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} assume true; {3999#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:02,462 INFO L273 TraceCheckUtils]: 18: Hoare triple {4006#(bvsgt (bvadd main_~k~0 (_ bv5 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3999#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:02,463 INFO L273 TraceCheckUtils]: 17: Hoare triple {4006#(bvsgt (bvadd main_~k~0 (_ bv5 32)) (_ bv0 32))} assume true; {4006#(bvsgt (bvadd main_~k~0 (_ bv5 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:02,465 INFO L273 TraceCheckUtils]: 16: Hoare triple {4013#(bvsgt (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4006#(bvsgt (bvadd main_~k~0 (_ bv5 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:02,466 INFO L273 TraceCheckUtils]: 15: Hoare triple {4013#(bvsgt (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32))} assume true; {4013#(bvsgt (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:02,469 INFO L273 TraceCheckUtils]: 14: Hoare triple {4020#(bvsgt (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4013#(bvsgt (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:02,469 INFO L273 TraceCheckUtils]: 13: Hoare triple {4020#(bvsgt (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32))} assume true; {4020#(bvsgt (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:02,472 INFO L273 TraceCheckUtils]: 12: Hoare triple {4027#(bvsgt (bvadd main_~k~0 (_ bv8 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4020#(bvsgt (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:02,472 INFO L273 TraceCheckUtils]: 11: Hoare triple {4027#(bvsgt (bvadd main_~k~0 (_ bv8 32)) (_ bv0 32))} assume true; {4027#(bvsgt (bvadd main_~k~0 (_ bv8 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:02,475 INFO L273 TraceCheckUtils]: 10: Hoare triple {4034#(bvsgt (bvadd main_~k~0 (_ bv9 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4027#(bvsgt (bvadd main_~k~0 (_ bv8 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:02,481 INFO L273 TraceCheckUtils]: 9: Hoare triple {4034#(bvsgt (bvadd main_~k~0 (_ bv9 32)) (_ bv0 32))} assume true; {4034#(bvsgt (bvadd main_~k~0 (_ bv9 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:02,485 INFO L273 TraceCheckUtils]: 8: Hoare triple {4041#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4034#(bvsgt (bvadd main_~k~0 (_ bv9 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:02,485 INFO L273 TraceCheckUtils]: 7: Hoare triple {4041#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} assume true; {4041#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:02,488 INFO L273 TraceCheckUtils]: 6: Hoare triple {4048#(bvsgt (bvadd main_~k~0 (_ bv11 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4041#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:02,488 INFO L273 TraceCheckUtils]: 5: Hoare triple {4048#(bvsgt (bvadd main_~k~0 (_ bv11 32)) (_ bv0 32))} assume true; {4048#(bvsgt (bvadd main_~k~0 (_ bv11 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:02,489 INFO L273 TraceCheckUtils]: 4: Hoare triple {3824#true} havoc ~n~0;~k~0 := 0bv32;~i~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {4048#(bvsgt (bvadd main_~k~0 (_ bv11 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:02,489 INFO L256 TraceCheckUtils]: 3: Hoare triple {3824#true} call #t~ret6 := main(); {3824#true} is VALID [2018-11-14 18:31:02,489 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3824#true} {3824#true} #48#return; {3824#true} is VALID [2018-11-14 18:31:02,489 INFO L273 TraceCheckUtils]: 1: Hoare triple {3824#true} assume true; {3824#true} is VALID [2018-11-14 18:31:02,489 INFO L256 TraceCheckUtils]: 0: Hoare triple {3824#true} call ULTIMATE.init(); {3824#true} is VALID [2018-11-14 18:31:02,491 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:31:02,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:31:02,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2018-11-14 18:31:02,494 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 36 [2018-11-14 18:31:02,494 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:31:02,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-14 18:31:02,596 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:31:02,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-14 18:31:02,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-14 18:31:02,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=668, Unknown=0, NotChecked=0, Total=870 [2018-11-14 18:31:02,597 INFO L87 Difference]: Start difference. First operand 103 states and 122 transitions. Second operand 30 states. [2018-11-14 18:31:28,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:31:28,684 INFO L93 Difference]: Finished difference Result 537 states and 665 transitions. [2018-11-14 18:31:28,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-11-14 18:31:28,684 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 36 [2018-11-14 18:31:28,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:31:28,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 18:31:28,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 564 transitions. [2018-11-14 18:31:28,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 18:31:28,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 564 transitions. [2018-11-14 18:31:28,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 95 states and 564 transitions. [2018-11-14 18:31:30,585 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 564 edges. 564 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:31:30,608 INFO L225 Difference]: With dead ends: 537 [2018-11-14 18:31:30,609 INFO L226 Difference]: Without dead ends: 535 [2018-11-14 18:31:30,613 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2424 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=2408, Invalid=6904, Unknown=0, NotChecked=0, Total=9312 [2018-11-14 18:31:30,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-11-14 18:31:30,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 207. [2018-11-14 18:31:30,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:31:30,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 535 states. Second operand 207 states. [2018-11-14 18:31:30,891 INFO L74 IsIncluded]: Start isIncluded. First operand 535 states. Second operand 207 states. [2018-11-14 18:31:30,891 INFO L87 Difference]: Start difference. First operand 535 states. Second operand 207 states. [2018-11-14 18:31:30,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:31:30,928 INFO L93 Difference]: Finished difference Result 535 states and 663 transitions. [2018-11-14 18:31:30,928 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 663 transitions. [2018-11-14 18:31:30,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:31:30,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:31:30,932 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand 535 states. [2018-11-14 18:31:30,932 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 535 states. [2018-11-14 18:31:30,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:31:30,968 INFO L93 Difference]: Finished difference Result 535 states and 663 transitions. [2018-11-14 18:31:30,968 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 663 transitions. [2018-11-14 18:31:30,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:31:30,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:31:30,971 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:31:30,971 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:31:30,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-11-14 18:31:30,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 256 transitions. [2018-11-14 18:31:30,980 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 256 transitions. Word has length 36 [2018-11-14 18:31:30,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:31:30,980 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 256 transitions. [2018-11-14 18:31:30,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-14 18:31:30,981 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 256 transitions. [2018-11-14 18:31:30,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-14 18:31:30,982 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:31:30,982 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:31:30,982 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:31:30,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:31:30,983 INFO L82 PathProgramCache]: Analyzing trace with hash 959019949, now seen corresponding path program 4 times [2018-11-14 18:31:30,983 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:31:30,983 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 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 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:31:31,012 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:31:31,067 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:31:31,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:31:31,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:31:31,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:31:31,368 INFO L256 TraceCheckUtils]: 0: Hoare triple {6371#true} call ULTIMATE.init(); {6371#true} is VALID [2018-11-14 18:31:31,369 INFO L273 TraceCheckUtils]: 1: Hoare triple {6371#true} assume true; {6371#true} is VALID [2018-11-14 18:31:31,369 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6371#true} {6371#true} #48#return; {6371#true} is VALID [2018-11-14 18:31:31,369 INFO L256 TraceCheckUtils]: 3: Hoare triple {6371#true} call #t~ret6 := main(); {6371#true} is VALID [2018-11-14 18:31:31,369 INFO L273 TraceCheckUtils]: 4: Hoare triple {6371#true} havoc ~n~0;~k~0 := 0bv32;~i~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {6388#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 18:31:31,370 INFO L273 TraceCheckUtils]: 5: Hoare triple {6388#(= main_~i~0 (_ bv0 32))} assume true; {6388#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 18:31:31,371 INFO L273 TraceCheckUtils]: 6: Hoare triple {6388#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {6395#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:31:31,371 INFO L273 TraceCheckUtils]: 7: Hoare triple {6395#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {6395#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:31:31,373 INFO L273 TraceCheckUtils]: 8: Hoare triple {6395#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {6402#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-14 18:31:31,373 INFO L273 TraceCheckUtils]: 9: Hoare triple {6402#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv2 32) main_~i~0))} assume true; {6402#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-14 18:31:31,374 INFO L273 TraceCheckUtils]: 10: Hoare triple {6402#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv2 32) main_~i~0))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {6409#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:31:31,375 INFO L273 TraceCheckUtils]: 11: Hoare triple {6409#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume true; {6409#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:31:31,376 INFO L273 TraceCheckUtils]: 12: Hoare triple {6409#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~n~0); {6416#(and (bvslt (_ bv2 32) main_~n~0) (not (bvslt (_ bv3 32) main_~n~0)))} is VALID [2018-11-14 18:31:31,376 INFO L273 TraceCheckUtils]: 13: Hoare triple {6416#(and (bvslt (_ bv2 32) main_~n~0) (not (bvslt (_ bv3 32) main_~n~0)))} ~j~0 := ~n~0; {6420#(and (bvslt (_ bv2 32) main_~j~0) (not (bvslt (_ bv3 32) main_~j~0)))} is VALID [2018-11-14 18:31:31,377 INFO L273 TraceCheckUtils]: 14: Hoare triple {6420#(and (bvslt (_ bv2 32) main_~j~0) (not (bvslt (_ bv3 32) main_~j~0)))} assume true; {6420#(and (bvslt (_ bv2 32) main_~j~0) (not (bvslt (_ bv3 32) main_~j~0)))} is VALID [2018-11-14 18:31:31,377 INFO L273 TraceCheckUtils]: 15: Hoare triple {6420#(and (bvslt (_ bv2 32) main_~j~0) (not (bvslt (_ bv3 32) main_~j~0)))} assume !!~bvsgt32(~j~0, 0bv32); {6420#(and (bvslt (_ bv2 32) main_~j~0) (not (bvslt (_ bv3 32) main_~j~0)))} is VALID [2018-11-14 18:31:31,378 INFO L256 TraceCheckUtils]: 16: Hoare triple {6420#(and (bvslt (_ bv2 32) main_~j~0) (not (bvslt (_ bv3 32) main_~j~0)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {6371#true} is VALID [2018-11-14 18:31:31,378 INFO L273 TraceCheckUtils]: 17: Hoare triple {6371#true} ~cond := #in~cond; {6371#true} is VALID [2018-11-14 18:31:31,378 INFO L273 TraceCheckUtils]: 18: Hoare triple {6371#true} assume !(~cond == 0bv32); {6371#true} is VALID [2018-11-14 18:31:31,378 INFO L273 TraceCheckUtils]: 19: Hoare triple {6371#true} assume true; {6371#true} is VALID [2018-11-14 18:31:31,379 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {6371#true} {6420#(and (bvslt (_ bv2 32) main_~j~0) (not (bvslt (_ bv3 32) main_~j~0)))} #52#return; {6420#(and (bvslt (_ bv2 32) main_~j~0) (not (bvslt (_ bv3 32) main_~j~0)))} is VALID [2018-11-14 18:31:31,383 INFO L273 TraceCheckUtils]: 21: Hoare triple {6420#(and (bvslt (_ bv2 32) main_~j~0) (not (bvslt (_ bv3 32) main_~j~0)))} #t~post4 := ~j~0;~j~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {6445#(and (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv1 32))) (not (bvslt (_ bv3 32) (bvadd main_~j~0 (_ bv1 32)))))} is VALID [2018-11-14 18:31:31,385 INFO L273 TraceCheckUtils]: 22: Hoare triple {6445#(and (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv1 32))) (not (bvslt (_ bv3 32) (bvadd main_~j~0 (_ bv1 32)))))} assume true; {6445#(and (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv1 32))) (not (bvslt (_ bv3 32) (bvadd main_~j~0 (_ bv1 32)))))} is VALID [2018-11-14 18:31:31,385 INFO L273 TraceCheckUtils]: 23: Hoare triple {6445#(and (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv1 32))) (not (bvslt (_ bv3 32) (bvadd main_~j~0 (_ bv1 32)))))} assume !!~bvsgt32(~j~0, 0bv32); {6445#(and (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv1 32))) (not (bvslt (_ bv3 32) (bvadd main_~j~0 (_ bv1 32)))))} is VALID [2018-11-14 18:31:31,385 INFO L256 TraceCheckUtils]: 24: Hoare triple {6445#(and (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv1 32))) (not (bvslt (_ bv3 32) (bvadd main_~j~0 (_ bv1 32)))))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {6371#true} is VALID [2018-11-14 18:31:31,385 INFO L273 TraceCheckUtils]: 25: Hoare triple {6371#true} ~cond := #in~cond; {6371#true} is VALID [2018-11-14 18:31:31,386 INFO L273 TraceCheckUtils]: 26: Hoare triple {6371#true} assume !(~cond == 0bv32); {6371#true} is VALID [2018-11-14 18:31:31,386 INFO L273 TraceCheckUtils]: 27: Hoare triple {6371#true} assume true; {6371#true} is VALID [2018-11-14 18:31:31,386 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {6371#true} {6445#(and (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv1 32))) (not (bvslt (_ bv3 32) (bvadd main_~j~0 (_ bv1 32)))))} #52#return; {6445#(and (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv1 32))) (not (bvslt (_ bv3 32) (bvadd main_~j~0 (_ bv1 32)))))} is VALID [2018-11-14 18:31:31,390 INFO L273 TraceCheckUtils]: 29: Hoare triple {6445#(and (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv1 32))) (not (bvslt (_ bv3 32) (bvadd main_~j~0 (_ bv1 32)))))} #t~post4 := ~j~0;~j~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {6470#(and (not (bvslt (_ bv3 32) (bvadd main_~j~0 (_ bv2 32)))) (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv2 32))))} is VALID [2018-11-14 18:31:31,390 INFO L273 TraceCheckUtils]: 30: Hoare triple {6470#(and (not (bvslt (_ bv3 32) (bvadd main_~j~0 (_ bv2 32)))) (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv2 32))))} assume true; {6470#(and (not (bvslt (_ bv3 32) (bvadd main_~j~0 (_ bv2 32)))) (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv2 32))))} is VALID [2018-11-14 18:31:31,391 INFO L273 TraceCheckUtils]: 31: Hoare triple {6470#(and (not (bvslt (_ bv3 32) (bvadd main_~j~0 (_ bv2 32)))) (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv2 32))))} assume !!~bvsgt32(~j~0, 0bv32); {6470#(and (not (bvslt (_ bv3 32) (bvadd main_~j~0 (_ bv2 32)))) (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv2 32))))} is VALID [2018-11-14 18:31:31,391 INFO L256 TraceCheckUtils]: 32: Hoare triple {6470#(and (not (bvslt (_ bv3 32) (bvadd main_~j~0 (_ bv2 32)))) (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv2 32))))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {6371#true} is VALID [2018-11-14 18:31:31,391 INFO L273 TraceCheckUtils]: 33: Hoare triple {6371#true} ~cond := #in~cond; {6371#true} is VALID [2018-11-14 18:31:31,391 INFO L273 TraceCheckUtils]: 34: Hoare triple {6371#true} assume !(~cond == 0bv32); {6371#true} is VALID [2018-11-14 18:31:31,391 INFO L273 TraceCheckUtils]: 35: Hoare triple {6371#true} assume true; {6371#true} is VALID [2018-11-14 18:31:31,392 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {6371#true} {6470#(and (not (bvslt (_ bv3 32) (bvadd main_~j~0 (_ bv2 32)))) (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv2 32))))} #52#return; {6470#(and (not (bvslt (_ bv3 32) (bvadd main_~j~0 (_ bv2 32)))) (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv2 32))))} is VALID [2018-11-14 18:31:31,394 INFO L273 TraceCheckUtils]: 37: Hoare triple {6470#(and (not (bvslt (_ bv3 32) (bvadd main_~j~0 (_ bv2 32)))) (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv2 32))))} #t~post4 := ~j~0;~j~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {6495#(and (not (bvslt (_ bv3 32) (bvadd main_~j~0 (_ bv3 32)))) (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv3 32))))} is VALID [2018-11-14 18:31:31,395 INFO L273 TraceCheckUtils]: 38: Hoare triple {6495#(and (not (bvslt (_ bv3 32) (bvadd main_~j~0 (_ bv3 32)))) (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv3 32))))} assume true; {6495#(and (not (bvslt (_ bv3 32) (bvadd main_~j~0 (_ bv3 32)))) (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv3 32))))} is VALID [2018-11-14 18:31:31,396 INFO L273 TraceCheckUtils]: 39: Hoare triple {6495#(and (not (bvslt (_ bv3 32) (bvadd main_~j~0 (_ bv3 32)))) (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv3 32))))} assume !!~bvsgt32(~j~0, 0bv32); {6372#false} is VALID [2018-11-14 18:31:31,396 INFO L256 TraceCheckUtils]: 40: Hoare triple {6372#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {6372#false} is VALID [2018-11-14 18:31:31,396 INFO L273 TraceCheckUtils]: 41: Hoare triple {6372#false} ~cond := #in~cond; {6372#false} is VALID [2018-11-14 18:31:31,396 INFO L273 TraceCheckUtils]: 42: Hoare triple {6372#false} assume ~cond == 0bv32; {6372#false} is VALID [2018-11-14 18:31:31,396 INFO L273 TraceCheckUtils]: 43: Hoare triple {6372#false} assume !false; {6372#false} is VALID [2018-11-14 18:31:31,399 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-14 18:31:31,399 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:31:32,284 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-14 18:31:32,764 INFO L273 TraceCheckUtils]: 43: Hoare triple {6372#false} assume !false; {6372#false} is VALID [2018-11-14 18:31:32,764 INFO L273 TraceCheckUtils]: 42: Hoare triple {6372#false} assume ~cond == 0bv32; {6372#false} is VALID [2018-11-14 18:31:32,764 INFO L273 TraceCheckUtils]: 41: Hoare triple {6372#false} ~cond := #in~cond; {6372#false} is VALID [2018-11-14 18:31:32,764 INFO L256 TraceCheckUtils]: 40: Hoare triple {6372#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {6372#false} is VALID [2018-11-14 18:31:32,766 INFO L273 TraceCheckUtils]: 39: Hoare triple {6526#(not (bvsgt main_~j~0 (_ bv0 32)))} assume !!~bvsgt32(~j~0, 0bv32); {6372#false} is VALID [2018-11-14 18:31:32,766 INFO L273 TraceCheckUtils]: 38: Hoare triple {6526#(not (bvsgt main_~j~0 (_ bv0 32)))} assume true; {6526#(not (bvsgt main_~j~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:32,768 INFO L273 TraceCheckUtils]: 37: Hoare triple {6533#(not (bvsgt (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post4 := ~j~0;~j~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {6526#(not (bvsgt main_~j~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:32,770 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {6371#true} {6533#(not (bvsgt (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} #52#return; {6533#(not (bvsgt (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:31:32,770 INFO L273 TraceCheckUtils]: 35: Hoare triple {6371#true} assume true; {6371#true} is VALID [2018-11-14 18:31:32,770 INFO L273 TraceCheckUtils]: 34: Hoare triple {6371#true} assume !(~cond == 0bv32); {6371#true} is VALID [2018-11-14 18:31:32,770 INFO L273 TraceCheckUtils]: 33: Hoare triple {6371#true} ~cond := #in~cond; {6371#true} is VALID [2018-11-14 18:31:32,770 INFO L256 TraceCheckUtils]: 32: Hoare triple {6533#(not (bvsgt (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {6371#true} is VALID [2018-11-14 18:31:32,771 INFO L273 TraceCheckUtils]: 31: Hoare triple {6533#(not (bvsgt (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsgt32(~j~0, 0bv32); {6533#(not (bvsgt (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:31:32,772 INFO L273 TraceCheckUtils]: 30: Hoare triple {6533#(not (bvsgt (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {6533#(not (bvsgt (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:31:32,776 INFO L273 TraceCheckUtils]: 29: Hoare triple {6558#(not (bvsgt (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)))} #t~post4 := ~j~0;~j~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {6533#(not (bvsgt (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:31:32,777 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {6371#true} {6558#(not (bvsgt (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)))} #52#return; {6558#(not (bvsgt (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:31:32,777 INFO L273 TraceCheckUtils]: 27: Hoare triple {6371#true} assume true; {6371#true} is VALID [2018-11-14 18:31:32,777 INFO L273 TraceCheckUtils]: 26: Hoare triple {6371#true} assume !(~cond == 0bv32); {6371#true} is VALID [2018-11-14 18:31:32,777 INFO L273 TraceCheckUtils]: 25: Hoare triple {6371#true} ~cond := #in~cond; {6371#true} is VALID [2018-11-14 18:31:32,777 INFO L256 TraceCheckUtils]: 24: Hoare triple {6558#(not (bvsgt (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {6371#true} is VALID [2018-11-14 18:31:32,787 INFO L273 TraceCheckUtils]: 23: Hoare triple {6558#(not (bvsgt (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvsgt32(~j~0, 0bv32); {6558#(not (bvsgt (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:31:32,790 INFO L273 TraceCheckUtils]: 22: Hoare triple {6558#(not (bvsgt (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)))} assume true; {6558#(not (bvsgt (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:31:32,796 INFO L273 TraceCheckUtils]: 21: Hoare triple {6583#(not (bvsgt (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)))} #t~post4 := ~j~0;~j~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {6558#(not (bvsgt (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:31:32,798 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {6371#true} {6583#(not (bvsgt (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)))} #52#return; {6583#(not (bvsgt (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:31:32,798 INFO L273 TraceCheckUtils]: 19: Hoare triple {6371#true} assume true; {6371#true} is VALID [2018-11-14 18:31:32,798 INFO L273 TraceCheckUtils]: 18: Hoare triple {6371#true} assume !(~cond == 0bv32); {6371#true} is VALID [2018-11-14 18:31:32,798 INFO L273 TraceCheckUtils]: 17: Hoare triple {6371#true} ~cond := #in~cond; {6371#true} is VALID [2018-11-14 18:31:32,798 INFO L256 TraceCheckUtils]: 16: Hoare triple {6583#(not (bvsgt (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {6371#true} is VALID [2018-11-14 18:31:32,799 INFO L273 TraceCheckUtils]: 15: Hoare triple {6583#(not (bvsgt (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !!~bvsgt32(~j~0, 0bv32); {6583#(not (bvsgt (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:31:32,800 INFO L273 TraceCheckUtils]: 14: Hoare triple {6583#(not (bvsgt (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)))} assume true; {6583#(not (bvsgt (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:31:32,800 INFO L273 TraceCheckUtils]: 13: Hoare triple {6608#(not (bvsgt (bvadd main_~n~0 (_ bv4294967293 32)) (_ bv0 32)))} ~j~0 := ~n~0; {6583#(not (bvsgt (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:31:32,803 INFO L273 TraceCheckUtils]: 12: Hoare triple {6612#(or (not (bvsgt (bvadd main_~n~0 (_ bv4294967293 32)) (_ bv0 32))) (bvslt main_~i~0 main_~n~0))} assume !~bvslt32(~i~0, ~n~0); {6608#(not (bvsgt (bvadd main_~n~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:31:32,803 INFO L273 TraceCheckUtils]: 11: Hoare triple {6612#(or (not (bvsgt (bvadd main_~n~0 (_ bv4294967293 32)) (_ bv0 32))) (bvslt main_~i~0 main_~n~0))} assume true; {6612#(or (not (bvsgt (bvadd main_~n~0 (_ bv4294967293 32)) (_ bv0 32))) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-14 18:31:32,806 INFO L273 TraceCheckUtils]: 10: Hoare triple {6619#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0)) (not (bvsgt (bvadd main_~n~0 (_ bv4294967293 32)) (_ bv0 32))))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {6612#(or (not (bvsgt (bvadd main_~n~0 (_ bv4294967293 32)) (_ bv0 32))) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-14 18:31:32,806 INFO L273 TraceCheckUtils]: 9: Hoare triple {6619#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0)) (not (bvsgt (bvadd main_~n~0 (_ bv4294967293 32)) (_ bv0 32))))} assume true; {6619#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0)) (not (bvsgt (bvadd main_~n~0 (_ bv4294967293 32)) (_ bv0 32))))} is VALID [2018-11-14 18:31:32,849 INFO L273 TraceCheckUtils]: 8: Hoare triple {6626#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvslt main_~i~0 main_~n~0)) (not (bvsgt (bvadd main_~n~0 (_ bv4294967293 32)) (_ bv0 32))))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {6619#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0)) (not (bvsgt (bvadd main_~n~0 (_ bv4294967293 32)) (_ bv0 32))))} is VALID [2018-11-14 18:31:32,850 INFO L273 TraceCheckUtils]: 7: Hoare triple {6626#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvslt main_~i~0 main_~n~0)) (not (bvsgt (bvadd main_~n~0 (_ bv4294967293 32)) (_ bv0 32))))} assume true; {6626#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvslt main_~i~0 main_~n~0)) (not (bvsgt (bvadd main_~n~0 (_ bv4294967293 32)) (_ bv0 32))))} is VALID [2018-11-14 18:31:33,008 INFO L273 TraceCheckUtils]: 6: Hoare triple {6633#(forall ((main_~n~0 (_ BitVec 32))) (or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (not (bvslt main_~i~0 main_~n~0)) (not (bvsgt (bvadd main_~n~0 (_ bv4294967293 32)) (_ bv0 32))) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {6626#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvslt main_~i~0 main_~n~0)) (not (bvsgt (bvadd main_~n~0 (_ bv4294967293 32)) (_ bv0 32))))} is VALID [2018-11-14 18:31:33,009 INFO L273 TraceCheckUtils]: 5: Hoare triple {6633#(forall ((main_~n~0 (_ BitVec 32))) (or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (not (bvslt main_~i~0 main_~n~0)) (not (bvsgt (bvadd main_~n~0 (_ bv4294967293 32)) (_ bv0 32))) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)))} assume true; {6633#(forall ((main_~n~0 (_ BitVec 32))) (or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (not (bvslt main_~i~0 main_~n~0)) (not (bvsgt (bvadd main_~n~0 (_ bv4294967293 32)) (_ bv0 32))) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)))} is VALID [2018-11-14 18:31:33,011 INFO L273 TraceCheckUtils]: 4: Hoare triple {6371#true} havoc ~n~0;~k~0 := 0bv32;~i~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {6633#(forall ((main_~n~0 (_ BitVec 32))) (or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (not (bvslt main_~i~0 main_~n~0)) (not (bvsgt (bvadd main_~n~0 (_ bv4294967293 32)) (_ bv0 32))) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)))} is VALID [2018-11-14 18:31:33,011 INFO L256 TraceCheckUtils]: 3: Hoare triple {6371#true} call #t~ret6 := main(); {6371#true} is VALID [2018-11-14 18:31:33,012 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6371#true} {6371#true} #48#return; {6371#true} is VALID [2018-11-14 18:31:33,012 INFO L273 TraceCheckUtils]: 1: Hoare triple {6371#true} assume true; {6371#true} is VALID [2018-11-14 18:31:33,012 INFO L256 TraceCheckUtils]: 0: Hoare triple {6371#true} call ULTIMATE.init(); {6371#true} is VALID [2018-11-14 18:31:33,018 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-14 18:31:33,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:31:33,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-11-14 18:31:33,021 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 44 [2018-11-14 18:31:33,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:31:33,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-14 18:31:33,325 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:31:33,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-14 18:31:33,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-14 18:31:33,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2018-11-14 18:31:33,327 INFO L87 Difference]: Start difference. First operand 207 states and 256 transitions. Second operand 20 states. [2018-11-14 18:31:34,142 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 18 [2018-11-14 18:31:34,693 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2018-11-14 18:31:36,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:31:36,121 INFO L93 Difference]: Finished difference Result 228 states and 279 transitions. [2018-11-14 18:31:36,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 18:31:36,121 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 44 [2018-11-14 18:31:36,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:31:36,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 18:31:36,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2018-11-14 18:31:36,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 18:31:36,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2018-11-14 18:31:36,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 56 transitions. [2018-11-14 18:31:36,346 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:31:36,352 INFO L225 Difference]: With dead ends: 228 [2018-11-14 18:31:36,352 INFO L226 Difference]: Without dead ends: 199 [2018-11-14 18:31:36,353 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2018-11-14 18:31:36,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-14 18:31:37,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-11-14 18:31:37,050 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:31:37,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 199 states. Second operand 199 states. [2018-11-14 18:31:37,050 INFO L74 IsIncluded]: Start isIncluded. First operand 199 states. Second operand 199 states. [2018-11-14 18:31:37,050 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 199 states. [2018-11-14 18:31:37,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:31:37,059 INFO L93 Difference]: Finished difference Result 199 states and 247 transitions. [2018-11-14 18:31:37,059 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 247 transitions. [2018-11-14 18:31:37,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:31:37,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:31:37,061 INFO L74 IsIncluded]: Start isIncluded. First operand 199 states. Second operand 199 states. [2018-11-14 18:31:37,061 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 199 states. [2018-11-14 18:31:37,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:31:37,070 INFO L93 Difference]: Finished difference Result 199 states and 247 transitions. [2018-11-14 18:31:37,070 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 247 transitions. [2018-11-14 18:31:37,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:31:37,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:31:37,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:31:37,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:31:37,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-11-14 18:31:37,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 247 transitions. [2018-11-14 18:31:37,078 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 247 transitions. Word has length 44 [2018-11-14 18:31:37,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:31:37,079 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 247 transitions. [2018-11-14 18:31:37,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-14 18:31:37,079 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 247 transitions. [2018-11-14 18:31:37,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-14 18:31:37,081 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:31:37,081 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:31:37,081 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:31:37,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:31:37,082 INFO L82 PathProgramCache]: Analyzing trace with hash 242031217, now seen corresponding path program 5 times [2018-11-14 18:31:37,082 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:31:37,082 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 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 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:31:37,111 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-11-14 18:31:37,431 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-11-14 18:31:37,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:31:37,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:31:37,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:31:37,669 INFO L256 TraceCheckUtils]: 0: Hoare triple {7692#true} call ULTIMATE.init(); {7692#true} is VALID [2018-11-14 18:31:37,670 INFO L273 TraceCheckUtils]: 1: Hoare triple {7692#true} assume true; {7692#true} is VALID [2018-11-14 18:31:37,670 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7692#true} {7692#true} #48#return; {7692#true} is VALID [2018-11-14 18:31:37,670 INFO L256 TraceCheckUtils]: 3: Hoare triple {7692#true} call #t~ret6 := main(); {7692#true} is VALID [2018-11-14 18:31:37,671 INFO L273 TraceCheckUtils]: 4: Hoare triple {7692#true} havoc ~n~0;~k~0 := 0bv32;~i~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {7709#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-14 18:31:37,671 INFO L273 TraceCheckUtils]: 5: Hoare triple {7709#(= main_~k~0 (_ bv0 32))} assume true; {7709#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-14 18:31:37,672 INFO L273 TraceCheckUtils]: 6: Hoare triple {7709#(= main_~k~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7716#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:37,672 INFO L273 TraceCheckUtils]: 7: Hoare triple {7716#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {7716#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:37,673 INFO L273 TraceCheckUtils]: 8: Hoare triple {7716#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7723#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-14 18:31:37,674 INFO L273 TraceCheckUtils]: 9: Hoare triple {7723#(= (_ bv2 32) main_~k~0)} assume true; {7723#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-14 18:31:37,675 INFO L273 TraceCheckUtils]: 10: Hoare triple {7723#(= (_ bv2 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7730#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:37,675 INFO L273 TraceCheckUtils]: 11: Hoare triple {7730#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {7730#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:37,677 INFO L273 TraceCheckUtils]: 12: Hoare triple {7730#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7737#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:37,678 INFO L273 TraceCheckUtils]: 13: Hoare triple {7737#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume true; {7737#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:37,678 INFO L273 TraceCheckUtils]: 14: Hoare triple {7737#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7744#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:37,679 INFO L273 TraceCheckUtils]: 15: Hoare triple {7744#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {7744#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:37,680 INFO L273 TraceCheckUtils]: 16: Hoare triple {7744#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7751#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-14 18:31:37,680 INFO L273 TraceCheckUtils]: 17: Hoare triple {7751#(= (_ bv6 32) main_~k~0)} assume true; {7751#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-14 18:31:37,681 INFO L273 TraceCheckUtils]: 18: Hoare triple {7751#(= (_ bv6 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7758#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:37,682 INFO L273 TraceCheckUtils]: 19: Hoare triple {7758#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} assume true; {7758#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:37,682 INFO L273 TraceCheckUtils]: 20: Hoare triple {7758#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7765#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:37,683 INFO L273 TraceCheckUtils]: 21: Hoare triple {7765#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} assume true; {7765#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:37,684 INFO L273 TraceCheckUtils]: 22: Hoare triple {7765#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7772#(= (_ bv9 32) main_~k~0)} is VALID [2018-11-14 18:31:37,684 INFO L273 TraceCheckUtils]: 23: Hoare triple {7772#(= (_ bv9 32) main_~k~0)} assume true; {7772#(= (_ bv9 32) main_~k~0)} is VALID [2018-11-14 18:31:37,686 INFO L273 TraceCheckUtils]: 24: Hoare triple {7772#(= (_ bv9 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7779#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:37,687 INFO L273 TraceCheckUtils]: 25: Hoare triple {7779#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} assume true; {7779#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:37,688 INFO L273 TraceCheckUtils]: 26: Hoare triple {7779#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7786#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-14 18:31:37,689 INFO L273 TraceCheckUtils]: 27: Hoare triple {7786#(= (_ bv11 32) main_~k~0)} assume true; {7786#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-14 18:31:37,690 INFO L273 TraceCheckUtils]: 28: Hoare triple {7786#(= (_ bv11 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7793#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:37,690 INFO L273 TraceCheckUtils]: 29: Hoare triple {7793#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} assume true; {7793#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:37,691 INFO L273 TraceCheckUtils]: 30: Hoare triple {7793#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} assume !~bvslt32(~i~0, ~n~0); {7793#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:37,691 INFO L273 TraceCheckUtils]: 31: Hoare triple {7793#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} ~j~0 := ~n~0; {7793#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:37,692 INFO L273 TraceCheckUtils]: 32: Hoare triple {7793#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} assume true; {7793#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:37,692 INFO L273 TraceCheckUtils]: 33: Hoare triple {7793#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvsgt32(~j~0, 0bv32); {7793#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:37,692 INFO L256 TraceCheckUtils]: 34: Hoare triple {7793#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {7692#true} is VALID [2018-11-14 18:31:37,692 INFO L273 TraceCheckUtils]: 35: Hoare triple {7692#true} ~cond := #in~cond; {7692#true} is VALID [2018-11-14 18:31:37,692 INFO L273 TraceCheckUtils]: 36: Hoare triple {7692#true} assume !(~cond == 0bv32); {7692#true} is VALID [2018-11-14 18:31:37,692 INFO L273 TraceCheckUtils]: 37: Hoare triple {7692#true} assume true; {7692#true} is VALID [2018-11-14 18:31:37,693 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {7692#true} {7793#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} #52#return; {7793#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:37,695 INFO L273 TraceCheckUtils]: 39: Hoare triple {7793#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} #t~post4 := ~j~0;~j~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {7786#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-14 18:31:37,695 INFO L273 TraceCheckUtils]: 40: Hoare triple {7786#(= (_ bv11 32) main_~k~0)} assume true; {7786#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-14 18:31:37,696 INFO L273 TraceCheckUtils]: 41: Hoare triple {7786#(= (_ bv11 32) main_~k~0)} assume !!~bvsgt32(~j~0, 0bv32); {7786#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-14 18:31:37,696 INFO L256 TraceCheckUtils]: 42: Hoare triple {7786#(= (_ bv11 32) main_~k~0)} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {7836#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:37,697 INFO L273 TraceCheckUtils]: 43: Hoare triple {7836#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {7840#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:37,697 INFO L273 TraceCheckUtils]: 44: Hoare triple {7840#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {7693#false} is VALID [2018-11-14 18:31:37,697 INFO L273 TraceCheckUtils]: 45: Hoare triple {7693#false} assume !false; {7693#false} is VALID [2018-11-14 18:31:37,699 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 2 proven. 159 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:31:37,699 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:31:38,709 INFO L273 TraceCheckUtils]: 45: Hoare triple {7693#false} assume !false; {7693#false} is VALID [2018-11-14 18:31:38,710 INFO L273 TraceCheckUtils]: 44: Hoare triple {7850#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume ~cond == 0bv32; {7693#false} is VALID [2018-11-14 18:31:38,711 INFO L273 TraceCheckUtils]: 43: Hoare triple {7854#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {7850#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-14 18:31:38,712 INFO L256 TraceCheckUtils]: 42: Hoare triple {7858#(bvsgt main_~k~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {7854#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-14 18:31:38,712 INFO L273 TraceCheckUtils]: 41: Hoare triple {7858#(bvsgt main_~k~0 (_ bv0 32))} assume !!~bvsgt32(~j~0, 0bv32); {7858#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 18:31:38,713 INFO L273 TraceCheckUtils]: 40: Hoare triple {7858#(bvsgt main_~k~0 (_ bv0 32))} assume true; {7858#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 18:31:38,714 INFO L273 TraceCheckUtils]: 39: Hoare triple {7868#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post4 := ~j~0;~j~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {7858#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 18:31:38,714 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {7692#true} {7868#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} #52#return; {7868#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:38,715 INFO L273 TraceCheckUtils]: 37: Hoare triple {7692#true} assume true; {7692#true} is VALID [2018-11-14 18:31:38,715 INFO L273 TraceCheckUtils]: 36: Hoare triple {7692#true} assume !(~cond == 0bv32); {7692#true} is VALID [2018-11-14 18:31:38,715 INFO L273 TraceCheckUtils]: 35: Hoare triple {7692#true} ~cond := #in~cond; {7692#true} is VALID [2018-11-14 18:31:38,715 INFO L256 TraceCheckUtils]: 34: Hoare triple {7868#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {7692#true} is VALID [2018-11-14 18:31:38,716 INFO L273 TraceCheckUtils]: 33: Hoare triple {7868#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvsgt32(~j~0, 0bv32); {7868#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:38,716 INFO L273 TraceCheckUtils]: 32: Hoare triple {7868#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {7868#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:38,717 INFO L273 TraceCheckUtils]: 31: Hoare triple {7868#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} ~j~0 := ~n~0; {7868#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:38,717 INFO L273 TraceCheckUtils]: 30: Hoare triple {7868#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, ~n~0); {7868#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:38,717 INFO L273 TraceCheckUtils]: 29: Hoare triple {7868#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {7868#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:38,721 INFO L273 TraceCheckUtils]: 28: Hoare triple {7858#(bvsgt main_~k~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7868#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:38,721 INFO L273 TraceCheckUtils]: 27: Hoare triple {7858#(bvsgt main_~k~0 (_ bv0 32))} assume true; {7858#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 18:31:38,722 INFO L273 TraceCheckUtils]: 26: Hoare triple {7908#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7858#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 18:31:38,723 INFO L273 TraceCheckUtils]: 25: Hoare triple {7908#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} assume true; {7908#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:38,725 INFO L273 TraceCheckUtils]: 24: Hoare triple {7915#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7908#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:38,726 INFO L273 TraceCheckUtils]: 23: Hoare triple {7915#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} assume true; {7915#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:38,742 INFO L273 TraceCheckUtils]: 22: Hoare triple {7922#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7915#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:38,743 INFO L273 TraceCheckUtils]: 21: Hoare triple {7922#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} assume true; {7922#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:38,746 INFO L273 TraceCheckUtils]: 20: Hoare triple {7929#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7922#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:38,746 INFO L273 TraceCheckUtils]: 19: Hoare triple {7929#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} assume true; {7929#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:38,749 INFO L273 TraceCheckUtils]: 18: Hoare triple {7936#(bvsgt (bvadd main_~k~0 (_ bv5 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7929#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:38,750 INFO L273 TraceCheckUtils]: 17: Hoare triple {7936#(bvsgt (bvadd main_~k~0 (_ bv5 32)) (_ bv0 32))} assume true; {7936#(bvsgt (bvadd main_~k~0 (_ bv5 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:38,754 INFO L273 TraceCheckUtils]: 16: Hoare triple {7943#(bvsgt (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7936#(bvsgt (bvadd main_~k~0 (_ bv5 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:38,754 INFO L273 TraceCheckUtils]: 15: Hoare triple {7943#(bvsgt (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32))} assume true; {7943#(bvsgt (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:38,757 INFO L273 TraceCheckUtils]: 14: Hoare triple {7950#(bvsgt (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7943#(bvsgt (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:38,757 INFO L273 TraceCheckUtils]: 13: Hoare triple {7950#(bvsgt (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32))} assume true; {7950#(bvsgt (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:38,760 INFO L273 TraceCheckUtils]: 12: Hoare triple {7957#(bvsgt (bvadd main_~k~0 (_ bv8 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7950#(bvsgt (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:38,761 INFO L273 TraceCheckUtils]: 11: Hoare triple {7957#(bvsgt (bvadd main_~k~0 (_ bv8 32)) (_ bv0 32))} assume true; {7957#(bvsgt (bvadd main_~k~0 (_ bv8 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:38,763 INFO L273 TraceCheckUtils]: 10: Hoare triple {7964#(bvsgt (bvadd main_~k~0 (_ bv9 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7957#(bvsgt (bvadd main_~k~0 (_ bv8 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:38,764 INFO L273 TraceCheckUtils]: 9: Hoare triple {7964#(bvsgt (bvadd main_~k~0 (_ bv9 32)) (_ bv0 32))} assume true; {7964#(bvsgt (bvadd main_~k~0 (_ bv9 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:38,767 INFO L273 TraceCheckUtils]: 8: Hoare triple {7971#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7964#(bvsgt (bvadd main_~k~0 (_ bv9 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:38,768 INFO L273 TraceCheckUtils]: 7: Hoare triple {7971#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} assume true; {7971#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:38,771 INFO L273 TraceCheckUtils]: 6: Hoare triple {7978#(bvsgt (bvadd main_~k~0 (_ bv11 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7971#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:38,771 INFO L273 TraceCheckUtils]: 5: Hoare triple {7978#(bvsgt (bvadd main_~k~0 (_ bv11 32)) (_ bv0 32))} assume true; {7978#(bvsgt (bvadd main_~k~0 (_ bv11 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:38,772 INFO L273 TraceCheckUtils]: 4: Hoare triple {7692#true} havoc ~n~0;~k~0 := 0bv32;~i~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {7978#(bvsgt (bvadd main_~k~0 (_ bv11 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:38,772 INFO L256 TraceCheckUtils]: 3: Hoare triple {7692#true} call #t~ret6 := main(); {7692#true} is VALID [2018-11-14 18:31:38,772 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7692#true} {7692#true} #48#return; {7692#true} is VALID [2018-11-14 18:31:38,772 INFO L273 TraceCheckUtils]: 1: Hoare triple {7692#true} assume true; {7692#true} is VALID [2018-11-14 18:31:38,772 INFO L256 TraceCheckUtils]: 0: Hoare triple {7692#true} call ULTIMATE.init(); {7692#true} is VALID [2018-11-14 18:31:38,774 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 2 proven. 159 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:31:38,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:31:38,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2018-11-14 18:31:38,776 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 46 [2018-11-14 18:31:38,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:31:38,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-14 18:31:38,905 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:31:38,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-14 18:31:38,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-14 18:31:38,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=763, Unknown=0, NotChecked=0, Total=992 [2018-11-14 18:31:38,906 INFO L87 Difference]: Start difference. First operand 199 states and 247 transitions. Second operand 32 states. [2018-11-14 18:31:44,892 WARN L179 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 9 [2018-11-14 18:31:46,927 WARN L179 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 9 [2018-11-14 18:31:48,603 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-11-14 18:31:58,158 WARN L179 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 9