java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-lit/cggmp2005_variant_true-unreach-call_true-termination.c.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:12:17,858 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:12:17,860 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:12:17,876 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:12:17,877 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:12:17,879 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:12:17,880 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:12:17,883 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:12:17,886 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:12:17,893 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:12:17,894 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:12:17,896 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:12:17,897 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:12:17,899 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:12:17,901 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:12:17,902 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:12:17,904 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:12:17,907 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:12:17,914 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:12:17,916 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:12:17,917 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:12:17,919 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:12:17,923 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:12:17,924 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:12:17,924 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:12:17,925 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:12:17,926 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:12:17,926 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:12:17,927 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:12:17,929 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:12:17,930 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:12:17,930 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:12:17,931 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:12:17,931 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:12:17,932 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:12:17,935 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:12:17,935 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:12:17,966 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:12:17,966 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:12:17,970 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:12:17,970 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:12:17,971 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:12:17,971 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:12:17,971 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:12:17,975 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:12:17,975 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:12:17,975 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:12:17,975 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:12:17,975 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:12:17,976 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:12:17,976 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:12:17,976 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:12:17,976 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:12:17,976 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:12:17,976 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:12:17,977 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:12:17,977 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:12:17,977 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:12:17,977 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:12:17,977 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:12:17,978 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:12:17,978 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:12:17,978 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:12:17,978 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:12:17,978 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:12:17,979 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:12:17,979 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:12:17,979 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:12:18,057 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:12:18,077 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:12:18,081 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:12:18,083 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:12:18,084 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:12:18,084 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/cggmp2005_variant_true-unreach-call_true-termination.c.i [2018-11-23 13:12:18,151 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/756fd0529/df7ffa1825614b65a159dd9d2e19db19/FLAGccd6dfcb4 [2018-11-23 13:12:18,559 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:12:18,560 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/cggmp2005_variant_true-unreach-call_true-termination.c.i [2018-11-23 13:12:18,565 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/756fd0529/df7ffa1825614b65a159dd9d2e19db19/FLAGccd6dfcb4 [2018-11-23 13:12:18,941 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/756fd0529/df7ffa1825614b65a159dd9d2e19db19 [2018-11-23 13:12:18,951 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:12:18,952 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:12:18,953 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:12:18,953 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:12:18,957 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:12:18,958 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:12:18" (1/1) ... [2018-11-23 13:12:18,961 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4176cb74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:18, skipping insertion in model container [2018-11-23 13:12:18,962 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:12:18" (1/1) ... [2018-11-23 13:12:18,973 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:12:18,999 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:12:19,259 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:12:19,266 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:12:19,288 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:12:19,306 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:12:19,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:19 WrapperNode [2018-11-23 13:12:19,307 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:12:19,308 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:12:19,308 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:12:19,308 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:12:19,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:19" (1/1) ... [2018-11-23 13:12:19,326 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:19" (1/1) ... [2018-11-23 13:12:19,334 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:12:19,334 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:12:19,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:12:19,335 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:12:19,346 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:19" (1/1) ... [2018-11-23 13:12:19,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:19" (1/1) ... [2018-11-23 13:12:19,347 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:19" (1/1) ... [2018-11-23 13:12:19,347 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:19" (1/1) ... [2018-11-23 13:12:19,353 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:19" (1/1) ... [2018-11-23 13:12:19,362 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:19" (1/1) ... [2018-11-23 13:12:19,364 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:19" (1/1) ... [2018-11-23 13:12:19,366 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:12:19,366 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:12:19,367 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:12:19,367 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:12:19,368 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:12:19,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:12:19,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:12:19,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:12:19,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:12:19,542 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:12:19,542 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:12:19,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:12:19,542 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:12:20,005 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:12:20,005 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:12:20,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:12:20 BoogieIcfgContainer [2018-11-23 13:12:20,006 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:12:20,008 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:12:20,008 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:12:20,011 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:12:20,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:12:18" (1/3) ... [2018-11-23 13:12:20,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47648969 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:12:20, skipping insertion in model container [2018-11-23 13:12:20,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:19" (2/3) ... [2018-11-23 13:12:20,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47648969 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:12:20, skipping insertion in model container [2018-11-23 13:12:20,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:12:20" (3/3) ... [2018-11-23 13:12:20,015 INFO L112 eAbstractionObserver]: Analyzing ICFG cggmp2005_variant_true-unreach-call_true-termination.c.i [2018-11-23 13:12:20,024 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:12:20,032 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:12:20,050 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:12:20,084 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:12:20,085 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:12:20,085 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:12:20,085 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:12:20,087 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:12:20,087 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:12:20,087 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:12:20,088 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:12:20,088 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:12:20,108 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-23 13:12:20,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:12:20,115 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:20,116 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:20,118 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:20,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:20,125 INFO L82 PathProgramCache]: Analyzing trace with hash 578729635, now seen corresponding path program 1 times [2018-11-23 13:12:20,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:20,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:20,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:20,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:20,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:20,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:20,289 INFO L256 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2018-11-23 13:12:20,293 INFO L273 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2018-11-23 13:12:20,293 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #36#return; {22#true} is VALID [2018-11-23 13:12:20,294 INFO L256 TraceCheckUtils]: 3: Hoare triple {22#true} call #t~ret2 := main(); {22#true} is VALID [2018-11-23 13:12:20,294 INFO L273 TraceCheckUtils]: 4: Hoare triple {22#true} havoc ~lo~0;havoc ~mid~0;havoc ~hi~0;~lo~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~mid~0 := #t~nondet1;havoc #t~nondet1; {22#true} is VALID [2018-11-23 13:12:20,295 INFO L273 TraceCheckUtils]: 5: Hoare triple {22#true} assume !!(~mid~0 > 0 && ~mid~0 <= 1000000);~hi~0 := 2 * ~mid~0; {22#true} is VALID [2018-11-23 13:12:20,296 INFO L273 TraceCheckUtils]: 6: Hoare triple {22#true} assume !true; {23#false} is VALID [2018-11-23 13:12:20,296 INFO L256 TraceCheckUtils]: 7: Hoare triple {23#false} call __VERIFIER_assert((if ~lo~0 == ~hi~0 then 1 else 0)); {23#false} is VALID [2018-11-23 13:12:20,297 INFO L273 TraceCheckUtils]: 8: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2018-11-23 13:12:20,297 INFO L273 TraceCheckUtils]: 9: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2018-11-23 13:12:20,298 INFO L273 TraceCheckUtils]: 10: Hoare triple {23#false} assume !false; {23#false} is VALID [2018-11-23 13:12:20,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:20,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:12:20,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:12:20,309 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-23 13:12:20,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:20,315 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:12:20,362 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-23 13:12:20,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:12:20,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:12:20,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:12:20,374 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-23 13:12:20,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:20,437 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-23 13:12:20,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:12:20,438 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-23 13:12:20,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:20,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:12:20,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 35 transitions. [2018-11-23 13:12:20,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:12:20,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 35 transitions. [2018-11-23 13:12:20,453 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 35 transitions. [2018-11-23 13:12:20,720 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:20,734 INFO L225 Difference]: With dead ends: 31 [2018-11-23 13:12:20,735 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 13:12:20,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:12:20,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 13:12:20,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 13:12:20,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:20,814 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-23 13:12:20,815 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 13:12:20,815 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 13:12:20,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:20,818 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 13:12:20,818 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:12:20,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:20,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:20,819 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 13:12:20,819 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 13:12:20,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:20,823 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 13:12:20,823 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:12:20,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:20,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:20,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:20,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:20,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:12:20,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-23 13:12:20,828 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 11 [2018-11-23 13:12:20,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:20,828 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-23 13:12:20,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:12:20,828 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:12:20,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:12:20,829 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:20,829 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:20,830 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:20,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:20,830 INFO L82 PathProgramCache]: Analyzing trace with hash 575035551, now seen corresponding path program 1 times [2018-11-23 13:12:20,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:20,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:20,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:20,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:20,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:20,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:20,927 INFO L256 TraceCheckUtils]: 0: Hoare triple {109#true} call ULTIMATE.init(); {109#true} is VALID [2018-11-23 13:12:20,927 INFO L273 TraceCheckUtils]: 1: Hoare triple {109#true} assume true; {109#true} is VALID [2018-11-23 13:12:20,928 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {109#true} {109#true} #36#return; {109#true} is VALID [2018-11-23 13:12:20,928 INFO L256 TraceCheckUtils]: 3: Hoare triple {109#true} call #t~ret2 := main(); {109#true} is VALID [2018-11-23 13:12:20,928 INFO L273 TraceCheckUtils]: 4: Hoare triple {109#true} havoc ~lo~0;havoc ~mid~0;havoc ~hi~0;~lo~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~mid~0 := #t~nondet1;havoc #t~nondet1; {109#true} is VALID [2018-11-23 13:12:20,946 INFO L273 TraceCheckUtils]: 5: Hoare triple {109#true} assume !!(~mid~0 > 0 && ~mid~0 <= 1000000);~hi~0 := 2 * ~mid~0; {111#(< 0 main_~mid~0)} is VALID [2018-11-23 13:12:20,961 INFO L273 TraceCheckUtils]: 6: Hoare triple {111#(< 0 main_~mid~0)} assume !(~mid~0 > 0); {110#false} is VALID [2018-11-23 13:12:20,961 INFO L256 TraceCheckUtils]: 7: Hoare triple {110#false} call __VERIFIER_assert((if ~lo~0 == ~hi~0 then 1 else 0)); {110#false} is VALID [2018-11-23 13:12:20,962 INFO L273 TraceCheckUtils]: 8: Hoare triple {110#false} ~cond := #in~cond; {110#false} is VALID [2018-11-23 13:12:20,962 INFO L273 TraceCheckUtils]: 9: Hoare triple {110#false} assume 0 == ~cond; {110#false} is VALID [2018-11-23 13:12:20,962 INFO L273 TraceCheckUtils]: 10: Hoare triple {110#false} assume !false; {110#false} is VALID [2018-11-23 13:12:20,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:20,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:12:20,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:12:20,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-23 13:12:20,966 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:20,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:12:21,032 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-23 13:12:21,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:12:21,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:12:21,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:12:21,033 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2018-11-23 13:12:21,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:21,147 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 13:12:21,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:12:21,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-23 13:12:21,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:21,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:12:21,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-11-23 13:12:21,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:12:21,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-11-23 13:12:21,153 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 18 transitions. [2018-11-23 13:12:21,191 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-23 13:12:21,192 INFO L225 Difference]: With dead ends: 18 [2018-11-23 13:12:21,192 INFO L226 Difference]: Without dead ends: 13 [2018-11-23 13:12:21,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:12:21,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-23 13:12:21,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 13:12:21,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:21,280 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2018-11-23 13:12:21,281 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 13:12:21,281 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 13:12:21,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:21,283 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-23 13:12:21,283 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 13:12:21,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:21,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:21,284 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 13:12:21,284 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 13:12:21,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:21,286 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-23 13:12:21,286 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 13:12:21,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:21,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:21,286 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:21,287 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:21,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:12:21,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-23 13:12:21,288 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-11-23 13:12:21,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:21,289 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-23 13:12:21,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:12:21,289 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 13:12:21,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:12:21,289 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:21,290 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:21,290 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:21,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:21,290 INFO L82 PathProgramCache]: Analyzing trace with hash 681770644, now seen corresponding path program 1 times [2018-11-23 13:12:21,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:21,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:21,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:21,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:21,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:21,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:21,847 INFO L256 TraceCheckUtils]: 0: Hoare triple {189#true} call ULTIMATE.init(); {189#true} is VALID [2018-11-23 13:12:21,847 INFO L273 TraceCheckUtils]: 1: Hoare triple {189#true} assume true; {189#true} is VALID [2018-11-23 13:12:21,848 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {189#true} {189#true} #36#return; {189#true} is VALID [2018-11-23 13:12:21,848 INFO L256 TraceCheckUtils]: 3: Hoare triple {189#true} call #t~ret2 := main(); {189#true} is VALID [2018-11-23 13:12:21,862 INFO L273 TraceCheckUtils]: 4: Hoare triple {189#true} havoc ~lo~0;havoc ~mid~0;havoc ~hi~0;~lo~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~mid~0 := #t~nondet1;havoc #t~nondet1; {191#(and (<= main_~lo~0 0) (<= 0 main_~lo~0))} is VALID [2018-11-23 13:12:21,876 INFO L273 TraceCheckUtils]: 5: Hoare triple {191#(and (<= main_~lo~0 0) (<= 0 main_~lo~0))} assume !!(~mid~0 > 0 && ~mid~0 <= 1000000);~hi~0 := 2 * ~mid~0; {192#(and (<= main_~hi~0 (+ (* 2 main_~mid~0) main_~lo~0)) (<= (+ main_~lo~0 2) main_~hi~0))} is VALID [2018-11-23 13:12:21,889 INFO L273 TraceCheckUtils]: 6: Hoare triple {192#(and (<= main_~hi~0 (+ (* 2 main_~mid~0) main_~lo~0)) (<= (+ main_~lo~0 2) main_~hi~0))} assume !!(~mid~0 > 0);~lo~0 := 1 + ~lo~0;~hi~0 := ~hi~0 - 1;~mid~0 := ~mid~0 - 1; {193#(and (or (<= main_~hi~0 main_~lo~0) (<= main_~hi~0 (+ (* 2 main_~mid~0) main_~lo~0))) (<= main_~lo~0 main_~hi~0))} is VALID [2018-11-23 13:12:21,902 INFO L273 TraceCheckUtils]: 7: Hoare triple {193#(and (or (<= main_~hi~0 main_~lo~0) (<= main_~hi~0 (+ (* 2 main_~mid~0) main_~lo~0))) (<= main_~lo~0 main_~hi~0))} assume !(~mid~0 > 0); {194#(and (<= main_~hi~0 main_~lo~0) (<= main_~lo~0 main_~hi~0))} is VALID [2018-11-23 13:12:21,916 INFO L256 TraceCheckUtils]: 8: Hoare triple {194#(and (<= main_~hi~0 main_~lo~0) (<= main_~lo~0 main_~hi~0))} call __VERIFIER_assert((if ~lo~0 == ~hi~0 then 1 else 0)); {195#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:12:21,929 INFO L273 TraceCheckUtils]: 9: Hoare triple {195#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {196#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:12:21,942 INFO L273 TraceCheckUtils]: 10: Hoare triple {196#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {190#false} is VALID [2018-11-23 13:12:21,942 INFO L273 TraceCheckUtils]: 11: Hoare triple {190#false} assume !false; {190#false} is VALID [2018-11-23 13:12:21,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:21,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:21,945 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:12:21,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:22,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:22,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:22,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:22,650 INFO L256 TraceCheckUtils]: 0: Hoare triple {189#true} call ULTIMATE.init(); {189#true} is VALID [2018-11-23 13:12:22,651 INFO L273 TraceCheckUtils]: 1: Hoare triple {189#true} assume true; {189#true} is VALID [2018-11-23 13:12:22,651 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {189#true} {189#true} #36#return; {189#true} is VALID [2018-11-23 13:12:22,651 INFO L256 TraceCheckUtils]: 3: Hoare triple {189#true} call #t~ret2 := main(); {189#true} is VALID [2018-11-23 13:12:22,653 INFO L273 TraceCheckUtils]: 4: Hoare triple {189#true} havoc ~lo~0;havoc ~mid~0;havoc ~hi~0;~lo~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~mid~0 := #t~nondet1;havoc #t~nondet1; {191#(and (<= main_~lo~0 0) (<= 0 main_~lo~0))} is VALID [2018-11-23 13:12:22,654 INFO L273 TraceCheckUtils]: 5: Hoare triple {191#(and (<= main_~lo~0 0) (<= 0 main_~lo~0))} assume !!(~mid~0 > 0 && ~mid~0 <= 1000000);~hi~0 := 2 * ~mid~0; {215#(and (<= main_~lo~0 0) (< 0 main_~mid~0) (= (* 2 main_~mid~0) main_~hi~0) (<= 0 main_~lo~0))} is VALID [2018-11-23 13:12:22,656 INFO L273 TraceCheckUtils]: 6: Hoare triple {215#(and (<= main_~lo~0 0) (< 0 main_~mid~0) (= (* 2 main_~mid~0) main_~hi~0) (<= 0 main_~lo~0))} assume !!(~mid~0 > 0);~lo~0 := 1 + ~lo~0;~hi~0 := ~hi~0 - 1;~mid~0 := ~mid~0 - 1; {219#(and (<= main_~lo~0 1) (exists ((v_main_~mid~0_8 Int)) (and (< 0 v_main_~mid~0_8) (= (* 2 v_main_~mid~0_8) (+ main_~hi~0 1)) (<= v_main_~mid~0_8 (+ main_~mid~0 1)))) (<= 1 main_~lo~0))} is VALID [2018-11-23 13:12:22,657 INFO L273 TraceCheckUtils]: 7: Hoare triple {219#(and (<= main_~lo~0 1) (exists ((v_main_~mid~0_8 Int)) (and (< 0 v_main_~mid~0_8) (= (* 2 v_main_~mid~0_8) (+ main_~hi~0 1)) (<= v_main_~mid~0_8 (+ main_~mid~0 1)))) (<= 1 main_~lo~0))} assume !(~mid~0 > 0); {223#(and (<= main_~lo~0 1) (<= 1 main_~lo~0) (exists ((v_main_~mid~0_8 Int)) (and (< 0 v_main_~mid~0_8) (= (* 2 v_main_~mid~0_8) (+ main_~hi~0 1)) (<= v_main_~mid~0_8 1))))} is VALID [2018-11-23 13:12:22,659 INFO L256 TraceCheckUtils]: 8: Hoare triple {223#(and (<= main_~lo~0 1) (<= 1 main_~lo~0) (exists ((v_main_~mid~0_8 Int)) (and (< 0 v_main_~mid~0_8) (= (* 2 v_main_~mid~0_8) (+ main_~hi~0 1)) (<= v_main_~mid~0_8 1))))} call __VERIFIER_assert((if ~lo~0 == ~hi~0 then 1 else 0)); {195#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:12:22,659 INFO L273 TraceCheckUtils]: 9: Hoare triple {195#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {196#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:12:22,660 INFO L273 TraceCheckUtils]: 10: Hoare triple {196#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {190#false} is VALID [2018-11-23 13:12:22,661 INFO L273 TraceCheckUtils]: 11: Hoare triple {190#false} assume !false; {190#false} is VALID [2018-11-23 13:12:22,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:22,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:22,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-11-23 13:12:22,685 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 12 [2018-11-23 13:12:22,685 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:22,685 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 13:12:22,748 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:22,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:12:22,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:12:22,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:12:22,750 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 11 states. [2018-11-23 13:12:23,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:23,141 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-23 13:12:23,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:12:23,141 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 12 [2018-11-23 13:12:23,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:23,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:12:23,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 19 transitions. [2018-11-23 13:12:23,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:12:23,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 19 transitions. [2018-11-23 13:12:23,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 19 transitions. [2018-11-23 13:12:23,221 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-23 13:12:23,222 INFO L225 Difference]: With dead ends: 19 [2018-11-23 13:12:23,222 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 13:12:23,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:12:23,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 13:12:23,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 13:12:23,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:23,240 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-23 13:12:23,240 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:12:23,241 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:12:23,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:23,243 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 13:12:23,243 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:12:23,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:23,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:23,244 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:12:23,244 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:12:23,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:23,246 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 13:12:23,246 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:12:23,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:23,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:23,247 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:23,247 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:23,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:12:23,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-23 13:12:23,249 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-11-23 13:12:23,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:23,250 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-23 13:12:23,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:12:23,250 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:12:23,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 13:12:23,251 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:23,251 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:23,251 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:23,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:23,251 INFO L82 PathProgramCache]: Analyzing trace with hash -304408769, now seen corresponding path program 2 times [2018-11-23 13:12:23,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:23,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:23,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:23,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:23,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:23,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:23,489 INFO L256 TraceCheckUtils]: 0: Hoare triple {320#true} call ULTIMATE.init(); {320#true} is VALID [2018-11-23 13:12:23,490 INFO L273 TraceCheckUtils]: 1: Hoare triple {320#true} assume true; {320#true} is VALID [2018-11-23 13:12:23,490 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {320#true} {320#true} #36#return; {320#true} is VALID [2018-11-23 13:12:23,491 INFO L256 TraceCheckUtils]: 3: Hoare triple {320#true} call #t~ret2 := main(); {320#true} is VALID [2018-11-23 13:12:23,492 INFO L273 TraceCheckUtils]: 4: Hoare triple {320#true} havoc ~lo~0;havoc ~mid~0;havoc ~hi~0;~lo~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~mid~0 := #t~nondet1;havoc #t~nondet1; {322#(and (<= main_~lo~0 0) (<= 0 main_~lo~0))} is VALID [2018-11-23 13:12:23,496 INFO L273 TraceCheckUtils]: 5: Hoare triple {322#(and (<= main_~lo~0 0) (<= 0 main_~lo~0))} assume !!(~mid~0 > 0 && ~mid~0 <= 1000000);~hi~0 := 2 * ~mid~0; {323#(and (<= (+ (* 2 main_~mid~0) main_~lo~0) main_~hi~0) (<= main_~hi~0 (+ (* 2 main_~mid~0) main_~lo~0)))} is VALID [2018-11-23 13:12:23,497 INFO L273 TraceCheckUtils]: 6: Hoare triple {323#(and (<= (+ (* 2 main_~mid~0) main_~lo~0) main_~hi~0) (<= main_~hi~0 (+ (* 2 main_~mid~0) main_~lo~0)))} assume !!(~mid~0 > 0);~lo~0 := 1 + ~lo~0;~hi~0 := ~hi~0 - 1;~mid~0 := ~mid~0 - 1; {323#(and (<= (+ (* 2 main_~mid~0) main_~lo~0) main_~hi~0) (<= main_~hi~0 (+ (* 2 main_~mid~0) main_~lo~0)))} is VALID [2018-11-23 13:12:23,498 INFO L273 TraceCheckUtils]: 7: Hoare triple {323#(and (<= (+ (* 2 main_~mid~0) main_~lo~0) main_~hi~0) (<= main_~hi~0 (+ (* 2 main_~mid~0) main_~lo~0)))} assume !!(~mid~0 > 0);~lo~0 := 1 + ~lo~0;~hi~0 := ~hi~0 - 1;~mid~0 := ~mid~0 - 1; {324#(and (or (<= main_~hi~0 main_~lo~0) (<= main_~hi~0 (+ (* 2 main_~mid~0) main_~lo~0))) (<= main_~lo~0 main_~hi~0))} is VALID [2018-11-23 13:12:23,500 INFO L273 TraceCheckUtils]: 8: Hoare triple {324#(and (or (<= main_~hi~0 main_~lo~0) (<= main_~hi~0 (+ (* 2 main_~mid~0) main_~lo~0))) (<= main_~lo~0 main_~hi~0))} assume !(~mid~0 > 0); {325#(and (<= main_~hi~0 main_~lo~0) (<= main_~lo~0 main_~hi~0))} is VALID [2018-11-23 13:12:23,501 INFO L256 TraceCheckUtils]: 9: Hoare triple {325#(and (<= main_~hi~0 main_~lo~0) (<= main_~lo~0 main_~hi~0))} call __VERIFIER_assert((if ~lo~0 == ~hi~0 then 1 else 0)); {326#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:12:23,502 INFO L273 TraceCheckUtils]: 10: Hoare triple {326#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {327#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:12:23,502 INFO L273 TraceCheckUtils]: 11: Hoare triple {327#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {321#false} is VALID [2018-11-23 13:12:23,503 INFO L273 TraceCheckUtils]: 12: Hoare triple {321#false} assume !false; {321#false} is VALID [2018-11-23 13:12:23,503 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:12:23,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:23,504 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:12:23,514 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:12:23,525 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:12:23,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:12:23,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:23,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:23,888 INFO L256 TraceCheckUtils]: 0: Hoare triple {320#true} call ULTIMATE.init(); {320#true} is VALID [2018-11-23 13:12:23,888 INFO L273 TraceCheckUtils]: 1: Hoare triple {320#true} assume true; {320#true} is VALID [2018-11-23 13:12:23,889 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {320#true} {320#true} #36#return; {320#true} is VALID [2018-11-23 13:12:23,889 INFO L256 TraceCheckUtils]: 3: Hoare triple {320#true} call #t~ret2 := main(); {320#true} is VALID [2018-11-23 13:12:23,891 INFO L273 TraceCheckUtils]: 4: Hoare triple {320#true} havoc ~lo~0;havoc ~mid~0;havoc ~hi~0;~lo~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~mid~0 := #t~nondet1;havoc #t~nondet1; {322#(and (<= main_~lo~0 0) (<= 0 main_~lo~0))} is VALID [2018-11-23 13:12:23,892 INFO L273 TraceCheckUtils]: 5: Hoare triple {322#(and (<= main_~lo~0 0) (<= 0 main_~lo~0))} assume !!(~mid~0 > 0 && ~mid~0 <= 1000000);~hi~0 := 2 * ~mid~0; {346#(and (<= main_~lo~0 0) (= (* 2 main_~mid~0) main_~hi~0) (<= 0 main_~lo~0))} is VALID [2018-11-23 13:12:23,893 INFO L273 TraceCheckUtils]: 6: Hoare triple {346#(and (<= main_~lo~0 0) (= (* 2 main_~mid~0) main_~hi~0) (<= 0 main_~lo~0))} assume !!(~mid~0 > 0);~lo~0 := 1 + ~lo~0;~hi~0 := ~hi~0 - 1;~mid~0 := ~mid~0 - 1; {350#(and (<= main_~lo~0 1) (= (+ (* 2 main_~mid~0) 1) main_~hi~0) (<= 1 main_~lo~0))} is VALID [2018-11-23 13:12:23,895 INFO L273 TraceCheckUtils]: 7: Hoare triple {350#(and (<= main_~lo~0 1) (= (+ (* 2 main_~mid~0) 1) main_~hi~0) (<= 1 main_~lo~0))} assume !!(~mid~0 > 0);~lo~0 := 1 + ~lo~0;~hi~0 := ~hi~0 - 1;~mid~0 := ~mid~0 - 1; {354#(and (exists ((v_main_~mid~0_10 Int)) (and (<= v_main_~mid~0_10 (+ main_~mid~0 1)) (= (* 2 v_main_~mid~0_10) main_~hi~0) (< 0 v_main_~mid~0_10))) (<= main_~lo~0 2) (<= 2 main_~lo~0))} is VALID [2018-11-23 13:12:23,897 INFO L273 TraceCheckUtils]: 8: Hoare triple {354#(and (exists ((v_main_~mid~0_10 Int)) (and (<= v_main_~mid~0_10 (+ main_~mid~0 1)) (= (* 2 v_main_~mid~0_10) main_~hi~0) (< 0 v_main_~mid~0_10))) (<= main_~lo~0 2) (<= 2 main_~lo~0))} assume !(~mid~0 > 0); {358#(and (<= main_~lo~0 2) (exists ((v_main_~mid~0_10 Int)) (and (<= v_main_~mid~0_10 1) (= (* 2 v_main_~mid~0_10) main_~hi~0) (< 0 v_main_~mid~0_10))) (<= 2 main_~lo~0))} is VALID [2018-11-23 13:12:23,898 INFO L256 TraceCheckUtils]: 9: Hoare triple {358#(and (<= main_~lo~0 2) (exists ((v_main_~mid~0_10 Int)) (and (<= v_main_~mid~0_10 1) (= (* 2 v_main_~mid~0_10) main_~hi~0) (< 0 v_main_~mid~0_10))) (<= 2 main_~lo~0))} call __VERIFIER_assert((if ~lo~0 == ~hi~0 then 1 else 0)); {326#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:12:23,899 INFO L273 TraceCheckUtils]: 10: Hoare triple {326#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {327#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:12:23,901 INFO L273 TraceCheckUtils]: 11: Hoare triple {327#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {321#false} is VALID [2018-11-23 13:12:23,901 INFO L273 TraceCheckUtils]: 12: Hoare triple {321#false} assume !false; {321#false} is VALID [2018-11-23 13:12:23,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:23,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:23,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2018-11-23 13:12:23,923 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2018-11-23 13:12:23,923 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:23,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 13:12:23,997 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-23 13:12:23,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 13:12:23,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 13:12:23,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:12:23,998 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 12 states. [2018-11-23 13:12:24,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:24,518 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2018-11-23 13:12:24,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:12:24,518 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2018-11-23 13:12:24,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:24,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:12:24,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2018-11-23 13:12:24,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:12:24,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2018-11-23 13:12:24,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 17 transitions. [2018-11-23 13:12:24,555 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:24,555 INFO L225 Difference]: With dead ends: 16 [2018-11-23 13:12:24,555 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:12:24,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-11-23 13:12:24,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:12:24,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:12:24,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:24,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:24,557 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:24,557 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:24,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:24,557 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:12:24,558 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:12:24,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:24,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:24,558 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:24,559 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:24,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:24,559 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:12:24,559 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:12:24,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:24,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:24,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:24,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:24,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:12:24,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:12:24,560 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2018-11-23 13:12:24,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:24,561 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:12:24,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 13:12:24,561 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:12:24,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:24,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:12:24,802 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2018-11-23 13:12:24,853 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 13:12:24,854 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:12:24,854 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:12:24,854 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:12:24,854 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:12:24,854 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:12:24,854 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 10 23) the Hoare annotation is: true [2018-11-23 13:12:24,855 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 23) no Hoare annotation was computed. [2018-11-23 13:12:24,855 INFO L448 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-11-23 13:12:24,855 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-11-23 13:12:24,855 INFO L444 ceAbstractionStarter]: At program point L16-2(lines 16 20) the Hoare annotation is: (let ((.cse0 (+ (* 2 main_~mid~0) main_~lo~0))) (and (<= .cse0 main_~hi~0) (<= main_~hi~0 .cse0) (<= main_~lo~0 main_~hi~0))) [2018-11-23 13:12:24,856 INFO L444 ceAbstractionStarter]: At program point L16-3(lines 16 20) the Hoare annotation is: (or (let ((.cse0 (+ (* 2 main_~mid~0) main_~lo~0))) (and (<= .cse0 main_~hi~0) (<= main_~hi~0 main_~lo~0) (<= main_~hi~0 .cse0) (<= main_~lo~0 main_~hi~0))) (and (<= main_~lo~0 1) (exists ((v_main_~mid~0_8 Int)) (and (< 0 v_main_~mid~0_8) (= (* 2 v_main_~mid~0_8) (+ main_~hi~0 1)) (<= v_main_~mid~0_8 (+ main_~mid~0 1)))) (<= 1 main_~lo~0) (exists ((v_main_~mid~0_8 Int)) (and (< 0 v_main_~mid~0_8) (= (* 2 v_main_~mid~0_8) (+ main_~hi~0 1)) (<= v_main_~mid~0_8 1))))) [2018-11-23 13:12:24,856 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 10 23) no Hoare annotation was computed. [2018-11-23 13:12:24,856 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-23 13:12:24,856 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:12:24,856 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-23 13:12:24,856 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-23 13:12:24,857 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-23 13:12:24,857 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:12:24,859 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:12:24,859 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-23 13:12:24,859 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:12:24,859 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:12:24,860 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:12:24,860 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-23 13:12:24,860 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-23 13:12:24,860 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:12:24,860 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:12:24,860 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:12:24,860 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:12:24,889 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:12:24,890 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:12:24,890 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 13:12:24,890 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:12:24,890 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 13:12:24,890 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:12:24,890 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 13:12:24,890 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 13:12:24,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:12:24 BoogieIcfgContainer [2018-11-23 13:12:24,901 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:12:24,902 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:12:24,902 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:12:24,902 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:12:24,902 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:12:20" (3/4) ... [2018-11-23 13:12:24,906 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:12:24,911 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:12:24,912 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:12:24,912 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 13:12:24,916 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-23 13:12:24,916 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 13:12:24,917 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:12:24,962 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-lit/cggmp2005_variant_true-unreach-call_true-termination.c.i-witness.graphml [2018-11-23 13:12:24,962 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:12:24,964 INFO L168 Benchmark]: Toolchain (without parser) took 6012.61 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 757.1 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -474.0 MB). Peak memory consumption was 283.1 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:24,965 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:12:24,966 INFO L168 Benchmark]: CACSL2BoogieTranslator took 354.27 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:24,967 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.56 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:12:24,967 INFO L168 Benchmark]: Boogie Preprocessor took 31.53 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:12:24,968 INFO L168 Benchmark]: RCFGBuilder took 640.02 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 757.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -796.6 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:24,968 INFO L168 Benchmark]: TraceAbstraction took 4893.69 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 298.6 MB). Peak memory consumption was 298.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:24,969 INFO L168 Benchmark]: Witness Printer took 60.70 ms. Allocated memory is still 2.3 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:24,974 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.21 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 354.27 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 26.56 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.53 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 640.02 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 757.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -796.6 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4893.69 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 298.6 MB). Peak memory consumption was 298.6 MB. Max. memory is 7.1 GB. * Witness Printer took 60.70 ms. Allocated memory is still 2.3 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: (2 * mid + lo <= hi && hi <= 2 * mid + lo) && lo <= hi - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. SAFE Result, 4.7s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 47 SDtfs, 10 SDslu, 78 SDs, 0 SdLazy, 71 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.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, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 11 PreInvPairs, 17 NumberOfFragments, 84 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 113 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 72 NumberOfCodeBlocks, 72 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 66 ConstructedInterpolants, 4 QuantifiedInterpolants, 3544 SizeOfPredicates, 6 NumberOfNonLiveVariables, 81 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 1/8 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...