java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loop-invariants/mod4_true-unreach-call_true-valid-memsafety_true-no-overflow_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:49:07,688 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:49:07,691 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:49:07,707 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:49:07,708 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:49:07,709 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:49:07,710 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:49:07,712 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:49:07,714 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:49:07,715 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:49:07,716 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:49:07,716 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:49:07,717 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:49:07,718 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:49:07,719 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:49:07,720 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:49:07,721 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:49:07,723 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:49:07,725 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:49:07,726 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:49:07,727 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:49:07,728 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:49:07,731 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:49:07,731 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:49:07,731 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:49:07,732 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:49:07,733 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:49:07,734 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:49:07,734 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:49:07,736 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:49:07,736 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:49:07,737 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:49:07,737 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:49:07,737 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:49:07,738 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:49:07,738 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:49:07,739 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-14 16:49:07,754 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:49:07,754 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:49:07,755 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:49:07,755 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:49:07,756 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:49:07,756 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:49:07,756 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:49:07,756 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:49:07,757 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:49:07,757 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:49:07,757 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:49:07,757 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:49:07,757 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:49:07,758 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:49:07,758 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 16:49:07,758 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 16:49:07,758 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:49:07,758 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:49:07,759 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:49:07,759 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:49:07,759 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:49:07,759 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:49:07,759 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:49:07,760 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:49:07,760 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:49:07,760 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:49:07,760 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:49:07,760 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 16:49:07,761 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:49:07,761 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 16:49:07,761 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 16:49:07,761 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:49:07,807 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:49:07,822 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:49:07,826 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:49:07,827 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:49:07,828 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:49:07,828 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invariants/mod4_true-unreach-call_true-valid-memsafety_true-no-overflow_false-termination.c [2018-11-14 16:49:07,890 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/979c4a9da/f98c15ecbedb4dcf8be10bc83e49a332/FLAG9e4a645ec [2018-11-14 16:49:08,336 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:49:08,337 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/mod4_true-unreach-call_true-valid-memsafety_true-no-overflow_false-termination.c [2018-11-14 16:49:08,344 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/979c4a9da/f98c15ecbedb4dcf8be10bc83e49a332/FLAG9e4a645ec [2018-11-14 16:49:08,358 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/979c4a9da/f98c15ecbedb4dcf8be10bc83e49a332 [2018-11-14 16:49:08,368 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:49:08,370 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:49:08,371 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:49:08,371 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:49:08,375 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:49:08,376 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:49:08" (1/1) ... [2018-11-14 16:49:08,379 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36e930ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:49:08, skipping insertion in model container [2018-11-14 16:49:08,380 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:49:08" (1/1) ... [2018-11-14 16:49:08,390 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:49:08,411 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:49:08,611 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:49:08,617 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:49:08,635 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:49:08,652 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:49:08,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:49:08 WrapperNode [2018-11-14 16:49:08,652 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:49:08,653 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:49:08,653 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:49:08,654 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:49:08,669 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:49:08" (1/1) ... [2018-11-14 16:49:08,669 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:49:08" (1/1) ... [2018-11-14 16:49:08,676 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:49:08" (1/1) ... [2018-11-14 16:49:08,677 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:49:08" (1/1) ... [2018-11-14 16:49:08,683 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:49:08" (1/1) ... [2018-11-14 16:49:08,689 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:49:08" (1/1) ... [2018-11-14 16:49:08,690 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:49:08" (1/1) ... [2018-11-14 16:49:08,692 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:49:08,692 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:49:08,693 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:49:08,693 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:49:08,694 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:49:08" (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 16:49:08,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:49:08,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:49:08,837 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 16:49:08,838 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:49:08,838 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:49:08,838 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 16:49:08,838 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 16:49:08,838 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:49:08,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:49:08,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:49:09,251 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:49:09,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:49:09 BoogieIcfgContainer [2018-11-14 16:49:09,252 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:49:09,253 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:49:09,253 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:49:09,256 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:49:09,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:49:08" (1/3) ... [2018-11-14 16:49:09,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@330d69e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:49:09, skipping insertion in model container [2018-11-14 16:49:09,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:49:08" (2/3) ... [2018-11-14 16:49:09,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@330d69e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:49:09, skipping insertion in model container [2018-11-14 16:49:09,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:49:09" (3/3) ... [2018-11-14 16:49:09,260 INFO L112 eAbstractionObserver]: Analyzing ICFG mod4_true-unreach-call_true-valid-memsafety_true-no-overflow_false-termination.c [2018-11-14 16:49:09,270 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:49:09,277 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:49:09,292 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:49:09,325 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:49:09,326 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:49:09,326 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:49:09,326 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:49:09,326 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:49:09,326 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:49:09,327 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:49:09,327 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:49:09,327 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:49:09,347 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-14 16:49:09,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-14 16:49:09,353 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:49:09,354 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:49:09,357 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:49:09,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:49:09,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1871509567, now seen corresponding path program 1 times [2018-11-14 16:49:09,369 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:49:09,370 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 16:49:09,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:49:09,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:49:09,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:49:09,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:49:09,497 INFO L256 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2018-11-14 16:49:09,502 INFO L273 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2018-11-14 16:49:09,503 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #33#return; {22#true} is VALID [2018-11-14 16:49:09,503 INFO L256 TraceCheckUtils]: 3: Hoare triple {22#true} call #t~ret1 := main(); {22#true} is VALID [2018-11-14 16:49:09,503 INFO L273 TraceCheckUtils]: 4: Hoare triple {22#true} ~x~0 := 0bv32; {22#true} is VALID [2018-11-14 16:49:09,518 INFO L273 TraceCheckUtils]: 5: Hoare triple {22#true} assume !true; {23#false} is VALID [2018-11-14 16:49:09,519 INFO L256 TraceCheckUtils]: 6: Hoare triple {23#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 4bv32) == 0bv32 then 1bv32 else 0bv32)); {23#false} is VALID [2018-11-14 16:49:09,519 INFO L273 TraceCheckUtils]: 7: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2018-11-14 16:49:09,519 INFO L273 TraceCheckUtils]: 8: Hoare triple {23#false} assume ~cond == 0bv32; {23#false} is VALID [2018-11-14 16:49:09,520 INFO L273 TraceCheckUtils]: 9: Hoare triple {23#false} assume !false; {23#false} is VALID [2018-11-14 16:49:09,523 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 16:49:09,523 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:49:09,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:49:09,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 16:49:09,534 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 16:49:09,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:49:09,541 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 16:49:09,617 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:49:09,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 16:49:09,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 16:49:09,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:49:09,629 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-14 16:49:09,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:49:09,711 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-14 16:49:09,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 16:49:09,712 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 16:49:09,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:49:09,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:49:09,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2018-11-14 16:49:09,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:49:09,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2018-11-14 16:49:09,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 34 transitions. [2018-11-14 16:49:10,003 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:49:10,015 INFO L225 Difference]: With dead ends: 31 [2018-11-14 16:49:10,015 INFO L226 Difference]: Without dead ends: 12 [2018-11-14 16:49:10,019 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 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 16:49:10,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-14 16:49:10,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-14 16:49:10,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:49:10,118 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-14 16:49:10,118 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-14 16:49:10,118 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-14 16:49:10,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:49:10,122 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-14 16:49:10,122 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-14 16:49:10,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:49:10,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:49:10,124 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-14 16:49:10,124 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-14 16:49:10,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:49:10,127 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-14 16:49:10,128 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-14 16:49:10,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:49:10,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:49:10,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:49:10,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:49:10,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:49:10,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-14 16:49:10,134 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-14 16:49:10,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:49:10,134 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-14 16:49:10,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 16:49:10,135 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-14 16:49:10,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 16:49:10,138 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:49:10,138 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:49:10,141 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:49:10,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:49:10,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1861991801, now seen corresponding path program 1 times [2018-11-14 16:49:10,142 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:49:10,142 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 16:49:10,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:49:10,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:49:10,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:49:10,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:49:10,369 INFO L256 TraceCheckUtils]: 0: Hoare triple {136#true} call ULTIMATE.init(); {136#true} is VALID [2018-11-14 16:49:10,370 INFO L273 TraceCheckUtils]: 1: Hoare triple {136#true} assume true; {136#true} is VALID [2018-11-14 16:49:10,370 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {136#true} {136#true} #33#return; {136#true} is VALID [2018-11-14 16:49:10,371 INFO L256 TraceCheckUtils]: 3: Hoare triple {136#true} call #t~ret1 := main(); {136#true} is VALID [2018-11-14 16:49:10,374 INFO L273 TraceCheckUtils]: 4: Hoare triple {136#true} ~x~0 := 0bv32; {153#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 16:49:10,391 INFO L273 TraceCheckUtils]: 5: Hoare triple {153#(= main_~x~0 (_ bv0 32))} assume true; {153#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 16:49:10,400 INFO L273 TraceCheckUtils]: 6: Hoare triple {153#(= main_~x~0 (_ bv0 32))} assume !(#t~nondet0 != 0bv32);havoc #t~nondet0; {153#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 16:49:10,402 INFO L256 TraceCheckUtils]: 7: Hoare triple {153#(= main_~x~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvurem32(~x~0, 4bv32) == 0bv32 then 1bv32 else 0bv32)); {163#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:49:10,404 INFO L273 TraceCheckUtils]: 8: Hoare triple {163#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {167#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:49:10,404 INFO L273 TraceCheckUtils]: 9: Hoare triple {167#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {137#false} is VALID [2018-11-14 16:49:10,405 INFO L273 TraceCheckUtils]: 10: Hoare triple {137#false} assume !false; {137#false} is VALID [2018-11-14 16:49:10,406 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 16:49:10,407 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:49:10,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:49:10,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 16:49:10,413 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-14 16:49:10,413 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:49:10,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:49:10,438 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:49:10,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:49:10,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:49:10,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:49:10,439 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 5 states. [2018-11-14 16:49:10,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:49:10,672 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-14 16:49:10,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:49:10,672 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-14 16:49:10,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:49:10,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:49:10,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-14 16:49:10,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:49:10,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-14 16:49:10,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2018-11-14 16:49:10,730 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:49:10,731 INFO L225 Difference]: With dead ends: 19 [2018-11-14 16:49:10,731 INFO L226 Difference]: Without dead ends: 14 [2018-11-14 16:49:10,732 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:49:10,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-14 16:49:10,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-14 16:49:10,744 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:49:10,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-14 16:49:10,745 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-14 16:49:10,745 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-14 16:49:10,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:49:10,748 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-14 16:49:10,748 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-14 16:49:10,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:49:10,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:49:10,748 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-14 16:49:10,749 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-14 16:49:10,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:49:10,751 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-14 16:49:10,751 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-14 16:49:10,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:49:10,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:49:10,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:49:10,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:49:10,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 16:49:10,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-14 16:49:10,754 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-11-14 16:49:10,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:49:10,754 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-14 16:49:10,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:49:10,754 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-14 16:49:10,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-14 16:49:10,755 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:49:10,755 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:49:10,756 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:49:10,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:49:10,756 INFO L82 PathProgramCache]: Analyzing trace with hash -661808769, now seen corresponding path program 1 times [2018-11-14 16:49:10,757 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:49:10,757 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 16:49:10,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:49:10,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:49:10,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:49:10,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:49:11,220 INFO L256 TraceCheckUtils]: 0: Hoare triple {254#true} call ULTIMATE.init(); {254#true} is VALID [2018-11-14 16:49:11,221 INFO L273 TraceCheckUtils]: 1: Hoare triple {254#true} assume true; {254#true} is VALID [2018-11-14 16:49:11,221 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {254#true} {254#true} #33#return; {254#true} is VALID [2018-11-14 16:49:11,222 INFO L256 TraceCheckUtils]: 3: Hoare triple {254#true} call #t~ret1 := main(); {254#true} is VALID [2018-11-14 16:49:11,231 INFO L273 TraceCheckUtils]: 4: Hoare triple {254#true} ~x~0 := 0bv32; {271#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 16:49:11,244 INFO L273 TraceCheckUtils]: 5: Hoare triple {271#(= main_~x~0 (_ bv0 32))} assume true; {271#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 16:49:11,257 INFO L273 TraceCheckUtils]: 6: Hoare triple {271#(= main_~x~0 (_ bv0 32))} assume !!(#t~nondet0 != 0bv32);havoc #t~nondet0;~x~0 := ~bvadd32(4bv32, ~x~0); {278#(= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 16:49:11,270 INFO L273 TraceCheckUtils]: 7: Hoare triple {278#(= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} assume true; {278#(= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 16:49:11,284 INFO L273 TraceCheckUtils]: 8: Hoare triple {278#(= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} assume !(#t~nondet0 != 0bv32);havoc #t~nondet0; {278#(= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 16:49:11,294 INFO L256 TraceCheckUtils]: 9: Hoare triple {278#(= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvurem32(~x~0, 4bv32) == 0bv32 then 1bv32 else 0bv32)); {288#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:49:11,306 INFO L273 TraceCheckUtils]: 10: Hoare triple {288#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {292#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:49:11,307 INFO L273 TraceCheckUtils]: 11: Hoare triple {292#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {255#false} is VALID [2018-11-14 16:49:11,307 INFO L273 TraceCheckUtils]: 12: Hoare triple {255#false} assume !false; {255#false} is VALID [2018-11-14 16:49:11,309 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 16:49:11,309 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:49:11,472 INFO L273 TraceCheckUtils]: 12: Hoare triple {255#false} assume !false; {255#false} is VALID [2018-11-14 16:49:11,473 INFO L273 TraceCheckUtils]: 11: Hoare triple {302#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume ~cond == 0bv32; {255#false} is VALID [2018-11-14 16:49:11,474 INFO L273 TraceCheckUtils]: 10: Hoare triple {306#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {302#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-14 16:49:11,485 INFO L256 TraceCheckUtils]: 9: Hoare triple {310#(= (_ bv0 32) (bvurem main_~x~0 (_ bv4 32)))} call __VERIFIER_assert((if ~bvurem32(~x~0, 4bv32) == 0bv32 then 1bv32 else 0bv32)); {306#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-14 16:49:11,486 INFO L273 TraceCheckUtils]: 8: Hoare triple {310#(= (_ bv0 32) (bvurem main_~x~0 (_ bv4 32)))} assume !(#t~nondet0 != 0bv32);havoc #t~nondet0; {310#(= (_ bv0 32) (bvurem main_~x~0 (_ bv4 32)))} is VALID [2018-11-14 16:49:11,487 INFO L273 TraceCheckUtils]: 7: Hoare triple {310#(= (_ bv0 32) (bvurem main_~x~0 (_ bv4 32)))} assume true; {310#(= (_ bv0 32) (bvurem main_~x~0 (_ bv4 32)))} is VALID [2018-11-14 16:49:11,497 INFO L273 TraceCheckUtils]: 6: Hoare triple {310#(= (_ bv0 32) (bvurem main_~x~0 (_ bv4 32)))} assume !!(#t~nondet0 != 0bv32);havoc #t~nondet0;~x~0 := ~bvadd32(4bv32, ~x~0); {310#(= (_ bv0 32) (bvurem main_~x~0 (_ bv4 32)))} is VALID [2018-11-14 16:49:11,498 INFO L273 TraceCheckUtils]: 5: Hoare triple {310#(= (_ bv0 32) (bvurem main_~x~0 (_ bv4 32)))} assume true; {310#(= (_ bv0 32) (bvurem main_~x~0 (_ bv4 32)))} is VALID [2018-11-14 16:49:11,500 INFO L273 TraceCheckUtils]: 4: Hoare triple {254#true} ~x~0 := 0bv32; {310#(= (_ bv0 32) (bvurem main_~x~0 (_ bv4 32)))} is VALID [2018-11-14 16:49:11,500 INFO L256 TraceCheckUtils]: 3: Hoare triple {254#true} call #t~ret1 := main(); {254#true} is VALID [2018-11-14 16:49:11,500 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {254#true} {254#true} #33#return; {254#true} is VALID [2018-11-14 16:49:11,500 INFO L273 TraceCheckUtils]: 1: Hoare triple {254#true} assume true; {254#true} is VALID [2018-11-14 16:49:11,501 INFO L256 TraceCheckUtils]: 0: Hoare triple {254#true} call ULTIMATE.init(); {254#true} is VALID [2018-11-14 16:49:11,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 16:49:11,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 16:49:11,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2018-11-14 16:49:11,507 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-11-14 16:49:11,508 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:49:11,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 16:49:11,541 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:49:11,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 16:49:11,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 16:49:11,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:49:11,543 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 9 states. [2018-11-14 16:49:11,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:49:11,960 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-11-14 16:49:11,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 16:49:11,961 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-11-14 16:49:11,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:49:11,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:49:11,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 18 transitions. [2018-11-14 16:49:11,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:49:11,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 18 transitions. [2018-11-14 16:49:11,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 18 transitions. [2018-11-14 16:49:12,015 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:49:12,015 INFO L225 Difference]: With dead ends: 17 [2018-11-14 16:49:12,016 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 16:49:12,017 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-14 16:49:12,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 16:49:12,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 16:49:12,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:49:12,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 16:49:12,018 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 16:49:12,019 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 16:49:12,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:49:12,019 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 16:49:12,019 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 16:49:12,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:49:12,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:49:12,020 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 16:49:12,020 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 16:49:12,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:49:12,021 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 16:49:12,021 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 16:49:12,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:49:12,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:49:12,022 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:49:12,022 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:49:12,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 16:49:12,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 16:49:12,022 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2018-11-14 16:49:12,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:49:12,023 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 16:49:12,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 16:49:12,023 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 16:49:12,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:49:12,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 16:49:12,356 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 5 [2018-11-14 16:49:12,452 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-14 16:49:12,452 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 16:49:12,452 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 16:49:12,453 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 16:49:12,453 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 16:49:12,453 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 16:49:12,453 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 9 16) the Hoare annotation is: true [2018-11-14 16:49:12,453 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 9 16) no Hoare annotation was computed. [2018-11-14 16:49:12,453 INFO L425 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-11-14 16:49:12,454 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 9 16) no Hoare annotation was computed. [2018-11-14 16:49:12,454 INFO L425 ceAbstractionStarter]: For program point L11-1(lines 11 13) no Hoare annotation was computed. [2018-11-14 16:49:12,454 INFO L421 ceAbstractionStarter]: At program point L11-3(lines 11 13) the Hoare annotation is: (= (_ bv0 32) (bvurem main_~x~0 (_ bv4 32))) [2018-11-14 16:49:12,454 INFO L421 ceAbstractionStarter]: At program point L11-4(lines 11 13) the Hoare annotation is: (= (_ bv0 32) (bvurem main_~x~0 (_ bv4 32))) [2018-11-14 16:49:12,454 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-14 16:49:12,455 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-14 16:49:12,455 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-14 16:49:12,455 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-14 16:49:12,455 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-14 16:49:12,455 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-14 16:49:12,457 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 16:49:12,471 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 16:49:12,471 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 16:49:12,471 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 16:49:12,472 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2018-11-14 16:49:12,485 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 16:49:12,485 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 16:49:12,485 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 16:49:12,485 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2018-11-14 16:49:12,485 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2018-11-14 16:49:12,485 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-14 16:49:12,486 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 16:49:12,486 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 16:49:12,486 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-14 16:49:12,486 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-14 16:49:12,486 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-14 16:49:12,486 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 16:49:12,486 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 16:49:12,486 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 16:49:12,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 04:49:12 BoogieIcfgContainer [2018-11-14 16:49:12,495 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 16:49:12,496 INFO L168 Benchmark]: Toolchain (without parser) took 4126.97 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.9 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -589.6 MB). Peak memory consumption was 142.3 MB. Max. memory is 7.1 GB. [2018-11-14 16:49:12,497 INFO L168 Benchmark]: CDTParser took 0.22 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-14 16:49:12,498 INFO L168 Benchmark]: CACSL2BoogieTranslator took 282.11 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-14 16:49:12,499 INFO L168 Benchmark]: Boogie Preprocessor took 38.88 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-14 16:49:12,499 INFO L168 Benchmark]: RCFGBuilder took 559.64 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -770.9 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2018-11-14 16:49:12,500 INFO L168 Benchmark]: TraceAbstraction took 3242.03 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 170.7 MB). Peak memory consumption was 170.7 MB. Max. memory is 7.1 GB. [2018-11-14 16:49:12,505 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.22 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 282.11 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 Preprocessor took 38.88 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 559.64 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -770.9 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3242.03 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 170.7 MB). Peak memory consumption was 170.7 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: 11]: Loop Invariant Derived loop invariant: 0bv32 == ~bvurem32(x, 4bv32) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. SAFE Result, 3.1s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 38 SDtfs, 2 SDslu, 70 SDs, 0 SdLazy, 26 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 10 PreInvPairs, 15 NumberOfFragments, 15 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 18 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 43 ConstructedInterpolants, 0 QuantifiedInterpolants, 1209 SizeOfPredicates, 4 NumberOfNonLiveVariables, 59 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 2/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...