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-acceleration/const_true-unreach-call1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:06:48,894 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:06:48,896 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:06:48,911 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:06:48,912 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:06:48,913 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:06:48,914 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:06:48,916 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:06:48,917 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:06:48,918 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:06:48,919 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:06:48,919 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:06:48,920 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:06:48,921 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:06:48,923 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:06:48,923 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:06:48,924 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:06:48,926 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:06:48,928 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:06:48,929 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:06:48,930 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:06:48,935 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:06:48,937 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:06:48,937 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:06:48,938 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:06:48,938 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:06:48,939 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:06:48,945 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:06:48,949 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:06:48,950 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:06:48,950 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:06:48,950 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:06:48,951 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:06:48,951 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:06:48,954 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:06:48,954 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:06:48,955 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:06:48,984 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:06:48,984 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:06:48,985 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:06:48,985 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:06:48,986 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:06:48,986 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:06:48,986 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:06:48,987 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:06:48,987 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:06:48,987 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:06:48,987 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:06:48,987 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:06:48,989 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:06:48,989 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:06:48,989 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:06:48,989 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:06:48,989 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:06:48,989 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:06:48,990 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:06:48,990 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:06:48,990 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:06:48,990 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:06:48,990 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:06:48,992 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:06:48,992 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:06:48,992 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:06:48,992 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:06:48,993 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:06:48,993 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:06:48,993 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:06:48,993 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:06:49,046 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:06:49,062 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:06:49,066 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:06:49,068 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:06:49,068 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:06:49,069 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-23 13:06:49,133 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97591d4ab/5d5d28618ae14a46a78ced1491d708a5/FLAG292a41482 [2018-11-23 13:06:49,583 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:06:49,584 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/const_true-unreach-call1.i [2018-11-23 13:06:49,588 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97591d4ab/5d5d28618ae14a46a78ced1491d708a5/FLAG292a41482 [2018-11-23 13:06:49,966 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97591d4ab/5d5d28618ae14a46a78ced1491d708a5 [2018-11-23 13:06:49,975 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:06:49,976 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:06:49,977 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:06:49,977 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:06:49,981 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:06:49,983 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:06:49" (1/1) ... [2018-11-23 13:06:49,986 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dc6fea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:49, skipping insertion in model container [2018-11-23 13:06:49,986 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:06:49" (1/1) ... [2018-11-23 13:06:49,996 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:06:50,014 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:06:50,259 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:06:50,266 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:06:50,285 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:06:50,303 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:06:50,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:50 WrapperNode [2018-11-23 13:06:50,304 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:06:50,305 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:06:50,305 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:06:50,305 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:06:50,315 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:06:50" (1/1) ... [2018-11-23 13:06:50,321 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:06:50" (1/1) ... [2018-11-23 13:06:50,329 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:06:50,330 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:06:50,330 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:06:50,330 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:06:50,343 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:50" (1/1) ... [2018-11-23 13:06:50,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:50" (1/1) ... [2018-11-23 13:06:50,344 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:50" (1/1) ... [2018-11-23 13:06:50,344 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:50" (1/1) ... [2018-11-23 13:06:50,350 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:50" (1/1) ... [2018-11-23 13:06:50,356 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:50" (1/1) ... [2018-11-23 13:06:50,357 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:50" (1/1) ... [2018-11-23 13:06:50,358 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:06:50,359 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:06:50,359 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:06:50,359 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:06:50,362 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:50" (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:06:50,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:06:50,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:06:50,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:06:50,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:06:50,527 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:06:50,527 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:06:50,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:06:50,528 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:06:50,928 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:06:50,928 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:06:50,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:06:50 BoogieIcfgContainer [2018-11-23 13:06:50,929 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:06:50,929 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:06:50,930 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:06:50,933 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:06:50,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:06:49" (1/3) ... [2018-11-23 13:06:50,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e877ecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:06:50, skipping insertion in model container [2018-11-23 13:06:50,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:50" (2/3) ... [2018-11-23 13:06:50,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e877ecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:06:50, skipping insertion in model container [2018-11-23 13:06:50,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:06:50" (3/3) ... [2018-11-23 13:06:50,936 INFO L112 eAbstractionObserver]: Analyzing ICFG const_true-unreach-call1.i [2018-11-23 13:06:50,946 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:06:50,958 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:06:50,975 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:06:51,007 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:06:51,007 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:06:51,008 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:06:51,008 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:06:51,008 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:06:51,008 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:06:51,008 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:06:51,008 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:06:51,008 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:06:51,026 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-11-23 13:06:51,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:06:51,031 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:51,032 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:51,034 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:51,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:51,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1846144830, now seen corresponding path program 1 times [2018-11-23 13:06:51,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:51,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:51,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:51,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:51,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:51,333 INFO L256 TraceCheckUtils]: 0: Hoare triple {20#true} call ULTIMATE.init(); {20#true} is VALID [2018-11-23 13:06:51,337 INFO L273 TraceCheckUtils]: 1: Hoare triple {20#true} assume true; {20#true} is VALID [2018-11-23 13:06:51,337 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {20#true} {20#true} #31#return; {20#true} is VALID [2018-11-23 13:06:51,338 INFO L256 TraceCheckUtils]: 3: Hoare triple {20#true} call #t~ret1 := main(); {20#true} is VALID [2018-11-23 13:06:51,349 INFO L273 TraceCheckUtils]: 4: Hoare triple {20#true} ~x~0 := 1;~y~0 := 0; {22#(and (<= 0 main_~y~0) (<= main_~y~0 0))} is VALID [2018-11-23 13:06:51,351 INFO L273 TraceCheckUtils]: 5: Hoare triple {22#(and (<= 0 main_~y~0) (<= main_~y~0 0))} assume !(~y~0 % 4294967296 < 1024); {21#false} is VALID [2018-11-23 13:06:51,351 INFO L256 TraceCheckUtils]: 6: Hoare triple {21#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {21#false} is VALID [2018-11-23 13:06:51,352 INFO L273 TraceCheckUtils]: 7: Hoare triple {21#false} ~cond := #in~cond; {21#false} is VALID [2018-11-23 13:06:51,352 INFO L273 TraceCheckUtils]: 8: Hoare triple {21#false} assume 0 == ~cond; {21#false} is VALID [2018-11-23 13:06:51,353 INFO L273 TraceCheckUtils]: 9: Hoare triple {21#false} assume !false; {21#false} is VALID [2018-11-23 13:06:51,356 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:06:51,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:06:51,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:06:51,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 13:06:51,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:51,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:06:51,419 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-23 13:06:51,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:06:51,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:06:51,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:06:51,432 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-11-23 13:06:51,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:51,691 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 13:06:51,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:06:51,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 13:06:51,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:51,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:06:51,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2018-11-23 13:06:51,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:06:51,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2018-11-23 13:06:51,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 34 transitions. [2018-11-23 13:06:51,932 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:51,943 INFO L225 Difference]: With dead ends: 29 [2018-11-23 13:06:51,943 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 13:06:51,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:06:51,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 13:06:52,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 13:06:52,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:52,005 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-23 13:06:52,005 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 13:06:52,005 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 13:06:52,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:52,008 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 13:06:52,009 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:06:52,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:52,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:52,009 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 13:06:52,010 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 13:06:52,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:52,012 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 13:06:52,013 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:06:52,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:52,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:52,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:52,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:52,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:06:52,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-23 13:06:52,017 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-23 13:06:52,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:52,017 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-23 13:06:52,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:06:52,018 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:06:52,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:06:52,019 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:52,019 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:52,019 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:52,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:52,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1432376145, now seen corresponding path program 1 times [2018-11-23 13:06:52,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:52,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:52,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:52,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:52,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:52,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:52,166 INFO L256 TraceCheckUtils]: 0: Hoare triple {108#true} call ULTIMATE.init(); {108#true} is VALID [2018-11-23 13:06:52,167 INFO L273 TraceCheckUtils]: 1: Hoare triple {108#true} assume true; {108#true} is VALID [2018-11-23 13:06:52,167 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {108#true} {108#true} #31#return; {108#true} is VALID [2018-11-23 13:06:52,168 INFO L256 TraceCheckUtils]: 3: Hoare triple {108#true} call #t~ret1 := main(); {108#true} is VALID [2018-11-23 13:06:52,168 INFO L273 TraceCheckUtils]: 4: Hoare triple {108#true} ~x~0 := 1;~y~0 := 0; {110#(and (<= 0 main_~y~0) (<= main_~y~0 0))} is VALID [2018-11-23 13:06:52,169 INFO L273 TraceCheckUtils]: 5: Hoare triple {110#(and (<= 0 main_~y~0) (<= main_~y~0 0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post0 := ~y~0;~y~0 := 1 + #t~post0;havoc #t~post0; {111#(and (< 0 (+ (div main_~y~0 4294967296) 1)) (<= main_~y~0 1))} is VALID [2018-11-23 13:06:52,170 INFO L273 TraceCheckUtils]: 6: Hoare triple {111#(and (< 0 (+ (div main_~y~0 4294967296) 1)) (<= main_~y~0 1))} assume !(~y~0 % 4294967296 < 1024); {109#false} is VALID [2018-11-23 13:06:52,171 INFO L256 TraceCheckUtils]: 7: Hoare triple {109#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {109#false} is VALID [2018-11-23 13:06:52,171 INFO L273 TraceCheckUtils]: 8: Hoare triple {109#false} ~cond := #in~cond; {109#false} is VALID [2018-11-23 13:06:52,171 INFO L273 TraceCheckUtils]: 9: Hoare triple {109#false} assume 0 == ~cond; {109#false} is VALID [2018-11-23 13:06:52,172 INFO L273 TraceCheckUtils]: 10: Hoare triple {109#false} assume !false; {109#false} is VALID [2018-11-23 13:06:52,174 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:06:52,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:52,174 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:06:52,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:52,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:52,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:52,340 INFO L256 TraceCheckUtils]: 0: Hoare triple {108#true} call ULTIMATE.init(); {108#true} is VALID [2018-11-23 13:06:52,341 INFO L273 TraceCheckUtils]: 1: Hoare triple {108#true} assume true; {108#true} is VALID [2018-11-23 13:06:52,342 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {108#true} {108#true} #31#return; {108#true} is VALID [2018-11-23 13:06:52,342 INFO L256 TraceCheckUtils]: 3: Hoare triple {108#true} call #t~ret1 := main(); {108#true} is VALID [2018-11-23 13:06:52,345 INFO L273 TraceCheckUtils]: 4: Hoare triple {108#true} ~x~0 := 1;~y~0 := 0; {110#(and (<= 0 main_~y~0) (<= main_~y~0 0))} is VALID [2018-11-23 13:06:52,348 INFO L273 TraceCheckUtils]: 5: Hoare triple {110#(and (<= 0 main_~y~0) (<= main_~y~0 0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post0 := ~y~0;~y~0 := 1 + #t~post0;havoc #t~post0; {130#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2018-11-23 13:06:52,349 INFO L273 TraceCheckUtils]: 6: Hoare triple {130#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~y~0 % 4294967296 < 1024); {109#false} is VALID [2018-11-23 13:06:52,349 INFO L256 TraceCheckUtils]: 7: Hoare triple {109#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {109#false} is VALID [2018-11-23 13:06:52,349 INFO L273 TraceCheckUtils]: 8: Hoare triple {109#false} ~cond := #in~cond; {109#false} is VALID [2018-11-23 13:06:52,350 INFO L273 TraceCheckUtils]: 9: Hoare triple {109#false} assume 0 == ~cond; {109#false} is VALID [2018-11-23 13:06:52,350 INFO L273 TraceCheckUtils]: 10: Hoare triple {109#false} assume !false; {109#false} is VALID [2018-11-23 13:06:52,351 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:06:52,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:52,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 13:06:52,373 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-23 13:06:52,374 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:52,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:06:52,414 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-23 13:06:52,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:06:52,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:06:52,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:06:52,415 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 5 states. [2018-11-23 13:06:52,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:52,722 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 13:06:52,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:06:52,722 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-23 13:06:52,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:52,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:06:52,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 13:06:52,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:06:52,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 13:06:52,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 18 transitions. [2018-11-23 13:06:52,872 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:06:52,874 INFO L225 Difference]: With dead ends: 18 [2018-11-23 13:06:52,876 INFO L226 Difference]: Without dead ends: 13 [2018-11-23 13:06:52,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:06:52,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-23 13:06:53,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 13:06:53,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:53,039 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2018-11-23 13:06:53,040 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 13:06:53,040 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 13:06:53,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:53,042 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-23 13:06:53,042 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 13:06:53,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:53,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:53,044 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 13:06:53,044 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 13:06:53,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:53,047 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-23 13:06:53,047 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 13:06:53,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:53,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:53,048 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:53,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:53,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:06:53,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-23 13:06:53,050 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-11-23 13:06:53,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:53,053 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-23 13:06:53,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:06:53,054 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 13:06:53,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:06:53,054 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:53,055 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:53,055 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:53,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:53,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1490448798, now seen corresponding path program 2 times [2018-11-23 13:06:53,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:53,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:53,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:53,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:53,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:53,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:53,352 INFO L256 TraceCheckUtils]: 0: Hoare triple {222#true} call ULTIMATE.init(); {222#true} is VALID [2018-11-23 13:06:53,353 INFO L273 TraceCheckUtils]: 1: Hoare triple {222#true} assume true; {222#true} is VALID [2018-11-23 13:06:53,353 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {222#true} {222#true} #31#return; {222#true} is VALID [2018-11-23 13:06:53,354 INFO L256 TraceCheckUtils]: 3: Hoare triple {222#true} call #t~ret1 := main(); {222#true} is VALID [2018-11-23 13:06:53,355 INFO L273 TraceCheckUtils]: 4: Hoare triple {222#true} ~x~0 := 1;~y~0 := 0; {224#(and (<= 0 main_~y~0) (<= main_~y~0 0))} is VALID [2018-11-23 13:06:53,355 INFO L273 TraceCheckUtils]: 5: Hoare triple {224#(and (<= 0 main_~y~0) (<= main_~y~0 0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post0 := ~y~0;~y~0 := 1 + #t~post0;havoc #t~post0; {225#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2018-11-23 13:06:53,356 INFO L273 TraceCheckUtils]: 6: Hoare triple {225#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post0 := ~y~0;~y~0 := 1 + #t~post0;havoc #t~post0; {226#(and (< 0 (+ (div main_~y~0 4294967296) 1)) (<= main_~y~0 2))} is VALID [2018-11-23 13:06:53,358 INFO L273 TraceCheckUtils]: 7: Hoare triple {226#(and (< 0 (+ (div main_~y~0 4294967296) 1)) (<= main_~y~0 2))} assume !(~y~0 % 4294967296 < 1024); {223#false} is VALID [2018-11-23 13:06:53,358 INFO L256 TraceCheckUtils]: 8: Hoare triple {223#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {223#false} is VALID [2018-11-23 13:06:53,359 INFO L273 TraceCheckUtils]: 9: Hoare triple {223#false} ~cond := #in~cond; {223#false} is VALID [2018-11-23 13:06:53,359 INFO L273 TraceCheckUtils]: 10: Hoare triple {223#false} assume 0 == ~cond; {223#false} is VALID [2018-11-23 13:06:53,360 INFO L273 TraceCheckUtils]: 11: Hoare triple {223#false} assume !false; {223#false} is VALID [2018-11-23 13:06:53,361 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:06:53,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:53,361 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:06:53,371 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:06:53,400 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:06:53,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:53,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:53,495 INFO L256 TraceCheckUtils]: 0: Hoare triple {222#true} call ULTIMATE.init(); {222#true} is VALID [2018-11-23 13:06:53,495 INFO L273 TraceCheckUtils]: 1: Hoare triple {222#true} assume true; {222#true} is VALID [2018-11-23 13:06:53,495 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {222#true} {222#true} #31#return; {222#true} is VALID [2018-11-23 13:06:53,496 INFO L256 TraceCheckUtils]: 3: Hoare triple {222#true} call #t~ret1 := main(); {222#true} is VALID [2018-11-23 13:06:53,496 INFO L273 TraceCheckUtils]: 4: Hoare triple {222#true} ~x~0 := 1;~y~0 := 0; {224#(and (<= 0 main_~y~0) (<= main_~y~0 0))} is VALID [2018-11-23 13:06:53,498 INFO L273 TraceCheckUtils]: 5: Hoare triple {224#(and (<= 0 main_~y~0) (<= main_~y~0 0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post0 := ~y~0;~y~0 := 1 + #t~post0;havoc #t~post0; {225#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2018-11-23 13:06:53,499 INFO L273 TraceCheckUtils]: 6: Hoare triple {225#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post0 := ~y~0;~y~0 := 1 + #t~post0;havoc #t~post0; {248#(and (<= main_~y~0 2) (<= 2 main_~y~0))} is VALID [2018-11-23 13:06:53,504 INFO L273 TraceCheckUtils]: 7: Hoare triple {248#(and (<= main_~y~0 2) (<= 2 main_~y~0))} assume !(~y~0 % 4294967296 < 1024); {223#false} is VALID [2018-11-23 13:06:53,504 INFO L256 TraceCheckUtils]: 8: Hoare triple {223#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {223#false} is VALID [2018-11-23 13:06:53,504 INFO L273 TraceCheckUtils]: 9: Hoare triple {223#false} ~cond := #in~cond; {223#false} is VALID [2018-11-23 13:06:53,505 INFO L273 TraceCheckUtils]: 10: Hoare triple {223#false} assume 0 == ~cond; {223#false} is VALID [2018-11-23 13:06:53,505 INFO L273 TraceCheckUtils]: 11: Hoare triple {223#false} assume !false; {223#false} is VALID [2018-11-23 13:06:53,506 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:06:53,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:53,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 13:06:53,528 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-23 13:06:53,528 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:53,528 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:06:53,548 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:53,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:06:53,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:06:53,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:06:53,549 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 6 states. [2018-11-23 13:06:53,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:53,676 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-23 13:06:53,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:06:53,676 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-23 13:06:53,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:53,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:06:53,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-23 13:06:53,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:06:53,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-23 13:06:53,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2018-11-23 13:06:53,734 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:06:53,735 INFO L225 Difference]: With dead ends: 19 [2018-11-23 13:06:53,735 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 13:06:53,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:06:53,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 13:06:53,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 13:06:53,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:53,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-23 13:06:53,773 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:06:53,773 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:06:53,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:53,774 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 13:06:53,775 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:06:53,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:53,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:53,775 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:06:53,775 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:06:53,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:53,777 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 13:06:53,777 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:06:53,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:53,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:53,778 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:53,778 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:53,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:06:53,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-23 13:06:53,779 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-11-23 13:06:53,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:53,779 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-23 13:06:53,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:06:53,780 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:06:53,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 13:06:53,780 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:53,780 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:53,781 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:53,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:53,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1004266255, now seen corresponding path program 3 times [2018-11-23 13:06:53,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:53,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:53,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:53,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:53,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:53,995 INFO L256 TraceCheckUtils]: 0: Hoare triple {346#true} call ULTIMATE.init(); {346#true} is VALID [2018-11-23 13:06:53,996 INFO L273 TraceCheckUtils]: 1: Hoare triple {346#true} assume true; {346#true} is VALID [2018-11-23 13:06:53,996 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {346#true} {346#true} #31#return; {346#true} is VALID [2018-11-23 13:06:53,997 INFO L256 TraceCheckUtils]: 3: Hoare triple {346#true} call #t~ret1 := main(); {346#true} is VALID [2018-11-23 13:06:53,998 INFO L273 TraceCheckUtils]: 4: Hoare triple {346#true} ~x~0 := 1;~y~0 := 0; {348#(and (<= 0 main_~y~0) (<= main_~y~0 0))} is VALID [2018-11-23 13:06:53,999 INFO L273 TraceCheckUtils]: 5: Hoare triple {348#(and (<= 0 main_~y~0) (<= main_~y~0 0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post0 := ~y~0;~y~0 := 1 + #t~post0;havoc #t~post0; {349#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2018-11-23 13:06:54,001 INFO L273 TraceCheckUtils]: 6: Hoare triple {349#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post0 := ~y~0;~y~0 := 1 + #t~post0;havoc #t~post0; {350#(and (<= main_~y~0 2) (<= 2 main_~y~0))} is VALID [2018-11-23 13:06:54,010 INFO L273 TraceCheckUtils]: 7: Hoare triple {350#(and (<= main_~y~0 2) (<= 2 main_~y~0))} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post0 := ~y~0;~y~0 := 1 + #t~post0;havoc #t~post0; {351#(and (< 0 (+ (div main_~y~0 4294967296) 1)) (<= main_~y~0 3))} is VALID [2018-11-23 13:06:54,010 INFO L273 TraceCheckUtils]: 8: Hoare triple {351#(and (< 0 (+ (div main_~y~0 4294967296) 1)) (<= main_~y~0 3))} assume !(~y~0 % 4294967296 < 1024); {347#false} is VALID [2018-11-23 13:06:54,011 INFO L256 TraceCheckUtils]: 9: Hoare triple {347#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {347#false} is VALID [2018-11-23 13:06:54,011 INFO L273 TraceCheckUtils]: 10: Hoare triple {347#false} ~cond := #in~cond; {347#false} is VALID [2018-11-23 13:06:54,011 INFO L273 TraceCheckUtils]: 11: Hoare triple {347#false} assume 0 == ~cond; {347#false} is VALID [2018-11-23 13:06:54,011 INFO L273 TraceCheckUtils]: 12: Hoare triple {347#false} assume !false; {347#false} is VALID [2018-11-23 13:06:54,012 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:54,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:54,012 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:06:54,021 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:06:54,029 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 13:06:54,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:54,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:54,113 INFO L256 TraceCheckUtils]: 0: Hoare triple {346#true} call ULTIMATE.init(); {346#true} is VALID [2018-11-23 13:06:54,114 INFO L273 TraceCheckUtils]: 1: Hoare triple {346#true} assume true; {346#true} is VALID [2018-11-23 13:06:54,114 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {346#true} {346#true} #31#return; {346#true} is VALID [2018-11-23 13:06:54,114 INFO L256 TraceCheckUtils]: 3: Hoare triple {346#true} call #t~ret1 := main(); {346#true} is VALID [2018-11-23 13:06:54,114 INFO L273 TraceCheckUtils]: 4: Hoare triple {346#true} ~x~0 := 1;~y~0 := 0; {346#true} is VALID [2018-11-23 13:06:54,114 INFO L273 TraceCheckUtils]: 5: Hoare triple {346#true} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post0 := ~y~0;~y~0 := 1 + #t~post0;havoc #t~post0; {346#true} is VALID [2018-11-23 13:06:54,115 INFO L273 TraceCheckUtils]: 6: Hoare triple {346#true} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post0 := ~y~0;~y~0 := 1 + #t~post0;havoc #t~post0; {346#true} is VALID [2018-11-23 13:06:54,116 INFO L273 TraceCheckUtils]: 7: Hoare triple {346#true} assume !!(~y~0 % 4294967296 < 1024);~x~0 := 0;#t~post0 := ~y~0;~y~0 := 1 + #t~post0;havoc #t~post0; {376#(= main_~x~0 0)} is VALID [2018-11-23 13:06:54,117 INFO L273 TraceCheckUtils]: 8: Hoare triple {376#(= main_~x~0 0)} assume !(~y~0 % 4294967296 < 1024); {376#(= main_~x~0 0)} is VALID [2018-11-23 13:06:54,118 INFO L256 TraceCheckUtils]: 9: Hoare triple {376#(= main_~x~0 0)} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {383#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:06:54,135 INFO L273 TraceCheckUtils]: 10: Hoare triple {383#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {387#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:06:54,144 INFO L273 TraceCheckUtils]: 11: Hoare triple {387#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {347#false} is VALID [2018-11-23 13:06:54,144 INFO L273 TraceCheckUtils]: 12: Hoare triple {347#false} assume !false; {347#false} is VALID [2018-11-23 13:06:54,145 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 13:06:54,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:06:54,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2018-11-23 13:06:54,164 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-11-23 13:06:54,164 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:54,165 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 13:06:54,193 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:54,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:06:54,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:06:54,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:06:54,194 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 9 states. [2018-11-23 13:06:54,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:54,444 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-23 13:06:54,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:06:54,445 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-11-23 13:06:54,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:54,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:06:54,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 19 transitions. [2018-11-23 13:06:54,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:06:54,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 19 transitions. [2018-11-23 13:06:54,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 19 transitions. [2018-11-23 13:06:54,496 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:06:54,496 INFO L225 Difference]: With dead ends: 18 [2018-11-23 13:06:54,496 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:06:54,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:06:54,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:06:54,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:06:54,497 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:54,498 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 13:06:54,498 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:06:54,498 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:06:54,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:54,499 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:06:54,499 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:06:54,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:54,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:54,500 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:06:54,500 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:06:54,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:54,500 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:06:54,500 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:06:54,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:54,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:54,501 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:54,501 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:54,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:06:54,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:06:54,501 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2018-11-23 13:06:54,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:54,502 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:06:54,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:06:54,502 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:06:54,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:54,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:06:54,591 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 13:06:54,591 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:06:54,592 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:06:54,592 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:06:54,592 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:06:54,592 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:06:54,592 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 8 16) the Hoare annotation is: true [2018-11-23 13:06:54,592 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 8 16) no Hoare annotation was computed. [2018-11-23 13:06:54,592 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 8 16) no Hoare annotation was computed. [2018-11-23 13:06:54,593 INFO L444 ceAbstractionStarter]: At program point L11-2(lines 11 14) the Hoare annotation is: (or (= main_~x~0 0) (and (<= 0 main_~y~0) (<= main_~y~0 0))) [2018-11-23 13:06:54,593 INFO L444 ceAbstractionStarter]: At program point L11-3(lines 11 14) the Hoare annotation is: (= main_~x~0 0) [2018-11-23 13:06:54,593 INFO L448 ceAbstractionStarter]: For program point L3-2(lines 2 7) no Hoare annotation was computed. [2018-11-23 13:06:54,593 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 2 7) the Hoare annotation is: true [2018-11-23 13:06:54,593 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2018-11-23 13:06:54,594 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 2 7) no Hoare annotation was computed. [2018-11-23 13:06:54,594 INFO L448 ceAbstractionStarter]: For program point L4(line 4) no Hoare annotation was computed. [2018-11-23 13:06:54,594 INFO L448 ceAbstractionStarter]: For program point L3(lines 3 5) no Hoare annotation was computed. [2018-11-23 13:06:54,595 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:06:54,601 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 13:06:54,601 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:06:54,601 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:06:54,605 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 13:06:54,605 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 13:06:54,605 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:06:54,605 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:06:54,605 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:06:54,605 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:06:54,605 WARN L170 areAnnotationChecker]: L3-2 has no Hoare annotation [2018-11-23 13:06:54,605 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:06:54,606 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:06:54,606 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:06:54,606 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 13:06:54,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:06:54 BoogieIcfgContainer [2018-11-23 13:06:54,615 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:06:54,616 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:06:54,616 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:06:54,616 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:06:54,616 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:06:50" (3/4) ... [2018-11-23 13:06:54,619 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:06:54,625 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:06:54,625 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:06:54,625 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 13:06:54,629 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-23 13:06:54,629 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 13:06:54,629 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:06:54,666 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-acceleration/const_true-unreach-call1.i-witness.graphml [2018-11-23 13:06:54,667 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:06:54,668 INFO L168 Benchmark]: Toolchain (without parser) took 4692.32 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 767.0 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -584.7 MB). Peak memory consumption was 182.3 MB. Max. memory is 7.1 GB. [2018-11-23 13:06:54,670 INFO L168 Benchmark]: CDTParser took 0.20 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:06:54,670 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.15 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:06:54,671 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.57 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:06:54,671 INFO L168 Benchmark]: Boogie Preprocessor took 28.83 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:06:54,672 INFO L168 Benchmark]: RCFGBuilder took 569.79 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 767.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -817.6 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2018-11-23 13:06:54,673 INFO L168 Benchmark]: TraceAbstraction took 3685.80 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 222.3 MB). Peak memory consumption was 222.3 MB. Max. memory is 7.1 GB. [2018-11-23 13:06:54,673 INFO L168 Benchmark]: Witness Printer took 51.16 ms. Allocated memory is still 2.3 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:06:54,678 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.20 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 327.15 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 24.57 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 28.83 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 569.79 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 767.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -817.6 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3685.80 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 222.3 MB). Peak memory consumption was 222.3 MB. Max. memory is 7.1 GB. * Witness Printer took 51.16 ms. Allocated memory is still 2.3 GB. Free memory is still 2.0 GB. There was no memory consumed. 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 == 0 || (0 <= y && y <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 17 locations, 1 error locations. SAFE Result, 3.5s OverallTime, 4 OverallIterations, 3 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 43 SDtfs, 1 SDslu, 100 SDs, 0 SdLazy, 58 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred 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.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 11 PreInvPairs, 16 NumberOfFragments, 19 HoareAnnotationTreeSize, 11 FomulaSimplifications, 34 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 82 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 2017 SizeOfPredicates, 5 NumberOfNonLiveVariables, 97 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 6/20 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...