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/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/nested5_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:48:33,483 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:48:33,485 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:48:33,497 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:48:33,498 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:48:33,499 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:48:33,500 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:48:33,502 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:48:33,504 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:48:33,505 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:48:33,506 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:48:33,506 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:48:33,508 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:48:33,510 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:48:33,514 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:48:33,515 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:48:33,517 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:48:33,526 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:48:33,528 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:48:33,532 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:48:33,533 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:48:33,535 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:48:33,537 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:48:33,537 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:48:33,538 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:48:33,539 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:48:33,540 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:48:33,540 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:48:33,541 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:48:33,542 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:48:33,543 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:48:33,543 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:48:33,544 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:48:33,544 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:48:33,545 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:48:33,546 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:48:33,546 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:48:33,561 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:48:33,562 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:48:33,563 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:48:33,563 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:48:33,563 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:48:33,564 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:48:33,564 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:48:33,564 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:48:33,564 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:48:33,564 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:48:33,565 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:48:33,565 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:48:33,565 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:48:33,565 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:48:33,565 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:48:33,566 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:48:33,566 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:48:33,566 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:48:33,566 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:48:33,566 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:48:33,566 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:48:33,567 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:48:33,567 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:48:33,567 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:48:33,567 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:48:33,568 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:48:33,568 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:48:33,568 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:48:33,568 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:48:33,568 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:48:33,568 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:48:33,569 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:48:33,569 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:48:33,629 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:48:33,643 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:48:33,647 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:48:33,649 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:48:33,649 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:48:33,650 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/nested5_true-unreach-call.c [2018-11-23 11:48:33,715 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f971ccf66/a771f7f03ab64bd1b2e43b37693d4f17/FLAG33a9991ad [2018-11-23 11:48:34,224 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:48:34,225 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested5_true-unreach-call.c [2018-11-23 11:48:34,234 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f971ccf66/a771f7f03ab64bd1b2e43b37693d4f17/FLAG33a9991ad [2018-11-23 11:48:34,568 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f971ccf66/a771f7f03ab64bd1b2e43b37693d4f17 [2018-11-23 11:48:34,578 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:48:34,580 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:48:34,581 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:48:34,581 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:48:34,585 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:48:34,587 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:48:34" (1/1) ... [2018-11-23 11:48:34,590 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72cdac6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:34, skipping insertion in model container [2018-11-23 11:48:34,591 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:48:34" (1/1) ... [2018-11-23 11:48:34,602 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:48:34,631 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:48:34,918 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:48:34,924 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:48:34,948 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:48:34,967 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:48:34,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:34 WrapperNode [2018-11-23 11:48:34,968 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:48:34,969 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:48:34,970 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:48:34,970 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:48:34,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:34" (1/1) ... [2018-11-23 11:48:34,990 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:34" (1/1) ... [2018-11-23 11:48:34,998 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:48:34,998 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:48:34,998 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:48:34,999 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:48:35,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:34" (1/1) ... [2018-11-23 11:48:35,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:34" (1/1) ... [2018-11-23 11:48:35,012 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:34" (1/1) ... [2018-11-23 11:48:35,012 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:34" (1/1) ... [2018-11-23 11:48:35,021 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:34" (1/1) ... [2018-11-23 11:48:35,029 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:34" (1/1) ... [2018-11-23 11:48:35,031 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:34" (1/1) ... [2018-11-23 11:48:35,033 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:48:35,033 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:48:35,034 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:48:35,034 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:48:35,035 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:34" (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-23 11:48:35,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:48:35,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:48:35,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:48:35,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:48:35,184 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:48:35,185 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:48:35,185 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:48:35,185 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:48:35,822 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:48:35,823 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 11:48:35,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:48:35 BoogieIcfgContainer [2018-11-23 11:48:35,824 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:48:35,825 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:48:35,825 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:48:35,828 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:48:35,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:48:34" (1/3) ... [2018-11-23 11:48:35,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c7d94f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:48:35, skipping insertion in model container [2018-11-23 11:48:35,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:34" (2/3) ... [2018-11-23 11:48:35,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c7d94f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:48:35, skipping insertion in model container [2018-11-23 11:48:35,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:48:35" (3/3) ... [2018-11-23 11:48:35,833 INFO L112 eAbstractionObserver]: Analyzing ICFG nested5_true-unreach-call.c [2018-11-23 11:48:35,844 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:48:35,853 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:48:35,874 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:48:35,913 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:48:35,914 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:48:35,915 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:48:35,915 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:48:35,915 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:48:35,915 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:48:35,916 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:48:35,916 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:48:35,916 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:48:35,936 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2018-11-23 11:48:35,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:48:35,943 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:48:35,944 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:48:35,947 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:48:35,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:48:35,954 INFO L82 PathProgramCache]: Analyzing trace with hash -84144223, now seen corresponding path program 1 times [2018-11-23 11:48:35,959 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:48:35,960 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-23 11:48:35,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:48:36,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:48:36,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:48:36,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:48:36,241 INFO L256 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {29#true} is VALID [2018-11-23 11:48:36,245 INFO L273 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2018-11-23 11:48:36,245 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #81#return; {29#true} is VALID [2018-11-23 11:48:36,246 INFO L256 TraceCheckUtils]: 3: Hoare triple {29#true} call #t~ret5 := main(); {29#true} is VALID [2018-11-23 11:48:36,246 INFO L273 TraceCheckUtils]: 4: Hoare triple {29#true} ~x~0 := 0bv32;~y~0 := 0bv32;~z~0 := 0bv32;~w~0 := 0bv32;~v~0 := 0bv32;~w~0 := 0bv32; {29#true} is VALID [2018-11-23 11:48:36,247 INFO L273 TraceCheckUtils]: 5: Hoare triple {29#true} assume !!~bvult32(~w~0, 268435455bv32);~x~0 := 0bv32; {29#true} is VALID [2018-11-23 11:48:36,247 INFO L273 TraceCheckUtils]: 6: Hoare triple {29#true} assume !!~bvult32(~x~0, 10bv32);~y~0 := 0bv32; {29#true} is VALID [2018-11-23 11:48:36,247 INFO L273 TraceCheckUtils]: 7: Hoare triple {29#true} assume !!~bvult32(~y~0, 10bv32);~z~0 := 0bv32; {29#true} is VALID [2018-11-23 11:48:36,248 INFO L273 TraceCheckUtils]: 8: Hoare triple {29#true} assume !!~bvult32(~z~0, 10bv32);~v~0 := 0bv32; {29#true} is VALID [2018-11-23 11:48:36,249 INFO L273 TraceCheckUtils]: 9: Hoare triple {29#true} assume !true; {30#false} is VALID [2018-11-23 11:48:36,249 INFO L256 TraceCheckUtils]: 10: Hoare triple {30#false} call __VERIFIER_assert(~bvurem32(~v~0, 4bv32)); {30#false} is VALID [2018-11-23 11:48:36,249 INFO L273 TraceCheckUtils]: 11: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2018-11-23 11:48:36,250 INFO L273 TraceCheckUtils]: 12: Hoare triple {30#false} assume 0bv32 == ~cond; {30#false} is VALID [2018-11-23 11:48:36,250 INFO L273 TraceCheckUtils]: 13: Hoare triple {30#false} assume !false; {30#false} is VALID [2018-11-23 11:48:36,253 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-23 11:48:36,254 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:48:36,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:48:36,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:48:36,266 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 11:48:36,270 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:48:36,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:48:36,421 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-23 11:48:36,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:48:36,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:48:36,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:48:36,435 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2018-11-23 11:48:36,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:48:36,756 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2018-11-23 11:48:36,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:48:36,758 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 11:48:36,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:48:36,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:48:36,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 68 transitions. [2018-11-23 11:48:36,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:48:36,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 68 transitions. [2018-11-23 11:48:36,781 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 68 transitions. [2018-11-23 11:48:37,016 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:48:37,029 INFO L225 Difference]: With dead ends: 47 [2018-11-23 11:48:37,030 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 11:48:37,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 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-23 11:48:37,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 11:48:37,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 11:48:37,142 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:48:37,143 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-23 11:48:37,143 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 11:48:37,144 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 11:48:37,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:48:37,148 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2018-11-23 11:48:37,148 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2018-11-23 11:48:37,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:48:37,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:48:37,149 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 11:48:37,149 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 11:48:37,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:48:37,154 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2018-11-23 11:48:37,154 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2018-11-23 11:48:37,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:48:37,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:48:37,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:48:37,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:48:37,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:48:37,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2018-11-23 11:48:37,160 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 14 [2018-11-23 11:48:37,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:48:37,161 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-11-23 11:48:37,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:48:37,161 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2018-11-23 11:48:37,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:48:37,162 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:48:37,162 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:48:37,163 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:48:37,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:48:37,163 INFO L82 PathProgramCache]: Analyzing trace with hash -89685349, now seen corresponding path program 1 times [2018-11-23 11:48:37,164 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:48:37,164 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-23 11:48:37,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:48:37,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:48:37,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:48:37,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:48:37,306 INFO L256 TraceCheckUtils]: 0: Hoare triple {214#true} call ULTIMATE.init(); {214#true} is VALID [2018-11-23 11:48:37,307 INFO L273 TraceCheckUtils]: 1: Hoare triple {214#true} assume true; {214#true} is VALID [2018-11-23 11:48:37,307 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {214#true} {214#true} #81#return; {214#true} is VALID [2018-11-23 11:48:37,307 INFO L256 TraceCheckUtils]: 3: Hoare triple {214#true} call #t~ret5 := main(); {214#true} is VALID [2018-11-23 11:48:37,308 INFO L273 TraceCheckUtils]: 4: Hoare triple {214#true} ~x~0 := 0bv32;~y~0 := 0bv32;~z~0 := 0bv32;~w~0 := 0bv32;~v~0 := 0bv32;~w~0 := 0bv32; {214#true} is VALID [2018-11-23 11:48:37,308 INFO L273 TraceCheckUtils]: 5: Hoare triple {214#true} assume !!~bvult32(~w~0, 268435455bv32);~x~0 := 0bv32; {214#true} is VALID [2018-11-23 11:48:37,308 INFO L273 TraceCheckUtils]: 6: Hoare triple {214#true} assume !!~bvult32(~x~0, 10bv32);~y~0 := 0bv32; {214#true} is VALID [2018-11-23 11:48:37,309 INFO L273 TraceCheckUtils]: 7: Hoare triple {214#true} assume !!~bvult32(~y~0, 10bv32);~z~0 := 0bv32; {214#true} is VALID [2018-11-23 11:48:37,311 INFO L273 TraceCheckUtils]: 8: Hoare triple {214#true} assume !!~bvult32(~z~0, 10bv32);~v~0 := 0bv32; {243#(= main_~v~0 (_ bv0 32))} is VALID [2018-11-23 11:48:37,312 INFO L273 TraceCheckUtils]: 9: Hoare triple {243#(= main_~v~0 (_ bv0 32))} assume !~bvult32(~v~0, 10bv32); {215#false} is VALID [2018-11-23 11:48:37,312 INFO L256 TraceCheckUtils]: 10: Hoare triple {215#false} call __VERIFIER_assert(~bvurem32(~v~0, 4bv32)); {215#false} is VALID [2018-11-23 11:48:37,313 INFO L273 TraceCheckUtils]: 11: Hoare triple {215#false} ~cond := #in~cond; {215#false} is VALID [2018-11-23 11:48:37,313 INFO L273 TraceCheckUtils]: 12: Hoare triple {215#false} assume 0bv32 == ~cond; {215#false} is VALID [2018-11-23 11:48:37,313 INFO L273 TraceCheckUtils]: 13: Hoare triple {215#false} assume !false; {215#false} is VALID [2018-11-23 11:48:37,315 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-23 11:48:37,315 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:48:37,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:48:37,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:48:37,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 11:48:37,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:48:37,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:48:37,368 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-23 11:48:37,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:48:37,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:48:37,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:48:37,370 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 3 states. [2018-11-23 11:48:37,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:48:37,752 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2018-11-23 11:48:37,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:48:37,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 11:48:37,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:48:37,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:48:37,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2018-11-23 11:48:37,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:48:37,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2018-11-23 11:48:37,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2018-11-23 11:48:37,985 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:48:37,988 INFO L225 Difference]: With dead ends: 48 [2018-11-23 11:48:37,988 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 11:48:37,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:48:37,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 11:48:38,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2018-11-23 11:48:38,005 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:48:38,005 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 23 states. [2018-11-23 11:48:38,005 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 23 states. [2018-11-23 11:48:38,006 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 23 states. [2018-11-23 11:48:38,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:48:38,009 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2018-11-23 11:48:38,009 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2018-11-23 11:48:38,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:48:38,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:48:38,010 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 31 states. [2018-11-23 11:48:38,010 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 31 states. [2018-11-23 11:48:38,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:48:38,014 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2018-11-23 11:48:38,014 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2018-11-23 11:48:38,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:48:38,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:48:38,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:48:38,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:48:38,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:48:38,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-23 11:48:38,018 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 14 [2018-11-23 11:48:38,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:48:38,018 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-23 11:48:38,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:48:38,019 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-11-23 11:48:38,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:48:38,019 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:48:38,020 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:48:38,020 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:48:38,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:48:38,020 INFO L82 PathProgramCache]: Analyzing trace with hash 374245081, now seen corresponding path program 1 times [2018-11-23 11:48:38,021 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:48:38,021 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-23 11:48:38,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:48:38,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:48:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:48:38,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:48:38,169 INFO L256 TraceCheckUtils]: 0: Hoare triple {426#true} call ULTIMATE.init(); {426#true} is VALID [2018-11-23 11:48:38,169 INFO L273 TraceCheckUtils]: 1: Hoare triple {426#true} assume true; {426#true} is VALID [2018-11-23 11:48:38,170 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {426#true} {426#true} #81#return; {426#true} is VALID [2018-11-23 11:48:38,170 INFO L256 TraceCheckUtils]: 3: Hoare triple {426#true} call #t~ret5 := main(); {426#true} is VALID [2018-11-23 11:48:38,170 INFO L273 TraceCheckUtils]: 4: Hoare triple {426#true} ~x~0 := 0bv32;~y~0 := 0bv32;~z~0 := 0bv32;~w~0 := 0bv32;~v~0 := 0bv32;~w~0 := 0bv32; {426#true} is VALID [2018-11-23 11:48:38,171 INFO L273 TraceCheckUtils]: 5: Hoare triple {426#true} assume !!~bvult32(~w~0, 268435455bv32);~x~0 := 0bv32; {426#true} is VALID [2018-11-23 11:48:38,171 INFO L273 TraceCheckUtils]: 6: Hoare triple {426#true} assume !!~bvult32(~x~0, 10bv32);~y~0 := 0bv32; {426#true} is VALID [2018-11-23 11:48:38,171 INFO L273 TraceCheckUtils]: 7: Hoare triple {426#true} assume !!~bvult32(~y~0, 10bv32);~z~0 := 0bv32; {426#true} is VALID [2018-11-23 11:48:38,172 INFO L273 TraceCheckUtils]: 8: Hoare triple {426#true} assume !!~bvult32(~z~0, 10bv32);~v~0 := 0bv32; {455#(= main_~v~0 (_ bv0 32))} is VALID [2018-11-23 11:48:38,175 INFO L273 TraceCheckUtils]: 9: Hoare triple {455#(= main_~v~0 (_ bv0 32))} assume !!~bvult32(~v~0, 10bv32); {455#(= main_~v~0 (_ bv0 32))} is VALID [2018-11-23 11:48:38,176 INFO L273 TraceCheckUtils]: 10: Hoare triple {455#(= main_~v~0 (_ bv0 32))} #t~post4 := ~v~0;~v~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {462#(= (_ bv1 32) main_~v~0)} is VALID [2018-11-23 11:48:38,177 INFO L273 TraceCheckUtils]: 11: Hoare triple {462#(= (_ bv1 32) main_~v~0)} assume !~bvult32(~v~0, 10bv32); {427#false} is VALID [2018-11-23 11:48:38,177 INFO L256 TraceCheckUtils]: 12: Hoare triple {427#false} call __VERIFIER_assert(~bvurem32(~v~0, 4bv32)); {427#false} is VALID [2018-11-23 11:48:38,177 INFO L273 TraceCheckUtils]: 13: Hoare triple {427#false} ~cond := #in~cond; {427#false} is VALID [2018-11-23 11:48:38,178 INFO L273 TraceCheckUtils]: 14: Hoare triple {427#false} assume 0bv32 == ~cond; {427#false} is VALID [2018-11-23 11:48:38,178 INFO L273 TraceCheckUtils]: 15: Hoare triple {427#false} assume !false; {427#false} is VALID [2018-11-23 11:48:38,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:48:38,181 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:48:38,362 INFO L273 TraceCheckUtils]: 15: Hoare triple {427#false} assume !false; {427#false} is VALID [2018-11-23 11:48:38,362 INFO L273 TraceCheckUtils]: 14: Hoare triple {427#false} assume 0bv32 == ~cond; {427#false} is VALID [2018-11-23 11:48:38,363 INFO L273 TraceCheckUtils]: 13: Hoare triple {427#false} ~cond := #in~cond; {427#false} is VALID [2018-11-23 11:48:38,363 INFO L256 TraceCheckUtils]: 12: Hoare triple {427#false} call __VERIFIER_assert(~bvurem32(~v~0, 4bv32)); {427#false} is VALID [2018-11-23 11:48:38,364 INFO L273 TraceCheckUtils]: 11: Hoare triple {490#(bvult main_~v~0 (_ bv10 32))} assume !~bvult32(~v~0, 10bv32); {427#false} is VALID [2018-11-23 11:48:38,365 INFO L273 TraceCheckUtils]: 10: Hoare triple {494#(bvult (bvadd main_~v~0 (_ bv1 32)) (_ bv10 32))} #t~post4 := ~v~0;~v~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {490#(bvult main_~v~0 (_ bv10 32))} is VALID [2018-11-23 11:48:38,367 INFO L273 TraceCheckUtils]: 9: Hoare triple {494#(bvult (bvadd main_~v~0 (_ bv1 32)) (_ bv10 32))} assume !!~bvult32(~v~0, 10bv32); {494#(bvult (bvadd main_~v~0 (_ bv1 32)) (_ bv10 32))} is VALID [2018-11-23 11:48:38,372 INFO L273 TraceCheckUtils]: 8: Hoare triple {426#true} assume !!~bvult32(~z~0, 10bv32);~v~0 := 0bv32; {494#(bvult (bvadd main_~v~0 (_ bv1 32)) (_ bv10 32))} is VALID [2018-11-23 11:48:38,372 INFO L273 TraceCheckUtils]: 7: Hoare triple {426#true} assume !!~bvult32(~y~0, 10bv32);~z~0 := 0bv32; {426#true} is VALID [2018-11-23 11:48:38,373 INFO L273 TraceCheckUtils]: 6: Hoare triple {426#true} assume !!~bvult32(~x~0, 10bv32);~y~0 := 0bv32; {426#true} is VALID [2018-11-23 11:48:38,373 INFO L273 TraceCheckUtils]: 5: Hoare triple {426#true} assume !!~bvult32(~w~0, 268435455bv32);~x~0 := 0bv32; {426#true} is VALID [2018-11-23 11:48:38,373 INFO L273 TraceCheckUtils]: 4: Hoare triple {426#true} ~x~0 := 0bv32;~y~0 := 0bv32;~z~0 := 0bv32;~w~0 := 0bv32;~v~0 := 0bv32;~w~0 := 0bv32; {426#true} is VALID [2018-11-23 11:48:38,373 INFO L256 TraceCheckUtils]: 3: Hoare triple {426#true} call #t~ret5 := main(); {426#true} is VALID [2018-11-23 11:48:38,374 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {426#true} {426#true} #81#return; {426#true} is VALID [2018-11-23 11:48:38,374 INFO L273 TraceCheckUtils]: 1: Hoare triple {426#true} assume true; {426#true} is VALID [2018-11-23 11:48:38,374 INFO L256 TraceCheckUtils]: 0: Hoare triple {426#true} call ULTIMATE.init(); {426#true} is VALID [2018-11-23 11:48:38,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:48:38,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:48:38,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 11:48:38,378 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 11:48:38,379 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:48:38,379 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:48:38,417 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:48:38,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:48:38,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:48:38,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:48:38,418 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2018-11-23 11:48:38,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:48:38,970 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2018-11-23 11:48:38,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:48:38,970 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 11:48:38,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:48:38,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:48:38,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2018-11-23 11:48:38,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:48:38,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2018-11-23 11:48:38,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 67 transitions. [2018-11-23 11:48:39,212 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-23 11:48:39,214 INFO L225 Difference]: With dead ends: 54 [2018-11-23 11:48:39,214 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 11:48:39,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:48:39,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 11:48:39,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2018-11-23 11:48:39,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:48:39,237 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 29 states. [2018-11-23 11:48:39,238 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 29 states. [2018-11-23 11:48:39,238 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 29 states. [2018-11-23 11:48:39,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:48:39,241 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2018-11-23 11:48:39,241 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-23 11:48:39,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:48:39,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:48:39,242 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 36 states. [2018-11-23 11:48:39,243 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 36 states. [2018-11-23 11:48:39,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:48:39,246 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2018-11-23 11:48:39,246 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-23 11:48:39,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:48:39,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:48:39,247 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:48:39,247 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:48:39,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 11:48:39,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-23 11:48:39,249 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 16 [2018-11-23 11:48:39,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:48:39,250 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-23 11:48:39,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:48:39,250 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 11:48:39,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:48:39,251 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:48:39,251 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:48:39,252 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:48:39,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:48:39,252 INFO L82 PathProgramCache]: Analyzing trace with hash -79001965, now seen corresponding path program 2 times [2018-11-23 11:48:39,253 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:48:39,253 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-23 11:48:39,276 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:48:39,306 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:48:39,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:48:39,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:48:39,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:48:39,485 INFO L256 TraceCheckUtils]: 0: Hoare triple {726#true} call ULTIMATE.init(); {726#true} is VALID [2018-11-23 11:48:39,486 INFO L273 TraceCheckUtils]: 1: Hoare triple {726#true} assume true; {726#true} is VALID [2018-11-23 11:48:39,486 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {726#true} {726#true} #81#return; {726#true} is VALID [2018-11-23 11:48:39,487 INFO L256 TraceCheckUtils]: 3: Hoare triple {726#true} call #t~ret5 := main(); {726#true} is VALID [2018-11-23 11:48:39,487 INFO L273 TraceCheckUtils]: 4: Hoare triple {726#true} ~x~0 := 0bv32;~y~0 := 0bv32;~z~0 := 0bv32;~w~0 := 0bv32;~v~0 := 0bv32;~w~0 := 0bv32; {726#true} is VALID [2018-11-23 11:48:39,487 INFO L273 TraceCheckUtils]: 5: Hoare triple {726#true} assume !!~bvult32(~w~0, 268435455bv32);~x~0 := 0bv32; {726#true} is VALID [2018-11-23 11:48:39,488 INFO L273 TraceCheckUtils]: 6: Hoare triple {726#true} assume !!~bvult32(~x~0, 10bv32);~y~0 := 0bv32; {726#true} is VALID [2018-11-23 11:48:39,488 INFO L273 TraceCheckUtils]: 7: Hoare triple {726#true} assume !!~bvult32(~y~0, 10bv32);~z~0 := 0bv32; {726#true} is VALID [2018-11-23 11:48:39,489 INFO L273 TraceCheckUtils]: 8: Hoare triple {726#true} assume !!~bvult32(~z~0, 10bv32);~v~0 := 0bv32; {755#(= main_~v~0 (_ bv0 32))} is VALID [2018-11-23 11:48:39,491 INFO L273 TraceCheckUtils]: 9: Hoare triple {755#(= main_~v~0 (_ bv0 32))} assume !!~bvult32(~v~0, 10bv32); {755#(= main_~v~0 (_ bv0 32))} is VALID [2018-11-23 11:48:39,492 INFO L273 TraceCheckUtils]: 10: Hoare triple {755#(= main_~v~0 (_ bv0 32))} #t~post4 := ~v~0;~v~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {762#(= (_ bv1 32) main_~v~0)} is VALID [2018-11-23 11:48:39,493 INFO L273 TraceCheckUtils]: 11: Hoare triple {762#(= (_ bv1 32) main_~v~0)} assume !!~bvult32(~v~0, 10bv32); {762#(= (_ bv1 32) main_~v~0)} is VALID [2018-11-23 11:48:39,494 INFO L273 TraceCheckUtils]: 12: Hoare triple {762#(= (_ bv1 32) main_~v~0)} #t~post4 := ~v~0;~v~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {769#(= (_ bv2 32) main_~v~0)} is VALID [2018-11-23 11:48:39,494 INFO L273 TraceCheckUtils]: 13: Hoare triple {769#(= (_ bv2 32) main_~v~0)} assume !!~bvult32(~v~0, 10bv32); {769#(= (_ bv2 32) main_~v~0)} is VALID [2018-11-23 11:48:39,495 INFO L273 TraceCheckUtils]: 14: Hoare triple {769#(= (_ bv2 32) main_~v~0)} #t~post4 := ~v~0;~v~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {776#(= (_ bv3 32) main_~v~0)} is VALID [2018-11-23 11:48:39,496 INFO L273 TraceCheckUtils]: 15: Hoare triple {776#(= (_ bv3 32) main_~v~0)} assume !!~bvult32(~v~0, 10bv32); {776#(= (_ bv3 32) main_~v~0)} is VALID [2018-11-23 11:48:39,497 INFO L273 TraceCheckUtils]: 16: Hoare triple {776#(= (_ bv3 32) main_~v~0)} #t~post4 := ~v~0;~v~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {783#(= (_ bv4 32) main_~v~0)} is VALID [2018-11-23 11:48:39,498 INFO L273 TraceCheckUtils]: 17: Hoare triple {783#(= (_ bv4 32) main_~v~0)} assume !~bvult32(~v~0, 10bv32); {727#false} is VALID [2018-11-23 11:48:39,498 INFO L256 TraceCheckUtils]: 18: Hoare triple {727#false} call __VERIFIER_assert(~bvurem32(~v~0, 4bv32)); {727#false} is VALID [2018-11-23 11:48:39,499 INFO L273 TraceCheckUtils]: 19: Hoare triple {727#false} ~cond := #in~cond; {727#false} is VALID [2018-11-23 11:48:39,499 INFO L273 TraceCheckUtils]: 20: Hoare triple {727#false} assume 0bv32 == ~cond; {727#false} is VALID [2018-11-23 11:48:39,500 INFO L273 TraceCheckUtils]: 21: Hoare triple {727#false} assume !false; {727#false} is VALID [2018-11-23 11:48:39,501 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:48:39,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:48:39,841 INFO L273 TraceCheckUtils]: 21: Hoare triple {727#false} assume !false; {727#false} is VALID [2018-11-23 11:48:39,842 INFO L273 TraceCheckUtils]: 20: Hoare triple {802#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {727#false} is VALID [2018-11-23 11:48:39,843 INFO L273 TraceCheckUtils]: 19: Hoare triple {806#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {802#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:48:39,845 INFO L256 TraceCheckUtils]: 18: Hoare triple {810#(not (= (bvurem main_~v~0 (_ bv4 32)) (_ bv0 32)))} call __VERIFIER_assert(~bvurem32(~v~0, 4bv32)); {806#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:48:39,846 INFO L273 TraceCheckUtils]: 17: Hoare triple {814#(or (bvult main_~v~0 (_ bv10 32)) (not (= (bvurem main_~v~0 (_ bv4 32)) (_ bv0 32))))} assume !~bvult32(~v~0, 10bv32); {810#(not (= (bvurem main_~v~0 (_ bv4 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:39,849 INFO L273 TraceCheckUtils]: 16: Hoare triple {818#(or (bvult (bvadd main_~v~0 (_ bv1 32)) (_ bv10 32)) (not (= (bvurem (bvadd main_~v~0 (_ bv1 32)) (_ bv4 32)) (_ bv0 32))))} #t~post4 := ~v~0;~v~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {814#(or (bvult main_~v~0 (_ bv10 32)) (not (= (bvurem main_~v~0 (_ bv4 32)) (_ bv0 32))))} is VALID [2018-11-23 11:48:39,851 INFO L273 TraceCheckUtils]: 15: Hoare triple {818#(or (bvult (bvadd main_~v~0 (_ bv1 32)) (_ bv10 32)) (not (= (bvurem (bvadd main_~v~0 (_ bv1 32)) (_ bv4 32)) (_ bv0 32))))} assume !!~bvult32(~v~0, 10bv32); {818#(or (bvult (bvadd main_~v~0 (_ bv1 32)) (_ bv10 32)) (not (= (bvurem (bvadd main_~v~0 (_ bv1 32)) (_ bv4 32)) (_ bv0 32))))} is VALID [2018-11-23 11:48:39,856 INFO L273 TraceCheckUtils]: 14: Hoare triple {825#(or (not (= (_ bv0 32) (bvurem (bvadd main_~v~0 (_ bv2 32)) (_ bv4 32)))) (bvult (bvadd main_~v~0 (_ bv2 32)) (_ bv10 32)))} #t~post4 := ~v~0;~v~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {818#(or (bvult (bvadd main_~v~0 (_ bv1 32)) (_ bv10 32)) (not (= (bvurem (bvadd main_~v~0 (_ bv1 32)) (_ bv4 32)) (_ bv0 32))))} is VALID [2018-11-23 11:48:39,857 INFO L273 TraceCheckUtils]: 13: Hoare triple {825#(or (not (= (_ bv0 32) (bvurem (bvadd main_~v~0 (_ bv2 32)) (_ bv4 32)))) (bvult (bvadd main_~v~0 (_ bv2 32)) (_ bv10 32)))} assume !!~bvult32(~v~0, 10bv32); {825#(or (not (= (_ bv0 32) (bvurem (bvadd main_~v~0 (_ bv2 32)) (_ bv4 32)))) (bvult (bvadd main_~v~0 (_ bv2 32)) (_ bv10 32)))} is VALID [2018-11-23 11:48:39,860 INFO L273 TraceCheckUtils]: 12: Hoare triple {832#(or (bvult (bvadd main_~v~0 (_ bv3 32)) (_ bv10 32)) (not (= (bvurem (bvadd main_~v~0 (_ bv3 32)) (_ bv4 32)) (_ bv0 32))))} #t~post4 := ~v~0;~v~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {825#(or (not (= (_ bv0 32) (bvurem (bvadd main_~v~0 (_ bv2 32)) (_ bv4 32)))) (bvult (bvadd main_~v~0 (_ bv2 32)) (_ bv10 32)))} is VALID [2018-11-23 11:48:39,861 INFO L273 TraceCheckUtils]: 11: Hoare triple {832#(or (bvult (bvadd main_~v~0 (_ bv3 32)) (_ bv10 32)) (not (= (bvurem (bvadd main_~v~0 (_ bv3 32)) (_ bv4 32)) (_ bv0 32))))} assume !!~bvult32(~v~0, 10bv32); {832#(or (bvult (bvadd main_~v~0 (_ bv3 32)) (_ bv10 32)) (not (= (bvurem (bvadd main_~v~0 (_ bv3 32)) (_ bv4 32)) (_ bv0 32))))} is VALID [2018-11-23 11:48:39,864 INFO L273 TraceCheckUtils]: 10: Hoare triple {839#(or (not (= (bvurem (bvadd main_~v~0 (_ bv4 32)) (_ bv4 32)) (_ bv0 32))) (bvult (bvadd main_~v~0 (_ bv4 32)) (_ bv10 32)))} #t~post4 := ~v~0;~v~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {832#(or (bvult (bvadd main_~v~0 (_ bv3 32)) (_ bv10 32)) (not (= (bvurem (bvadd main_~v~0 (_ bv3 32)) (_ bv4 32)) (_ bv0 32))))} is VALID [2018-11-23 11:48:39,865 INFO L273 TraceCheckUtils]: 9: Hoare triple {839#(or (not (= (bvurem (bvadd main_~v~0 (_ bv4 32)) (_ bv4 32)) (_ bv0 32))) (bvult (bvadd main_~v~0 (_ bv4 32)) (_ bv10 32)))} assume !!~bvult32(~v~0, 10bv32); {839#(or (not (= (bvurem (bvadd main_~v~0 (_ bv4 32)) (_ bv4 32)) (_ bv0 32))) (bvult (bvadd main_~v~0 (_ bv4 32)) (_ bv10 32)))} is VALID [2018-11-23 11:48:39,867 INFO L273 TraceCheckUtils]: 8: Hoare triple {726#true} assume !!~bvult32(~z~0, 10bv32);~v~0 := 0bv32; {839#(or (not (= (bvurem (bvadd main_~v~0 (_ bv4 32)) (_ bv4 32)) (_ bv0 32))) (bvult (bvadd main_~v~0 (_ bv4 32)) (_ bv10 32)))} is VALID [2018-11-23 11:48:39,867 INFO L273 TraceCheckUtils]: 7: Hoare triple {726#true} assume !!~bvult32(~y~0, 10bv32);~z~0 := 0bv32; {726#true} is VALID [2018-11-23 11:48:39,868 INFO L273 TraceCheckUtils]: 6: Hoare triple {726#true} assume !!~bvult32(~x~0, 10bv32);~y~0 := 0bv32; {726#true} is VALID [2018-11-23 11:48:39,868 INFO L273 TraceCheckUtils]: 5: Hoare triple {726#true} assume !!~bvult32(~w~0, 268435455bv32);~x~0 := 0bv32; {726#true} is VALID [2018-11-23 11:48:39,869 INFO L273 TraceCheckUtils]: 4: Hoare triple {726#true} ~x~0 := 0bv32;~y~0 := 0bv32;~z~0 := 0bv32;~w~0 := 0bv32;~v~0 := 0bv32;~w~0 := 0bv32; {726#true} is VALID [2018-11-23 11:48:39,869 INFO L256 TraceCheckUtils]: 3: Hoare triple {726#true} call #t~ret5 := main(); {726#true} is VALID [2018-11-23 11:48:39,869 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {726#true} {726#true} #81#return; {726#true} is VALID [2018-11-23 11:48:39,870 INFO L273 TraceCheckUtils]: 1: Hoare triple {726#true} assume true; {726#true} is VALID [2018-11-23 11:48:39,870 INFO L256 TraceCheckUtils]: 0: Hoare triple {726#true} call ULTIMATE.init(); {726#true} is VALID [2018-11-23 11:48:39,872 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:48:39,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:48:39,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 15 [2018-11-23 11:48:39,875 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-11-23 11:48:39,875 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:48:39,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 11:48:39,947 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-23 11:48:39,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 11:48:39,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 11:48:39,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:48:39,949 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 15 states. [2018-11-23 11:48:42,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:48:42,264 INFO L93 Difference]: Finished difference Result 84 states and 108 transitions. [2018-11-23 11:48:42,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 11:48:42,264 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-11-23 11:48:42,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:48:42,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:48:42,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 101 transitions. [2018-11-23 11:48:42,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:48:42,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 101 transitions. [2018-11-23 11:48:42,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 101 transitions. [2018-11-23 11:48:42,671 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:48:42,671 INFO L225 Difference]: With dead ends: 84 [2018-11-23 11:48:42,671 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 11:48:42,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:48:42,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 11:48:42,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 11:48:42,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:48:42,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 11:48:42,674 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:48:42,674 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:48:42,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:48:42,675 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:48:42,675 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:48:42,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:48:42,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:48:42,675 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:48:42,676 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:48:42,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:48:42,676 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:48:42,676 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:48:42,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:48:42,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:48:42,677 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:48:42,677 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:48:42,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 11:48:42,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 11:48:42,678 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2018-11-23 11:48:42,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:48:42,678 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:48:42,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 11:48:42,678 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:48:42,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:48:42,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 11:48:43,134 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-23 11:48:43,294 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 17 [2018-11-23 11:48:43,492 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 11:48:43,492 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:48:43,492 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:48:43,492 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 11:48:43,492 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:48:43,492 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:48:43,493 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 23) no Hoare annotation was computed. [2018-11-23 11:48:43,493 INFO L444 ceAbstractionStarter]: At program point L19-2(lines 19 22) the Hoare annotation is: (or (= main_~v~0 (_ bv0 32)) (and (not (= (bvurem main_~v~0 (_ bv4 32)) (_ bv0 32))) (let ((.cse0 (bvadd main_~v~0 (_ bv1 32)))) (or (bvult .cse0 (_ bv10 32)) (not (= (bvurem .cse0 (_ bv4 32)) (_ bv0 32))))))) [2018-11-23 11:48:43,493 INFO L448 ceAbstractionStarter]: For program point L20-2(line 20) no Hoare annotation was computed. [2018-11-23 11:48:43,493 INFO L444 ceAbstractionStarter]: At program point L20-3(line 20) the Hoare annotation is: (and (or (bvult main_~v~0 (_ bv10 32)) (not (= (bvurem main_~v~0 (_ bv4 32)) (_ bv0 32)))) (let ((.cse0 (bvadd main_~v~0 (_ bv1 32)))) (or (bvult .cse0 (_ bv10 32)) (not (= (bvurem .cse0 (_ bv4 32)) (_ bv0 32)))))) [2018-11-23 11:48:43,493 INFO L444 ceAbstractionStarter]: At program point L20-4(line 20) the Hoare annotation is: (and (not (= (bvurem main_~v~0 (_ bv4 32)) (_ bv0 32))) (let ((.cse0 (bvadd main_~v~0 (_ bv1 32)))) (or (bvult .cse0 (_ bv10 32)) (not (= (bvurem .cse0 (_ bv4 32)) (_ bv0 32)))))) [2018-11-23 11:48:43,493 INFO L448 ceAbstractionStarter]: For program point L16-2(lines 16 22) no Hoare annotation was computed. [2018-11-23 11:48:43,494 INFO L444 ceAbstractionStarter]: At program point L16-3(lines 16 22) the Hoare annotation is: (or (= main_~v~0 (_ bv0 32)) (and (not (= (bvurem main_~v~0 (_ bv4 32)) (_ bv0 32))) (let ((.cse0 (bvadd main_~v~0 (_ bv1 32)))) (or (bvult .cse0 (_ bv10 32)) (not (= (bvurem .cse0 (_ bv4 32)) (_ bv0 32))))))) [2018-11-23 11:48:43,494 INFO L448 ceAbstractionStarter]: For program point L16-4(lines 10 23) no Hoare annotation was computed. [2018-11-23 11:48:43,494 INFO L448 ceAbstractionStarter]: For program point L21(lines 19 22) no Hoare annotation was computed. [2018-11-23 11:48:43,494 INFO L448 ceAbstractionStarter]: For program point L17-2(lines 17 22) no Hoare annotation was computed. [2018-11-23 11:48:43,494 INFO L444 ceAbstractionStarter]: At program point L17-3(lines 17 22) the Hoare annotation is: (or (= main_~v~0 (_ bv0 32)) (and (not (= (bvurem main_~v~0 (_ bv4 32)) (_ bv0 32))) (let ((.cse0 (bvadd main_~v~0 (_ bv1 32)))) (or (bvult .cse0 (_ bv10 32)) (not (= (bvurem .cse0 (_ bv4 32)) (_ bv0 32))))))) [2018-11-23 11:48:43,495 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 10 23) the Hoare annotation is: true [2018-11-23 11:48:43,495 INFO L448 ceAbstractionStarter]: For program point L18-2(lines 18 22) no Hoare annotation was computed. [2018-11-23 11:48:43,495 INFO L444 ceAbstractionStarter]: At program point L18-3(lines 18 22) the Hoare annotation is: (or (= main_~v~0 (_ bv0 32)) (and (not (= (bvurem main_~v~0 (_ bv4 32)) (_ bv0 32))) (let ((.cse0 (bvadd main_~v~0 (_ bv1 32)))) (or (bvult .cse0 (_ bv10 32)) (not (= (bvurem .cse0 (_ bv4 32)) (_ bv0 32))))))) [2018-11-23 11:48:43,495 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-23 11:48:43,495 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-23 11:48:43,496 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-23 11:48:43,496 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-23 11:48:43,496 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-23 11:48:43,496 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-23 11:48:43,498 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:48:43,499 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:48:43,499 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:48:43,499 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:48:43,499 WARN L170 areAnnotationChecker]: L16-4 has no Hoare annotation [2018-11-23 11:48:43,499 WARN L170 areAnnotationChecker]: L16-4 has no Hoare annotation [2018-11-23 11:48:43,501 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:48:43,501 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:48:43,502 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:48:43,502 WARN L170 areAnnotationChecker]: L16-4 has no Hoare annotation [2018-11-23 11:48:43,502 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2018-11-23 11:48:43,502 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2018-11-23 11:48:43,503 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 11:48:43,503 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 11:48:43,503 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 11:48:43,503 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:48:43,503 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2018-11-23 11:48:43,503 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2018-11-23 11:48:43,503 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2018-11-23 11:48:43,504 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:48:43,504 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2018-11-23 11:48:43,504 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2018-11-23 11:48:43,504 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2018-11-23 11:48:43,506 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 11:48:43,506 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2018-11-23 11:48:43,508 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2018-11-23 11:48:43,508 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 11:48:43,508 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2018-11-23 11:48:43,508 INFO L163 areAnnotationChecker]: CFG has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 11:48:43,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:48:43 BoogieIcfgContainer [2018-11-23 11:48:43,523 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:48:43,523 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:48:43,524 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:48:43,524 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:48:43,525 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:48:35" (3/4) ... [2018-11-23 11:48:43,529 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 11:48:43,536 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 11:48:43,537 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 11:48:43,537 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 11:48:43,542 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2018-11-23 11:48:43,542 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-23 11:48:43,542 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 11:48:43,597 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loops-crafted-1/nested5_true-unreach-call.c-witness.graphml [2018-11-23 11:48:43,598 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:48:43,599 INFO L168 Benchmark]: Toolchain (without parser) took 9020.81 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 713.6 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -291.4 MB). Peak memory consumption was 422.1 MB. Max. memory is 7.1 GB. [2018-11-23 11:48:43,601 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:48:43,601 INFO L168 Benchmark]: CACSL2BoogieTranslator took 387.86 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:48:43,602 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.66 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:48:43,602 INFO L168 Benchmark]: Boogie Preprocessor took 34.82 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:48:43,603 INFO L168 Benchmark]: RCFGBuilder took 790.27 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 713.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -739.8 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-23 11:48:43,604 INFO L168 Benchmark]: TraceAbstraction took 7698.42 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 424.4 MB). Peak memory consumption was 424.4 MB. Max. memory is 7.1 GB. [2018-11-23 11:48:43,607 INFO L168 Benchmark]: Witness Printer took 74.44 ms. Allocated memory is still 2.2 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2018-11-23 11:48:43,614 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 387.86 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 28.66 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.82 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 790.27 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 713.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -739.8 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7698.42 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 424.4 MB). Peak memory consumption was 424.4 MB. Max. memory is 7.1 GB. * Witness Printer took 74.44 ms. Allocated memory is still 2.2 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (~bvult32(v, 10bv32) || !(~bvurem32(v, 4bv32) == 0bv32)) && (~bvult32(~bvadd64(v, 1bv32), 10bv32) || !(~bvurem32(~bvadd64(v, 1bv32), 4bv32) == 0bv32)) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: v == 0bv32 || (!(~bvurem32(v, 4bv32) == 0bv32) && (~bvult32(~bvadd64(v, 1bv32), 10bv32) || !(~bvurem32(~bvadd64(v, 1bv32), 4bv32) == 0bv32))) - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: v == 0bv32 || (!(~bvurem32(v, 4bv32) == 0bv32) && (~bvult32(~bvadd64(v, 1bv32), 10bv32) || !(~bvurem32(~bvadd64(v, 1bv32), 4bv32) == 0bv32))) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: v == 0bv32 || (!(~bvurem32(v, 4bv32) == 0bv32) && (~bvult32(~bvadd64(v, 1bv32), 10bv32) || !(~bvurem32(~bvadd64(v, 1bv32), 4bv32) == 0bv32))) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: v == 0bv32 || (!(~bvurem32(v, 4bv32) == 0bv32) && (~bvult32(~bvadd64(v, 1bv32), 10bv32) || !(~bvurem32(~bvadd64(v, 1bv32), 4bv32) == 0bv32))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 26 locations, 1 error locations. SAFE Result, 7.5s OverallTime, 4 OverallIterations, 4 TraceHistogramMax, 4.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 106 SDtfs, 188 SDslu, 292 SDs, 0 SdLazy, 149 SolverSat, 49 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 15 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 17 PreInvPairs, 45 NumberOfFragments, 151 HoareAnnotationTreeSize, 17 FomulaSimplifications, 482 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 11 FomulaSimplificationsInter, 109 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 66 NumberOfCodeBlocks, 66 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 4918 SizeOfPredicates, 2 NumberOfNonLiveVariables, 130 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 0/34 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...