java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf -i ../../../trunk/examples/svcomp/loop-industry-pattern/mod3_true-unreach-call.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 19:24:22,021 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 19:24:22,023 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 19:24:22,036 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 19:24:22,036 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 19:24:22,037 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 19:24:22,038 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 19:24:22,040 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 19:24:22,042 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 19:24:22,043 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 19:24:22,044 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 19:24:22,044 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 19:24:22,045 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 19:24:22,046 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 19:24:22,048 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 19:24:22,049 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 19:24:22,050 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 19:24:22,052 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 19:24:22,054 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 19:24:22,056 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 19:24:22,057 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 19:24:22,059 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 19:24:22,061 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 19:24:22,062 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 19:24:22,062 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 19:24:22,063 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 19:24:22,064 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 19:24:22,065 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 19:24:22,066 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 19:24:22,067 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 19:24:22,068 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 19:24:22,069 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 19:24:22,069 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 19:24:22,069 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 19:24:22,070 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 19:24:22,071 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 19:24:22,072 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 19:24:22,088 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 19:24:22,088 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 19:24:22,089 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 19:24:22,089 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 19:24:22,090 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 19:24:22,090 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 19:24:22,091 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 19:24:22,091 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 19:24:22,091 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 19:24:22,091 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 19:24:22,092 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 19:24:22,092 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 19:24:22,092 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 19:24:22,092 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 19:24:22,092 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 19:24:22,093 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 19:24:22,093 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 19:24:22,093 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 19:24:22,093 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 19:24:22,094 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 19:24:22,094 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 19:24:22,094 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 19:24:22,094 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 19:24:22,094 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 19:24:22,095 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 19:24:22,095 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 19:24:22,095 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 19:24:22,095 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 19:24:22,095 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 19:24:22,096 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 19:24:22,096 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 19:24:22,152 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 19:24:22,172 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 19:24:22,176 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 19:24:22,178 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 19:24:22,178 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 19:24:22,179 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-industry-pattern/mod3_true-unreach-call.c.v+cfa-reducer.c [2018-11-14 19:24:22,248 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34fa3544b/bbcf415ed22d46abbb6e388db09dd74f/FLAGccd0489f8 [2018-11-14 19:24:22,731 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 19:24:22,732 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/mod3_true-unreach-call.c.v+cfa-reducer.c [2018-11-14 19:24:22,741 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34fa3544b/bbcf415ed22d46abbb6e388db09dd74f/FLAGccd0489f8 [2018-11-14 19:24:22,757 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34fa3544b/bbcf415ed22d46abbb6e388db09dd74f [2018-11-14 19:24:22,768 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 19:24:22,771 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 19:24:22,772 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 19:24:22,772 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 19:24:22,779 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 19:24:22,782 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:24:22" (1/1) ... [2018-11-14 19:24:22,785 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1818728e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:24:22, skipping insertion in model container [2018-11-14 19:24:22,785 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:24:22" (1/1) ... [2018-11-14 19:24:22,796 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 19:24:22,823 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 19:24:23,051 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:24:23,057 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 19:24:23,093 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:24:23,109 INFO L195 MainTranslator]: Completed translation [2018-11-14 19:24:23,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:24:23 WrapperNode [2018-11-14 19:24:23,109 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 19:24:23,110 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 19:24:23,110 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 19:24:23,110 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 19:24:23,123 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:24:23" (1/1) ... [2018-11-14 19:24:23,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:24:23" (1/1) ... [2018-11-14 19:24:23,130 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:24:23" (1/1) ... [2018-11-14 19:24:23,130 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:24:23" (1/1) ... [2018-11-14 19:24:23,137 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:24:23" (1/1) ... [2018-11-14 19:24:23,140 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:24:23" (1/1) ... [2018-11-14 19:24:23,142 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:24:23" (1/1) ... [2018-11-14 19:24:23,143 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 19:24:23,144 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 19:24:23,144 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 19:24:23,144 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 19:24:23,145 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:24:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 19:24:23,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 19:24:23,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 19:24:23,284 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 19:24:23,284 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 19:24:23,284 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 19:24:23,285 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 19:24:23,285 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 19:24:23,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 19:24:23,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 19:24:23,783 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 19:24:23,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:24:23 BoogieIcfgContainer [2018-11-14 19:24:23,784 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 19:24:23,785 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 19:24:23,785 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 19:24:23,788 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 19:24:23,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 07:24:22" (1/3) ... [2018-11-14 19:24:23,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5579efcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:24:23, skipping insertion in model container [2018-11-14 19:24:23,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:24:23" (2/3) ... [2018-11-14 19:24:23,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5579efcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:24:23, skipping insertion in model container [2018-11-14 19:24:23,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:24:23" (3/3) ... [2018-11-14 19:24:23,792 INFO L112 eAbstractionObserver]: Analyzing ICFG mod3_true-unreach-call.c.v+cfa-reducer.c [2018-11-14 19:24:23,802 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 19:24:23,810 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 19:24:23,825 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 19:24:23,855 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 19:24:23,856 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 19:24:23,856 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 19:24:23,856 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 19:24:23,857 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 19:24:23,857 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 19:24:23,857 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 19:24:23,857 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 19:24:23,857 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 19:24:23,877 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-14 19:24:23,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 19:24:23,884 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:24:23,885 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:24:23,887 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:24:23,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:24:23,894 INFO L82 PathProgramCache]: Analyzing trace with hash 964689295, now seen corresponding path program 1 times [2018-11-14 19:24:23,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:24:23,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:24:23,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:23,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:24:23,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:24,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:24:24,219 INFO L256 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2018-11-14 19:24:24,223 INFO L273 TraceCheckUtils]: 1: Hoare triple {22#true} ~__return_main~0 := 0;~__return_107~0 := 0; {22#true} is VALID [2018-11-14 19:24:24,223 INFO L273 TraceCheckUtils]: 2: Hoare triple {22#true} assume true; {22#true} is VALID [2018-11-14 19:24:24,224 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} #41#return; {22#true} is VALID [2018-11-14 19:24:24,224 INFO L256 TraceCheckUtils]: 4: Hoare triple {22#true} call #t~ret2 := main(); {22#true} is VALID [2018-11-14 19:24:24,235 INFO L273 TraceCheckUtils]: 5: Hoare triple {22#true} havoc ~main__x~0;~main__y~0 := 1; {24#(and (<= (div main_~main__y~0 4294967296) 0) (<= 1 main_~main__y~0))} is VALID [2018-11-14 19:24:24,237 INFO L273 TraceCheckUtils]: 6: Hoare triple {24#(and (<= (div main_~main__y~0 4294967296) 0) (<= 1 main_~main__y~0))} havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet0;havoc #t~nondet0; {24#(and (<= (div main_~main__y~0 4294967296) 0) (<= 1 main_~main__y~0))} is VALID [2018-11-14 19:24:24,240 INFO L273 TraceCheckUtils]: 7: Hoare triple {24#(and (<= (div main_~main__y~0 4294967296) 0) (<= 1 main_~main__y~0))} assume !!(~main____CPAchecker_TMP_0~0 == 0); {24#(and (<= (div main_~main__y~0 4294967296) 0) (<= 1 main_~main__y~0))} is VALID [2018-11-14 19:24:24,247 INFO L273 TraceCheckUtils]: 8: Hoare triple {24#(and (<= (div main_~main__y~0 4294967296) 0) (<= 1 main_~main__y~0))} assume ~main__y~0 % 4294967296 == 0;havoc ~__tmp_1~0;~__tmp_1~0 := (if (if ~main__x~0 % 4294967296 < 0 && ~main__x~0 % 4294967296 % 3 != 0 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296 == 0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {23#false} is VALID [2018-11-14 19:24:24,248 INFO L273 TraceCheckUtils]: 9: Hoare triple {23#false} assume ~__VERIFIER_assert__cond~0 == 0; {23#false} is VALID [2018-11-14 19:24:24,248 INFO L273 TraceCheckUtils]: 10: Hoare triple {23#false} assume !false; {23#false} is VALID [2018-11-14 19:24:24,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:24:24,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:24:24,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 19:24:24,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-14 19:24:24,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:24:24,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 19:24:24,364 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:24:24,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 19:24:24,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 19:24:24,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 19:24:24,375 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2018-11-14 19:24:24,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:24,788 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2018-11-14 19:24:24,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 19:24:24,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-14 19:24:24,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:24:24,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:24:24,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2018-11-14 19:24:24,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:24:24,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2018-11-14 19:24:24,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 44 transitions. [2018-11-14 19:24:24,942 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:24:24,954 INFO L225 Difference]: With dead ends: 34 [2018-11-14 19:24:24,955 INFO L226 Difference]: Without dead ends: 20 [2018-11-14 19:24:24,958 INFO L604 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-14 19:24:24,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-14 19:24:24,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2018-11-14 19:24:24,998 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:24:24,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 17 states. [2018-11-14 19:24:25,000 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 17 states. [2018-11-14 19:24:25,000 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 17 states. [2018-11-14 19:24:25,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:25,004 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2018-11-14 19:24:25,004 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2018-11-14 19:24:25,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:25,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:25,005 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 20 states. [2018-11-14 19:24:25,006 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 20 states. [2018-11-14 19:24:25,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:25,010 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2018-11-14 19:24:25,010 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2018-11-14 19:24:25,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:25,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:25,011 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:24:25,011 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:24:25,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 19:24:25,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-11-14 19:24:25,015 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 11 [2018-11-14 19:24:25,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:24:25,016 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-14 19:24:25,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 19:24:25,016 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2018-11-14 19:24:25,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-14 19:24:25,017 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:24:25,017 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:24:25,017 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:24:25,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:24:25,018 INFO L82 PathProgramCache]: Analyzing trace with hash 2096975293, now seen corresponding path program 1 times [2018-11-14 19:24:25,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:24:25,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:24:25,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:25,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:24:25,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:25,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:24:25,716 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 12 [2018-11-14 19:24:25,755 INFO L256 TraceCheckUtils]: 0: Hoare triple {130#true} call ULTIMATE.init(); {130#true} is VALID [2018-11-14 19:24:25,756 INFO L273 TraceCheckUtils]: 1: Hoare triple {130#true} ~__return_main~0 := 0;~__return_107~0 := 0; {130#true} is VALID [2018-11-14 19:24:25,756 INFO L273 TraceCheckUtils]: 2: Hoare triple {130#true} assume true; {130#true} is VALID [2018-11-14 19:24:25,756 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {130#true} {130#true} #41#return; {130#true} is VALID [2018-11-14 19:24:25,757 INFO L256 TraceCheckUtils]: 4: Hoare triple {130#true} call #t~ret2 := main(); {130#true} is VALID [2018-11-14 19:24:25,757 INFO L273 TraceCheckUtils]: 5: Hoare triple {130#true} havoc ~main__x~0;~main__y~0 := 1; {130#true} is VALID [2018-11-14 19:24:25,758 INFO L273 TraceCheckUtils]: 6: Hoare triple {130#true} havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet0;havoc #t~nondet0; {130#true} is VALID [2018-11-14 19:24:25,758 INFO L273 TraceCheckUtils]: 7: Hoare triple {130#true} assume !(~main____CPAchecker_TMP_0~0 == 0); {130#true} is VALID [2018-11-14 19:24:28,038 INFO L273 TraceCheckUtils]: 8: Hoare triple {130#true} assume (if ~main__x~0 % 4294967296 < 0 && ~main__x~0 % 4294967296 % 3 != 0 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296 == 1;~main__x~0 := ~main__x~0 + 2;~main__y~0 := 0; {132#(<= main_~main__x~0 (+ (* 4294967296 (div main_~main__x~0 4294967296)) (* 3 (div (+ main_~main__x~0 (* (- 4294967296) (div main_~main__x~0 4294967296))) 3))))} is UNKNOWN [2018-11-14 19:24:28,039 INFO L273 TraceCheckUtils]: 9: Hoare triple {132#(<= main_~main__x~0 (+ (* 4294967296 (div main_~main__x~0 4294967296)) (* 3 (div (+ main_~main__x~0 (* (- 4294967296) (div main_~main__x~0 4294967296))) 3))))} havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet0;havoc #t~nondet0; {132#(<= main_~main__x~0 (+ (* 4294967296 (div main_~main__x~0 4294967296)) (* 3 (div (+ main_~main__x~0 (* (- 4294967296) (div main_~main__x~0 4294967296))) 3))))} is VALID [2018-11-14 19:24:28,040 INFO L273 TraceCheckUtils]: 10: Hoare triple {132#(<= main_~main__x~0 (+ (* 4294967296 (div main_~main__x~0 4294967296)) (* 3 (div (+ main_~main__x~0 (* (- 4294967296) (div main_~main__x~0 4294967296))) 3))))} assume !!(~main____CPAchecker_TMP_0~0 == 0); {132#(<= main_~main__x~0 (+ (* 4294967296 (div main_~main__x~0 4294967296)) (* 3 (div (+ main_~main__x~0 (* (- 4294967296) (div main_~main__x~0 4294967296))) 3))))} is VALID [2018-11-14 19:24:28,041 INFO L273 TraceCheckUtils]: 11: Hoare triple {132#(<= main_~main__x~0 (+ (* 4294967296 (div main_~main__x~0 4294967296)) (* 3 (div (+ main_~main__x~0 (* (- 4294967296) (div main_~main__x~0 4294967296))) 3))))} assume ~main__y~0 % 4294967296 == 0;havoc ~__tmp_1~0;~__tmp_1~0 := (if (if ~main__x~0 % 4294967296 < 0 && ~main__x~0 % 4294967296 % 3 != 0 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296 == 0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {133#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 19:24:28,042 INFO L273 TraceCheckUtils]: 12: Hoare triple {133#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {131#false} is VALID [2018-11-14 19:24:28,043 INFO L273 TraceCheckUtils]: 13: Hoare triple {131#false} assume !false; {131#false} is VALID [2018-11-14 19:24:28,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:24:28,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:24:28,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 19:24:28,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-14 19:24:28,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:24:28,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 19:24:30,111 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 13 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-14 19:24:30,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 19:24:30,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 19:24:30,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 19:24:30,112 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 4 states. [2018-11-14 19:24:32,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:32,988 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2018-11-14 19:24:32,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 19:24:32,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-14 19:24:32,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:24:32,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 19:24:32,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2018-11-14 19:24:32,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 19:24:32,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2018-11-14 19:24:32,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 41 transitions. [2018-11-14 19:24:33,188 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:24:33,191 INFO L225 Difference]: With dead ends: 35 [2018-11-14 19:24:33,191 INFO L226 Difference]: Without dead ends: 22 [2018-11-14 19:24:33,192 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:24:33,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-14 19:24:33,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-14 19:24:33,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:24:33,210 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 21 states. [2018-11-14 19:24:33,210 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 21 states. [2018-11-14 19:24:33,210 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 21 states. [2018-11-14 19:24:33,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:33,213 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2018-11-14 19:24:33,213 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2018-11-14 19:24:33,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:33,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:33,214 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 22 states. [2018-11-14 19:24:33,214 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 22 states. [2018-11-14 19:24:33,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:33,217 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2018-11-14 19:24:33,217 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2018-11-14 19:24:33,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:33,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:33,218 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:24:33,218 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:24:33,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 19:24:33,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2018-11-14 19:24:33,221 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 14 [2018-11-14 19:24:33,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:24:33,221 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-11-14 19:24:33,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 19:24:33,221 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2018-11-14 19:24:33,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 19:24:33,222 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:24:33,222 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:24:33,223 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:24:33,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:24:33,223 INFO L82 PathProgramCache]: Analyzing trace with hash -726667991, now seen corresponding path program 1 times [2018-11-14 19:24:33,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:24:33,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:24:33,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:33,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:24:33,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:33,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:24:34,295 INFO L256 TraceCheckUtils]: 0: Hoare triple {254#true} call ULTIMATE.init(); {254#true} is VALID [2018-11-14 19:24:34,295 INFO L273 TraceCheckUtils]: 1: Hoare triple {254#true} ~__return_main~0 := 0;~__return_107~0 := 0; {254#true} is VALID [2018-11-14 19:24:34,295 INFO L273 TraceCheckUtils]: 2: Hoare triple {254#true} assume true; {254#true} is VALID [2018-11-14 19:24:34,296 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {254#true} {254#true} #41#return; {254#true} is VALID [2018-11-14 19:24:34,296 INFO L256 TraceCheckUtils]: 4: Hoare triple {254#true} call #t~ret2 := main(); {254#true} is VALID [2018-11-14 19:24:34,296 INFO L273 TraceCheckUtils]: 5: Hoare triple {254#true} havoc ~main__x~0;~main__y~0 := 1; {254#true} is VALID [2018-11-14 19:24:34,296 INFO L273 TraceCheckUtils]: 6: Hoare triple {254#true} havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet0;havoc #t~nondet0; {254#true} is VALID [2018-11-14 19:24:34,297 INFO L273 TraceCheckUtils]: 7: Hoare triple {254#true} assume !(~main____CPAchecker_TMP_0~0 == 0); {254#true} is VALID [2018-11-14 19:24:34,297 INFO L273 TraceCheckUtils]: 8: Hoare triple {254#true} assume !((if ~main__x~0 % 4294967296 < 0 && ~main__x~0 % 4294967296 % 3 != 0 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296 == 1); {254#true} is VALID [2018-11-14 19:24:34,372 INFO L273 TraceCheckUtils]: 9: Hoare triple {254#true} assume (if ~main__x~0 % 4294967296 < 0 && ~main__x~0 % 4294967296 % 3 != 0 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296 == 2;~main__x~0 := ~main__x~0 + 1;~main__y~0 := 0; {256#(<= main_~main__x~0 (+ (* 4294967296 (div main_~main__x~0 4294967296)) (* 3 (div (+ main_~main__x~0 (* (- 4294967296) (div main_~main__x~0 4294967296))) 3))))} is VALID [2018-11-14 19:24:34,373 INFO L273 TraceCheckUtils]: 10: Hoare triple {256#(<= main_~main__x~0 (+ (* 4294967296 (div main_~main__x~0 4294967296)) (* 3 (div (+ main_~main__x~0 (* (- 4294967296) (div main_~main__x~0 4294967296))) 3))))} havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet0;havoc #t~nondet0; {256#(<= main_~main__x~0 (+ (* 4294967296 (div main_~main__x~0 4294967296)) (* 3 (div (+ main_~main__x~0 (* (- 4294967296) (div main_~main__x~0 4294967296))) 3))))} is VALID [2018-11-14 19:24:34,375 INFO L273 TraceCheckUtils]: 11: Hoare triple {256#(<= main_~main__x~0 (+ (* 4294967296 (div main_~main__x~0 4294967296)) (* 3 (div (+ main_~main__x~0 (* (- 4294967296) (div main_~main__x~0 4294967296))) 3))))} assume !!(~main____CPAchecker_TMP_0~0 == 0); {256#(<= main_~main__x~0 (+ (* 4294967296 (div main_~main__x~0 4294967296)) (* 3 (div (+ main_~main__x~0 (* (- 4294967296) (div main_~main__x~0 4294967296))) 3))))} is VALID [2018-11-14 19:24:34,377 INFO L273 TraceCheckUtils]: 12: Hoare triple {256#(<= main_~main__x~0 (+ (* 4294967296 (div main_~main__x~0 4294967296)) (* 3 (div (+ main_~main__x~0 (* (- 4294967296) (div main_~main__x~0 4294967296))) 3))))} assume ~main__y~0 % 4294967296 == 0;havoc ~__tmp_1~0;~__tmp_1~0 := (if (if ~main__x~0 % 4294967296 < 0 && ~main__x~0 % 4294967296 % 3 != 0 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296 == 0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {257#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 19:24:34,377 INFO L273 TraceCheckUtils]: 13: Hoare triple {257#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {255#false} is VALID [2018-11-14 19:24:34,378 INFO L273 TraceCheckUtils]: 14: Hoare triple {255#false} assume !false; {255#false} is VALID [2018-11-14 19:24:34,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:24:34,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:24:34,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 19:24:34,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-14 19:24:34,380 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:24:34,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 19:24:34,925 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:24:34,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 19:24:34,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 19:24:34,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 19:24:34,926 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 4 states. [2018-11-14 19:24:36,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:36,418 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2018-11-14 19:24:36,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 19:24:36,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-14 19:24:36,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:24:36,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 19:24:36,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2018-11-14 19:24:36,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 19:24:36,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2018-11-14 19:24:36,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2018-11-14 19:24:37,130 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:24:37,131 INFO L225 Difference]: With dead ends: 37 [2018-11-14 19:24:37,131 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 19:24:37,133 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:24:37,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 19:24:37,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 19:24:37,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:24:37,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 19:24:37,134 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 19:24:37,134 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 19:24:37,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:37,134 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 19:24:37,134 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 19:24:37,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:37,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:37,135 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 19:24:37,135 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 19:24:37,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:37,135 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 19:24:37,135 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 19:24:37,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:37,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:37,136 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:24:37,136 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:24:37,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 19:24:37,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 19:24:37,137 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2018-11-14 19:24:37,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:24:37,137 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 19:24:37,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 19:24:37,137 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 19:24:37,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:37,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 19:24:37,207 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-14 19:24:37,207 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-14 19:24:37,207 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 19:24:37,208 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 19:24:37,208 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 19:24:37,208 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 19:24:37,208 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 19:24:37,208 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 61) no Hoare annotation was computed. [2018-11-14 19:24:37,209 INFO L425 ceAbstractionStarter]: For program point L25(lines 25 47) no Hoare annotation was computed. [2018-11-14 19:24:37,209 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 7 76) no Hoare annotation was computed. [2018-11-14 19:24:37,209 INFO L425 ceAbstractionStarter]: For program point L52(lines 52 74) no Hoare annotation was computed. [2018-11-14 19:24:37,209 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 7 76) no Hoare annotation was computed. [2018-11-14 19:24:37,209 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 7 76) the Hoare annotation is: true [2018-11-14 19:24:37,209 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-11-14 19:24:37,209 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 68) no Hoare annotation was computed. [2018-11-14 19:24:37,210 INFO L425 ceAbstractionStarter]: For program point L16(lines 16 48) no Hoare annotation was computed. [2018-11-14 19:24:37,210 INFO L425 ceAbstractionStarter]: For program point L14(lines 14 75) no Hoare annotation was computed. [2018-11-14 19:24:37,210 INFO L421 ceAbstractionStarter]: At program point L45(lines 8 76) the Hoare annotation is: (or (and (<= (div main_~main__y~0 4294967296) 0) (<= 1 main_~main__y~0)) (<= main_~main__x~0 (let ((.cse0 (div main_~main__x~0 4294967296))) (+ (* 4294967296 .cse0) (* 3 (div (+ main_~main__x~0 (* (- 4294967296) .cse0)) 3)))))) [2018-11-14 19:24:37,210 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 46) no Hoare annotation was computed. [2018-11-14 19:24:37,212 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 19:24:37,222 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 19:24:37,222 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 19:24:37,222 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-14 19:24:37,222 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 19:24:37,223 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 19:24:37,223 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-14 19:24:37,223 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-14 19:24:37,223 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2018-11-14 19:24:37,223 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2018-11-14 19:24:37,223 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2018-11-14 19:24:37,223 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2018-11-14 19:24:37,223 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2018-11-14 19:24:37,223 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2018-11-14 19:24:37,223 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2018-11-14 19:24:37,224 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2018-11-14 19:24:37,224 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 19:24:37,224 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-14 19:24:37,224 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-14 19:24:37,224 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2018-11-14 19:24:37,224 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2018-11-14 19:24:37,224 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 19:24:37,224 INFO L163 areAnnotationChecker]: CFG has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 19:24:37,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 07:24:37 BoogieIcfgContainer [2018-11-14 19:24:37,234 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 19:24:37,236 INFO L168 Benchmark]: Toolchain (without parser) took 14466.74 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 718.3 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -575.8 MB). Peak memory consumption was 142.4 MB. Max. memory is 7.1 GB. [2018-11-14 19:24:37,237 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 19:24:37,238 INFO L168 Benchmark]: CACSL2BoogieTranslator took 337.62 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-14 19:24:37,238 INFO L168 Benchmark]: Boogie Preprocessor took 33.79 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 19:24:37,239 INFO L168 Benchmark]: RCFGBuilder took 640.00 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 718.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -754.0 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-14 19:24:37,240 INFO L168 Benchmark]: TraceAbstraction took 13449.37 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 167.6 MB). Peak memory consumption was 167.6 MB. Max. memory is 7.1 GB. [2018-11-14 19:24:37,245 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.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 337.62 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.79 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.00 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 718.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -754.0 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13449.37 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 167.6 MB). Peak memory consumption was 167.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 61]: 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: 8]: Loop Invariant Derived loop invariant: (main__y / 4294967296 <= 0 && 1 <= main__y) || main__x <= 4294967296 * (main__x / 4294967296) + 3 * ((main__x + -4294967296 * (main__x / 4294967296)) / 3) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 19 locations, 1 error locations. SAFE Result, 13.3s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 5.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 58 SDtfs, 13 SDslu, 68 SDs, 0 SdLazy, 40 SolverSat, 9 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=2, 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.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 7 NumberOfFragments, 33 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 40 NumberOfCodeBlocks, 40 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 37 ConstructedInterpolants, 0 QuantifiedInterpolants, 2217 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 4/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...