java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf -i ../../../trunk/examples/svcomp/loop-acceleration/const_true-unreach-call1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:29:01,811 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:29:01,813 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:29:01,829 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:29:01,830 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:29:01,831 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:29:01,833 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:29:01,836 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:29:01,845 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:29:01,846 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:29:01,847 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:29:01,847 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:29:01,848 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:29:01,849 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:29:01,851 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:29:01,852 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:29:01,853 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:29:01,855 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:29:01,857 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:29:01,858 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:29:01,860 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:29:01,861 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:29:01,863 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:29:01,864 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:29:01,864 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:29:01,865 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:29:01,866 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:29:01,867 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:29:01,868 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:29:01,870 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:29:01,870 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:29:01,871 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:29:01,871 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:29:01,871 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:29:01,872 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:29:01,873 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:29:01,873 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf [2018-11-14 18:29:01,890 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:29:01,890 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:29:01,891 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:29:01,891 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:29:01,892 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:29:01,892 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:29:01,892 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:29:01,892 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:29:01,893 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:29:01,893 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:29:01,893 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:29:01,893 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:29:01,893 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:29:01,894 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:29:01,894 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 18:29:01,894 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 18:29:01,894 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:29:01,894 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:29:01,895 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:29:01,895 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:29:01,895 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:29:01,895 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:29:01,896 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:29:01,896 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:29:01,896 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:29:01,896 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:29:01,896 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:29:01,897 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:29:01,897 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 18:29:01,897 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:29:01,897 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 18:29:01,897 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 18:29:01,898 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:29:01,947 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:29:01,964 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:29:01,970 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:29:01,972 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:29:01,972 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:29:01,973 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/const_true-unreach-call1.i [2018-11-14 18:29:02,055 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/943aeb613/23f5216db7434b11b0d9be8934e4d28c/FLAGc4fa19374 [2018-11-14 18:29:02,524 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:29:02,525 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/const_true-unreach-call1.i [2018-11-14 18:29:02,531 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/943aeb613/23f5216db7434b11b0d9be8934e4d28c/FLAGc4fa19374 [2018-11-14 18:29:02,546 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/943aeb613/23f5216db7434b11b0d9be8934e4d28c [2018-11-14 18:29:02,558 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:29:02,559 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:29:02,561 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:29:02,561 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:29:02,565 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:29:02,567 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:29:02" (1/1) ... [2018-11-14 18:29:02,570 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36be1352 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:29:02, skipping insertion in model container [2018-11-14 18:29:02,570 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:29:02" (1/1) ... [2018-11-14 18:29:02,581 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:29:02,601 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:29:02,840 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:29:02,845 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:29:02,864 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:29:02,882 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:29:02,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:29:02 WrapperNode [2018-11-14 18:29:02,882 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:29:02,883 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:29:02,884 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:29:02,884 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:29:02,900 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:29:02" (1/1) ... [2018-11-14 18:29:02,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:29:02" (1/1) ... [2018-11-14 18:29:02,907 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:29:02" (1/1) ... [2018-11-14 18:29:02,908 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:29:02" (1/1) ... [2018-11-14 18:29:02,915 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:29:02" (1/1) ... [2018-11-14 18:29:02,921 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:29:02" (1/1) ... [2018-11-14 18:29:02,922 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:29:02" (1/1) ... [2018-11-14 18:29:02,923 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:29:02,924 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:29:02,924 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:29:02,924 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:29:02,925 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:29:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:29:03,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:29:03,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:29:03,113 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 18:29:03,113 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:29:03,114 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:29:03,114 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 18:29:03,114 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:29:03,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:29:03,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:29:03,585 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:29:03,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:29:03 BoogieIcfgContainer [2018-11-14 18:29:03,586 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:29:03,587 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:29:03,587 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:29:03,590 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:29:03,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:29:02" (1/3) ... [2018-11-14 18:29:03,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b53f75c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:29:03, skipping insertion in model container [2018-11-14 18:29:03,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:29:02" (2/3) ... [2018-11-14 18:29:03,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b53f75c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:29:03, skipping insertion in model container [2018-11-14 18:29:03,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:29:03" (3/3) ... [2018-11-14 18:29:03,594 INFO L112 eAbstractionObserver]: Analyzing ICFG const_true-unreach-call1.i [2018-11-14 18:29:03,604 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:29:03,613 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:29:03,632 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:29:03,667 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:29:03,668 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:29:03,668 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:29:03,669 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:29:03,669 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:29:03,669 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:29:03,669 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:29:03,669 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:29:03,669 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:29:03,693 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-11-14 18:29:03,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-14 18:29:03,700 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:29:03,701 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:29:03,704 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:29:03,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:29:03,712 INFO L82 PathProgramCache]: Analyzing trace with hash -10373566, now seen corresponding path program 1 times [2018-11-14 18:29:03,716 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:29:03,717 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:29:03,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:29:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:29:03,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:29:03,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:29:03,858 INFO L256 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {21#true} is VALID [2018-11-14 18:29:03,862 INFO L273 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2018-11-14 18:29:03,862 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #32#return; {21#true} is VALID [2018-11-14 18:29:03,863 INFO L256 TraceCheckUtils]: 3: Hoare triple {21#true} call #t~ret1 := main(); {21#true} is VALID [2018-11-14 18:29:03,863 INFO L273 TraceCheckUtils]: 4: Hoare triple {21#true} ~x~0 := 1bv32;~y~0 := 0bv32; {21#true} is VALID [2018-11-14 18:29:03,876 INFO L273 TraceCheckUtils]: 5: Hoare triple {21#true} assume !true; {22#false} is VALID [2018-11-14 18:29:03,877 INFO L256 TraceCheckUtils]: 6: Hoare triple {22#false} call __VERIFIER_assert((if ~x~0 == 0bv32 then 1bv32 else 0bv32)); {22#false} is VALID [2018-11-14 18:29:03,878 INFO L273 TraceCheckUtils]: 7: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2018-11-14 18:29:03,878 INFO L273 TraceCheckUtils]: 8: Hoare triple {22#false} assume ~cond == 0bv32; {22#false} is VALID [2018-11-14 18:29:03,879 INFO L273 TraceCheckUtils]: 9: Hoare triple {22#false} assume !false; {22#false} is VALID [2018-11-14 18:29:03,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:29:03,882 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:29:03,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:29:03,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:29:03,890 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 18:29:03,894 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:29:03,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:29:03,937 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 18:29:03,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:29:03,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:29:03,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:29:03,949 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-14 18:29:04,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:29:04,082 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-14 18:29:04,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:29:04,082 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 18:29:04,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:29:04,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:29:04,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2018-11-14 18:29:04,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:29:04,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2018-11-14 18:29:04,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 32 transitions. [2018-11-14 18:29:04,310 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:29:04,321 INFO L225 Difference]: With dead ends: 29 [2018-11-14 18:29:04,322 INFO L226 Difference]: Without dead ends: 12 [2018-11-14 18:29:04,326 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 18:29:04,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-14 18:29:04,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-14 18:29:04,449 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:29:04,449 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-14 18:29:04,450 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-14 18:29:04,450 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-14 18:29:04,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:29:04,454 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-14 18:29:04,454 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-14 18:29:04,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:29:04,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:29:04,455 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-14 18:29:04,455 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-14 18:29:04,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:29:04,458 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-14 18:29:04,458 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-14 18:29:04,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:29:04,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:29:04,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:29:04,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:29:04,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:29:04,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-14 18:29:04,463 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-14 18:29:04,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:29:04,464 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-14 18:29:04,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:29:04,464 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-14 18:29:04,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 18:29:04,465 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:29:04,465 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:29:04,466 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:29:04,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:29:04,466 INFO L82 PathProgramCache]: Analyzing trace with hash -571410792, now seen corresponding path program 1 times [2018-11-14 18:29:04,466 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:29:04,467 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:29:04,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:29:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:29:04,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:29:04,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:29:04,612 INFO L256 TraceCheckUtils]: 0: Hoare triple {133#true} call ULTIMATE.init(); {133#true} is VALID [2018-11-14 18:29:04,613 INFO L273 TraceCheckUtils]: 1: Hoare triple {133#true} assume true; {133#true} is VALID [2018-11-14 18:29:04,614 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {133#true} {133#true} #32#return; {133#true} is VALID [2018-11-14 18:29:04,614 INFO L256 TraceCheckUtils]: 3: Hoare triple {133#true} call #t~ret1 := main(); {133#true} is VALID [2018-11-14 18:29:04,633 INFO L273 TraceCheckUtils]: 4: Hoare triple {133#true} ~x~0 := 1bv32;~y~0 := 0bv32; {150#(= main_~y~0 (_ bv0 32))} is VALID [2018-11-14 18:29:04,642 INFO L273 TraceCheckUtils]: 5: Hoare triple {150#(= main_~y~0 (_ bv0 32))} assume true; {150#(= main_~y~0 (_ bv0 32))} is VALID [2018-11-14 18:29:04,647 INFO L273 TraceCheckUtils]: 6: Hoare triple {150#(= main_~y~0 (_ bv0 32))} assume !~bvult32(~y~0, 1024bv32); {134#false} is VALID [2018-11-14 18:29:04,647 INFO L256 TraceCheckUtils]: 7: Hoare triple {134#false} call __VERIFIER_assert((if ~x~0 == 0bv32 then 1bv32 else 0bv32)); {134#false} is VALID [2018-11-14 18:29:04,647 INFO L273 TraceCheckUtils]: 8: Hoare triple {134#false} ~cond := #in~cond; {134#false} is VALID [2018-11-14 18:29:04,648 INFO L273 TraceCheckUtils]: 9: Hoare triple {134#false} assume ~cond == 0bv32; {134#false} is VALID [2018-11-14 18:29:04,648 INFO L273 TraceCheckUtils]: 10: Hoare triple {134#false} assume !false; {134#false} is VALID [2018-11-14 18:29:04,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:29:04,649 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:29:04,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:29:04,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:29:04,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-14 18:29:04,659 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:29:04,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:29:04,727 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 18:29:04,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:29:04,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:29:04,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:29:04,728 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2018-11-14 18:29:04,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:29:04,822 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-14 18:29:04,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:29:04,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-14 18:29:04,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:29:04,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:29:04,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2018-11-14 18:29:04,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:29:04,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2018-11-14 18:29:04,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 19 transitions. [2018-11-14 18:29:04,984 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 18:29:04,986 INFO L225 Difference]: With dead ends: 19 [2018-11-14 18:29:04,986 INFO L226 Difference]: Without dead ends: 14 [2018-11-14 18:29:04,987 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-14 18:29:04,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-14 18:29:05,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-14 18:29:05,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:29:05,032 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-14 18:29:05,032 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-14 18:29:05,032 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-14 18:29:05,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:29:05,034 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-14 18:29:05,034 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-14 18:29:05,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:29:05,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:29:05,035 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-14 18:29:05,035 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-14 18:29:05,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:29:05,037 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-14 18:29:05,038 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-14 18:29:05,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:29:05,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:29:05,038 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:29:05,039 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:29:05,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 18:29:05,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-14 18:29:05,041 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-11-14 18:29:05,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:29:05,041 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-14 18:29:05,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:29:05,041 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-14 18:29:05,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-14 18:29:05,042 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:29:05,042 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:29:05,042 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:29:05,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:29:05,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1625028318, now seen corresponding path program 1 times [2018-11-14 18:29:05,043 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:29:05,043 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:29:05,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:29:05,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:29:05,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:29:05,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:29:05,167 INFO L256 TraceCheckUtils]: 0: Hoare triple {247#true} call ULTIMATE.init(); {247#true} is VALID [2018-11-14 18:29:05,168 INFO L273 TraceCheckUtils]: 1: Hoare triple {247#true} assume true; {247#true} is VALID [2018-11-14 18:29:05,168 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {247#true} {247#true} #32#return; {247#true} is VALID [2018-11-14 18:29:05,168 INFO L256 TraceCheckUtils]: 3: Hoare triple {247#true} call #t~ret1 := main(); {247#true} is VALID [2018-11-14 18:29:05,168 INFO L273 TraceCheckUtils]: 4: Hoare triple {247#true} ~x~0 := 1bv32;~y~0 := 0bv32; {247#true} is VALID [2018-11-14 18:29:05,169 INFO L273 TraceCheckUtils]: 5: Hoare triple {247#true} assume true; {247#true} is VALID [2018-11-14 18:29:05,170 INFO L273 TraceCheckUtils]: 6: Hoare triple {247#true} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {270#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 18:29:05,174 INFO L273 TraceCheckUtils]: 7: Hoare triple {270#(= main_~x~0 (_ bv0 32))} assume true; {270#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 18:29:05,174 INFO L273 TraceCheckUtils]: 8: Hoare triple {270#(= main_~x~0 (_ bv0 32))} assume !~bvult32(~y~0, 1024bv32); {270#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 18:29:05,177 INFO L256 TraceCheckUtils]: 9: Hoare triple {270#(= main_~x~0 (_ bv0 32))} call __VERIFIER_assert((if ~x~0 == 0bv32 then 1bv32 else 0bv32)); {280#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:29:05,178 INFO L273 TraceCheckUtils]: 10: Hoare triple {280#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {284#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:29:05,179 INFO L273 TraceCheckUtils]: 11: Hoare triple {284#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {248#false} is VALID [2018-11-14 18:29:05,179 INFO L273 TraceCheckUtils]: 12: Hoare triple {248#false} assume !false; {248#false} is VALID [2018-11-14 18:29:05,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:29:05,181 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:29:05,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:29:05,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 18:29:05,190 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-14 18:29:05,191 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:29:05,191 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:29:05,220 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:29:05,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:29:05,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:29:05,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:29:05,221 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 5 states. [2018-11-14 18:29:05,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:29:05,562 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-14 18:29:05,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 18:29:05,564 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-14 18:29:05,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:29:05,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:29:05,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2018-11-14 18:29:05,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:29:05,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2018-11-14 18:29:05,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 14 transitions. [2018-11-14 18:29:05,764 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:29:05,765 INFO L225 Difference]: With dead ends: 14 [2018-11-14 18:29:05,765 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 18:29:05,766 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:29:05,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 18:29:05,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 18:29:05,766 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:29:05,766 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 18:29:05,766 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 18:29:05,767 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 18:29:05,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:29:05,767 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 18:29:05,767 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 18:29:05,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:29:05,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:29:05,768 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 18:29:05,768 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 18:29:05,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:29:05,768 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 18:29:05,768 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 18:29:05,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:29:05,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:29:05,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:29:05,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:29:05,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 18:29:05,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 18:29:05,770 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2018-11-14 18:29:05,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:29:05,770 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 18:29:05,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:29:05,770 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 18:29:05,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:29:05,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 18:29:05,978 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-14 18:29:05,978 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 18:29:05,978 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 18:29:05,979 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 18:29:05,979 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 18:29:05,979 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 18:29:05,979 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 8 16) the Hoare annotation is: true [2018-11-14 18:29:05,979 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 8 16) no Hoare annotation was computed. [2018-11-14 18:29:05,979 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 8 16) no Hoare annotation was computed. [2018-11-14 18:29:05,980 INFO L425 ceAbstractionStarter]: For program point L11-1(lines 11 14) no Hoare annotation was computed. [2018-11-14 18:29:05,980 INFO L421 ceAbstractionStarter]: At program point L11-3(lines 11 14) the Hoare annotation is: (or (= main_~x~0 (_ bv0 32)) (= main_~y~0 (_ bv0 32))) [2018-11-14 18:29:05,980 INFO L421 ceAbstractionStarter]: At program point L11-4(lines 11 14) the Hoare annotation is: (= main_~x~0 (_ bv0 32)) [2018-11-14 18:29:05,980 INFO L425 ceAbstractionStarter]: For program point L3-2(lines 2 7) no Hoare annotation was computed. [2018-11-14 18:29:05,980 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 2 7) the Hoare annotation is: true [2018-11-14 18:29:05,980 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2018-11-14 18:29:05,981 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 2 7) no Hoare annotation was computed. [2018-11-14 18:29:05,981 INFO L425 ceAbstractionStarter]: For program point L4(line 4) no Hoare annotation was computed. [2018-11-14 18:29:05,981 INFO L425 ceAbstractionStarter]: For program point L3(lines 3 5) no Hoare annotation was computed. [2018-11-14 18:29:05,983 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 18:29:05,989 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-14 18:29:05,989 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 18:29:05,989 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 18:29:05,989 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2018-11-14 18:29:05,990 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-14 18:29:05,990 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-14 18:29:05,990 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 18:29:05,990 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2018-11-14 18:29:05,991 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2018-11-14 18:29:05,991 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 18:29:05,991 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 18:29:05,991 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 18:29:05,991 WARN L170 areAnnotationChecker]: L3-2 has no Hoare annotation [2018-11-14 18:29:05,991 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 18:29:05,991 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-14 18:29:05,991 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 18:29:05,991 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 18:29:06,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 06:29:06 BoogieIcfgContainer [2018-11-14 18:29:06,002 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 18:29:06,003 INFO L168 Benchmark]: Toolchain (without parser) took 3445.03 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 763.9 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -683.8 MB). Peak memory consumption was 80.1 MB. Max. memory is 7.1 GB. [2018-11-14 18:29:06,005 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-14 18:29:06,006 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.29 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 18:29:06,007 INFO L168 Benchmark]: Boogie Preprocessor took 40.16 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 18:29:06,008 INFO L168 Benchmark]: RCFGBuilder took 662.11 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 763.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -808.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2018-11-14 18:29:06,009 INFO L168 Benchmark]: TraceAbstraction took 2415.07 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 114.4 MB). Peak memory consumption was 114.4 MB. Max. memory is 7.1 GB. [2018-11-14 18:29:06,013 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 322.29 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 40.16 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 662.11 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 763.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -808.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2415.07 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 114.4 MB). Peak memory consumption was 114.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: 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: x == 0bv32 || y == 0bv32 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 18 locations, 1 error locations. SAFE Result, 2.3s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 40 SDtfs, 1 SDslu, 36 SDs, 0 SdLazy, 6 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred 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, 9 PreInvPairs, 11 NumberOfFragments, 15 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 31 ConstructedInterpolants, 0 QuantifiedInterpolants, 533 SizeOfPredicates, 3 NumberOfNonLiveVariables, 63 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...