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-acceleration/nested_true-unreach-call1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 19:20:08,181 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 19:20:08,184 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 19:20:08,198 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 19:20:08,198 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 19:20:08,199 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 19:20:08,201 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 19:20:08,203 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 19:20:08,205 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 19:20:08,206 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 19:20:08,207 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 19:20:08,210 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 19:20:08,211 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 19:20:08,212 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 19:20:08,216 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 19:20:08,217 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 19:20:08,218 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 19:20:08,223 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 19:20:08,225 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 19:20:08,227 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 19:20:08,230 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 19:20:08,232 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 19:20:08,237 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 19:20:08,237 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 19:20:08,237 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 19:20:08,238 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 19:20:08,239 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 19:20:08,242 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 19:20:08,243 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 19:20:08,244 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 19:20:08,244 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 19:20:08,245 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 19:20:08,245 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 19:20:08,245 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 19:20:08,248 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 19:20:08,249 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 19:20:08,249 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:20:08,278 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 19:20:08,279 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 19:20:08,279 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 19:20:08,280 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 19:20:08,280 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 19:20:08,280 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 19:20:08,281 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 19:20:08,281 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 19:20:08,281 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 19:20:08,281 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 19:20:08,281 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 19:20:08,282 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 19:20:08,282 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 19:20:08,282 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 19:20:08,282 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 19:20:08,282 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 19:20:08,283 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 19:20:08,283 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 19:20:08,283 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 19:20:08,283 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 19:20:08,283 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 19:20:08,284 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 19:20:08,284 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 19:20:08,284 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 19:20:08,284 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 19:20:08,284 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 19:20:08,285 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 19:20:08,285 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 19:20:08,285 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 19:20:08,285 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 19:20:08,285 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 19:20:08,329 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 19:20:08,342 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 19:20:08,346 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 19:20:08,348 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 19:20:08,348 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 19:20:08,349 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/nested_true-unreach-call1.i [2018-11-14 19:20:08,413 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ca2eb230/7fcef1de3d494365b8c84a5b2e5dddf8/FLAG6eedc7550 [2018-11-14 19:20:08,802 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 19:20:08,803 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/nested_true-unreach-call1.i [2018-11-14 19:20:08,810 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ca2eb230/7fcef1de3d494365b8c84a5b2e5dddf8/FLAG6eedc7550 [2018-11-14 19:20:08,824 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ca2eb230/7fcef1de3d494365b8c84a5b2e5dddf8 [2018-11-14 19:20:08,833 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 19:20:08,834 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 19:20:08,835 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 19:20:08,835 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 19:20:08,839 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 19:20:08,841 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:20:08" (1/1) ... [2018-11-14 19:20:08,844 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40a501ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:20:08, skipping insertion in model container [2018-11-14 19:20:08,844 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:20:08" (1/1) ... [2018-11-14 19:20:08,854 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 19:20:08,879 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 19:20:09,074 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:20:09,081 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 19:20:09,104 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:20:09,123 INFO L195 MainTranslator]: Completed translation [2018-11-14 19:20:09,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:20:09 WrapperNode [2018-11-14 19:20:09,123 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 19:20:09,124 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 19:20:09,124 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 19:20:09,125 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 19:20:09,142 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:20:09" (1/1) ... [2018-11-14 19:20:09,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:20:09" (1/1) ... [2018-11-14 19:20:09,148 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:20:09" (1/1) ... [2018-11-14 19:20:09,149 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:20:09" (1/1) ... [2018-11-14 19:20:09,155 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:20:09" (1/1) ... [2018-11-14 19:20:09,164 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:20:09" (1/1) ... [2018-11-14 19:20:09,165 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:20:09" (1/1) ... [2018-11-14 19:20:09,167 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 19:20:09,168 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 19:20:09,168 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 19:20:09,168 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 19:20:09,174 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:20:09" (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:20:09,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 19:20:09,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 19:20:09,308 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 19:20:09,308 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 19:20:09,308 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 19:20:09,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 19:20:09,309 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 19:20:09,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 19:20:09,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 19:20:09,857 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 19:20:09,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:20:09 BoogieIcfgContainer [2018-11-14 19:20:09,858 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 19:20:09,859 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 19:20:09,859 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 19:20:09,862 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 19:20:09,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 07:20:08" (1/3) ... [2018-11-14 19:20:09,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f80fdb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:20:09, skipping insertion in model container [2018-11-14 19:20:09,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:20:09" (2/3) ... [2018-11-14 19:20:09,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f80fdb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:20:09, skipping insertion in model container [2018-11-14 19:20:09,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:20:09" (3/3) ... [2018-11-14 19:20:09,866 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_true-unreach-call1.i [2018-11-14 19:20:09,876 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 19:20:09,883 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 19:20:09,898 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 19:20:09,938 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 19:20:09,939 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 19:20:09,939 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 19:20:09,939 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 19:20:09,939 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 19:20:09,939 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 19:20:09,939 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 19:20:09,939 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 19:20:09,940 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 19:20:09,959 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-11-14 19:20:09,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-14 19:20:09,965 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:20:09,966 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:20:09,969 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:20:09,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:20:09,975 INFO L82 PathProgramCache]: Analyzing trace with hash -283544510, now seen corresponding path program 1 times [2018-11-14 19:20:09,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:20:09,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:20:10,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:10,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:20:10,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:10,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:10,122 INFO L256 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2018-11-14 19:20:10,126 INFO L273 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2018-11-14 19:20:10,126 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #46#return; {24#true} is VALID [2018-11-14 19:20:10,127 INFO L256 TraceCheckUtils]: 3: Hoare triple {24#true} call #t~ret2 := main(); {24#true} is VALID [2018-11-14 19:20:10,127 INFO L273 TraceCheckUtils]: 4: Hoare triple {24#true} ~x~0 := 0;~y~0 := 0; {24#true} is VALID [2018-11-14 19:20:10,128 INFO L273 TraceCheckUtils]: 5: Hoare triple {24#true} assume !true; {25#false} is VALID [2018-11-14 19:20:10,129 INFO L256 TraceCheckUtils]: 6: Hoare triple {25#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {25#false} is VALID [2018-11-14 19:20:10,129 INFO L273 TraceCheckUtils]: 7: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2018-11-14 19:20:10,129 INFO L273 TraceCheckUtils]: 8: Hoare triple {25#false} assume ~cond == 0; {25#false} is VALID [2018-11-14 19:20:10,130 INFO L273 TraceCheckUtils]: 9: Hoare triple {25#false} assume !false; {25#false} is VALID [2018-11-14 19:20:10,132 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:20:10,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:20:10,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 19:20:10,139 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 19:20:10,142 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:20:10,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 19:20:10,190 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:20:10,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 19:20:10,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 19:20:10,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 19:20:10,202 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-11-14 19:20:10,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:10,310 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2018-11-14 19:20:10,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 19:20:10,311 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 19:20:10,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:20:10,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:20:10,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions. [2018-11-14 19:20:10,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:20:10,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions. [2018-11-14 19:20:10,331 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 46 transitions. [2018-11-14 19:20:10,709 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:20:10,720 INFO L225 Difference]: With dead ends: 37 [2018-11-14 19:20:10,721 INFO L226 Difference]: Without dead ends: 15 [2018-11-14 19:20:10,724 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 19:20:10,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-14 19:20:10,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-14 19:20:10,771 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:20:10,772 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-14 19:20:10,772 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-14 19:20:10,772 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-14 19:20:10,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:10,776 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-11-14 19:20:10,776 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-14 19:20:10,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:10,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:10,777 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-14 19:20:10,778 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-14 19:20:10,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:10,781 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-11-14 19:20:10,781 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-14 19:20:10,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:10,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:10,782 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:20:10,782 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:20:10,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 19:20:10,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-14 19:20:10,786 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2018-11-14 19:20:10,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:20:10,787 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-14 19:20:10,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 19:20:10,787 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-14 19:20:10,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 19:20:10,788 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:20:10,788 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:20:10,789 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:20:10,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:20:10,789 INFO L82 PathProgramCache]: Analyzing trace with hash -863512858, now seen corresponding path program 1 times [2018-11-14 19:20:10,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:20:10,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:20:10,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:10,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:20:10,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:10,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:11,027 INFO L256 TraceCheckUtils]: 0: Hoare triple {130#true} call ULTIMATE.init(); {130#true} is VALID [2018-11-14 19:20:11,028 INFO L273 TraceCheckUtils]: 1: Hoare triple {130#true} assume true; {130#true} is VALID [2018-11-14 19:20:11,028 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {130#true} {130#true} #46#return; {130#true} is VALID [2018-11-14 19:20:11,028 INFO L256 TraceCheckUtils]: 3: Hoare triple {130#true} call #t~ret2 := main(); {130#true} is VALID [2018-11-14 19:20:11,032 INFO L273 TraceCheckUtils]: 4: Hoare triple {130#true} ~x~0 := 0;~y~0 := 0; {132#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:20:11,034 INFO L273 TraceCheckUtils]: 5: Hoare triple {132#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {132#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:20:11,036 INFO L273 TraceCheckUtils]: 6: Hoare triple {132#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {131#false} is VALID [2018-11-14 19:20:11,036 INFO L256 TraceCheckUtils]: 7: Hoare triple {131#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {131#false} is VALID [2018-11-14 19:20:11,037 INFO L273 TraceCheckUtils]: 8: Hoare triple {131#false} ~cond := #in~cond; {131#false} is VALID [2018-11-14 19:20:11,037 INFO L273 TraceCheckUtils]: 9: Hoare triple {131#false} assume ~cond == 0; {131#false} is VALID [2018-11-14 19:20:11,037 INFO L273 TraceCheckUtils]: 10: Hoare triple {131#false} assume !false; {131#false} is VALID [2018-11-14 19:20:11,038 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:20:11,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:20:11,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 19:20:11,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-14 19:20:11,041 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:20:11,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 19:20:11,104 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:20:11,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 19:20:11,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 19:20:11,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 19:20:11,108 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 3 states. [2018-11-14 19:20:11,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:11,324 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-14 19:20:11,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 19:20:11,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-14 19:20:11,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:20:11,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:20:11,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2018-11-14 19:20:11,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:20:11,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2018-11-14 19:20:11,331 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 27 transitions. [2018-11-14 19:20:11,388 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:20:11,389 INFO L225 Difference]: With dead ends: 25 [2018-11-14 19:20:11,390 INFO L226 Difference]: Without dead ends: 20 [2018-11-14 19:20:11,391 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 19:20:11,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-14 19:20:11,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2018-11-14 19:20:11,405 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:20:11,405 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 17 states. [2018-11-14 19:20:11,405 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 17 states. [2018-11-14 19:20:11,406 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 17 states. [2018-11-14 19:20:11,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:11,408 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-14 19:20:11,408 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-14 19:20:11,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:11,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:11,409 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 20 states. [2018-11-14 19:20:11,409 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 20 states. [2018-11-14 19:20:11,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:11,412 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-14 19:20:11,412 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-14 19:20:11,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:11,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:11,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:20:11,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:20:11,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 19:20:11,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-11-14 19:20:11,415 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 11 [2018-11-14 19:20:11,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:20:11,416 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-14 19:20:11,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 19:20:11,416 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-14 19:20:11,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 19:20:11,417 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:20:11,417 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:20:11,417 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:20:11,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:20:11,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1427803270, now seen corresponding path program 1 times [2018-11-14 19:20:11,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:20:11,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:20:11,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:11,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:20:11,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:11,511 INFO L256 TraceCheckUtils]: 0: Hoare triple {238#true} call ULTIMATE.init(); {238#true} is VALID [2018-11-14 19:20:11,511 INFO L273 TraceCheckUtils]: 1: Hoare triple {238#true} assume true; {238#true} is VALID [2018-11-14 19:20:11,511 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {238#true} {238#true} #46#return; {238#true} is VALID [2018-11-14 19:20:11,512 INFO L256 TraceCheckUtils]: 3: Hoare triple {238#true} call #t~ret2 := main(); {238#true} is VALID [2018-11-14 19:20:11,512 INFO L273 TraceCheckUtils]: 4: Hoare triple {238#true} ~x~0 := 0;~y~0 := 0; {238#true} is VALID [2018-11-14 19:20:11,512 INFO L273 TraceCheckUtils]: 5: Hoare triple {238#true} assume true; {238#true} is VALID [2018-11-14 19:20:11,513 INFO L273 TraceCheckUtils]: 6: Hoare triple {238#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {240#(and (<= 0 main_~y~0) (<= main_~y~0 0))} is VALID [2018-11-14 19:20:11,514 INFO L273 TraceCheckUtils]: 7: Hoare triple {240#(and (<= 0 main_~y~0) (<= main_~y~0 0))} assume true; {240#(and (<= 0 main_~y~0) (<= main_~y~0 0))} is VALID [2018-11-14 19:20:11,524 INFO L273 TraceCheckUtils]: 8: Hoare triple {240#(and (<= 0 main_~y~0) (<= main_~y~0 0))} assume !(~y~0 % 4294967296 < 10); {239#false} is VALID [2018-11-14 19:20:11,524 INFO L273 TraceCheckUtils]: 9: Hoare triple {239#false} #t~post1 := ~x~0;~x~0 := #t~post1 + 1;havoc #t~post1; {239#false} is VALID [2018-11-14 19:20:11,525 INFO L273 TraceCheckUtils]: 10: Hoare triple {239#false} assume true; {239#false} is VALID [2018-11-14 19:20:11,525 INFO L273 TraceCheckUtils]: 11: Hoare triple {239#false} assume !(~x~0 % 4294967296 < 268435455); {239#false} is VALID [2018-11-14 19:20:11,525 INFO L256 TraceCheckUtils]: 12: Hoare triple {239#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {239#false} is VALID [2018-11-14 19:20:11,525 INFO L273 TraceCheckUtils]: 13: Hoare triple {239#false} ~cond := #in~cond; {239#false} is VALID [2018-11-14 19:20:11,526 INFO L273 TraceCheckUtils]: 14: Hoare triple {239#false} assume ~cond == 0; {239#false} is VALID [2018-11-14 19:20:11,526 INFO L273 TraceCheckUtils]: 15: Hoare triple {239#false} assume !false; {239#false} is VALID [2018-11-14 19:20:11,528 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:20:11,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:20:11,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 19:20:11,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-14 19:20:11,529 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:20:11,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 19:20:11,640 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:20:11,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 19:20:11,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 19:20:11,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 19:20:11,641 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 3 states. [2018-11-14 19:20:12,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:12,076 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-14 19:20:12,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 19:20:12,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-14 19:20:12,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:20:12,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:20:12,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2018-11-14 19:20:12,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:20:12,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2018-11-14 19:20:12,082 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2018-11-14 19:20:12,147 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:20:12,148 INFO L225 Difference]: With dead ends: 29 [2018-11-14 19:20:12,148 INFO L226 Difference]: Without dead ends: 19 [2018-11-14 19:20:12,149 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:20:12,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-14 19:20:12,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-14 19:20:12,185 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:20:12,185 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-14 19:20:12,185 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-14 19:20:12,186 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-14 19:20:12,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:12,188 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-14 19:20:12,188 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-14 19:20:12,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:12,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:12,189 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-14 19:20:12,189 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-14 19:20:12,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:12,191 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-14 19:20:12,192 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-14 19:20:12,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:12,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:12,192 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:20:12,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:20:12,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 19:20:12,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-14 19:20:12,194 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2018-11-14 19:20:12,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:20:12,195 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-14 19:20:12,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 19:20:12,195 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-14 19:20:12,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 19:20:12,196 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:20:12,196 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:20:12,197 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:20:12,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:20:12,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1523179828, now seen corresponding path program 1 times [2018-11-14 19:20:12,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:20:12,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:20:12,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:12,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:20:12,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:12,379 INFO L256 TraceCheckUtils]: 0: Hoare triple {353#true} call ULTIMATE.init(); {353#true} is VALID [2018-11-14 19:20:12,380 INFO L273 TraceCheckUtils]: 1: Hoare triple {353#true} assume true; {353#true} is VALID [2018-11-14 19:20:12,381 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {353#true} {353#true} #46#return; {353#true} is VALID [2018-11-14 19:20:12,381 INFO L256 TraceCheckUtils]: 3: Hoare triple {353#true} call #t~ret2 := main(); {353#true} is VALID [2018-11-14 19:20:12,381 INFO L273 TraceCheckUtils]: 4: Hoare triple {353#true} ~x~0 := 0;~y~0 := 0; {353#true} is VALID [2018-11-14 19:20:12,382 INFO L273 TraceCheckUtils]: 5: Hoare triple {353#true} assume true; {353#true} is VALID [2018-11-14 19:20:12,383 INFO L273 TraceCheckUtils]: 6: Hoare triple {353#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {355#(and (<= 0 main_~y~0) (<= main_~y~0 0))} is VALID [2018-11-14 19:20:12,384 INFO L273 TraceCheckUtils]: 7: Hoare triple {355#(and (<= 0 main_~y~0) (<= main_~y~0 0))} assume true; {355#(and (<= 0 main_~y~0) (<= main_~y~0 0))} is VALID [2018-11-14 19:20:12,385 INFO L273 TraceCheckUtils]: 8: Hoare triple {355#(and (<= 0 main_~y~0) (<= main_~y~0 0))} assume !!(~y~0 % 4294967296 < 10);#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {356#(and (< 0 (+ (div main_~y~0 4294967296) 1)) (<= main_~y~0 1))} is VALID [2018-11-14 19:20:12,385 INFO L273 TraceCheckUtils]: 9: Hoare triple {356#(and (< 0 (+ (div main_~y~0 4294967296) 1)) (<= main_~y~0 1))} assume true; {356#(and (< 0 (+ (div main_~y~0 4294967296) 1)) (<= main_~y~0 1))} is VALID [2018-11-14 19:20:12,387 INFO L273 TraceCheckUtils]: 10: Hoare triple {356#(and (< 0 (+ (div main_~y~0 4294967296) 1)) (<= main_~y~0 1))} assume !(~y~0 % 4294967296 < 10); {354#false} is VALID [2018-11-14 19:20:12,388 INFO L273 TraceCheckUtils]: 11: Hoare triple {354#false} #t~post1 := ~x~0;~x~0 := #t~post1 + 1;havoc #t~post1; {354#false} is VALID [2018-11-14 19:20:12,388 INFO L273 TraceCheckUtils]: 12: Hoare triple {354#false} assume true; {354#false} is VALID [2018-11-14 19:20:12,388 INFO L273 TraceCheckUtils]: 13: Hoare triple {354#false} assume !(~x~0 % 4294967296 < 268435455); {354#false} is VALID [2018-11-14 19:20:12,389 INFO L256 TraceCheckUtils]: 14: Hoare triple {354#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {354#false} is VALID [2018-11-14 19:20:12,389 INFO L273 TraceCheckUtils]: 15: Hoare triple {354#false} ~cond := #in~cond; {354#false} is VALID [2018-11-14 19:20:12,390 INFO L273 TraceCheckUtils]: 16: Hoare triple {354#false} assume ~cond == 0; {354#false} is VALID [2018-11-14 19:20:12,391 INFO L273 TraceCheckUtils]: 17: Hoare triple {354#false} assume !false; {354#false} is VALID [2018-11-14 19:20:12,392 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:20:12,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:20:12,393 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-14 19:20:12,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:20:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:12,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:12,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:20:12,558 INFO L256 TraceCheckUtils]: 0: Hoare triple {353#true} call ULTIMATE.init(); {353#true} is VALID [2018-11-14 19:20:12,558 INFO L273 TraceCheckUtils]: 1: Hoare triple {353#true} assume true; {353#true} is VALID [2018-11-14 19:20:12,558 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {353#true} {353#true} #46#return; {353#true} is VALID [2018-11-14 19:20:12,559 INFO L256 TraceCheckUtils]: 3: Hoare triple {353#true} call #t~ret2 := main(); {353#true} is VALID [2018-11-14 19:20:12,559 INFO L273 TraceCheckUtils]: 4: Hoare triple {353#true} ~x~0 := 0;~y~0 := 0; {372#(= main_~x~0 0)} is VALID [2018-11-14 19:20:12,560 INFO L273 TraceCheckUtils]: 5: Hoare triple {372#(= main_~x~0 0)} assume true; {372#(= main_~x~0 0)} is VALID [2018-11-14 19:20:12,561 INFO L273 TraceCheckUtils]: 6: Hoare triple {372#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {379#(and (= main_~y~0 0) (= main_~x~0 0))} is VALID [2018-11-14 19:20:12,565 INFO L273 TraceCheckUtils]: 7: Hoare triple {379#(and (= main_~y~0 0) (= main_~x~0 0))} assume true; {379#(and (= main_~y~0 0) (= main_~x~0 0))} is VALID [2018-11-14 19:20:12,567 INFO L273 TraceCheckUtils]: 8: Hoare triple {379#(and (= main_~y~0 0) (= main_~x~0 0))} assume !!(~y~0 % 4294967296 < 10);#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {372#(= main_~x~0 0)} is VALID [2018-11-14 19:20:12,567 INFO L273 TraceCheckUtils]: 9: Hoare triple {372#(= main_~x~0 0)} assume true; {372#(= main_~x~0 0)} is VALID [2018-11-14 19:20:12,569 INFO L273 TraceCheckUtils]: 10: Hoare triple {372#(= main_~x~0 0)} assume !(~y~0 % 4294967296 < 10); {372#(= main_~x~0 0)} is VALID [2018-11-14 19:20:12,569 INFO L273 TraceCheckUtils]: 11: Hoare triple {372#(= main_~x~0 0)} #t~post1 := ~x~0;~x~0 := #t~post1 + 1;havoc #t~post1; {395#(= main_~x~0 1)} is VALID [2018-11-14 19:20:12,571 INFO L273 TraceCheckUtils]: 12: Hoare triple {395#(= main_~x~0 1)} assume true; {395#(= main_~x~0 1)} is VALID [2018-11-14 19:20:12,572 INFO L273 TraceCheckUtils]: 13: Hoare triple {395#(= main_~x~0 1)} assume !(~x~0 % 4294967296 < 268435455); {354#false} is VALID [2018-11-14 19:20:12,572 INFO L256 TraceCheckUtils]: 14: Hoare triple {354#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {354#false} is VALID [2018-11-14 19:20:12,573 INFO L273 TraceCheckUtils]: 15: Hoare triple {354#false} ~cond := #in~cond; {354#false} is VALID [2018-11-14 19:20:12,573 INFO L273 TraceCheckUtils]: 16: Hoare triple {354#false} assume ~cond == 0; {354#false} is VALID [2018-11-14 19:20:12,573 INFO L273 TraceCheckUtils]: 17: Hoare triple {354#false} assume !false; {354#false} is VALID [2018-11-14 19:20:12,575 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:20:12,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:20:12,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2018-11-14 19:20:12,596 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-14 19:20:12,597 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:20:12,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 19:20:12,631 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:20:12,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 19:20:12,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 19:20:12,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-14 19:20:12,633 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 7 states. [2018-11-14 19:20:13,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:13,016 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-11-14 19:20:13,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 19:20:13,016 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-14 19:20:13,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:20:13,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 19:20:13,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 55 transitions. [2018-11-14 19:20:13,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 19:20:13,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 55 transitions. [2018-11-14 19:20:13,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 55 transitions. [2018-11-14 19:20:13,116 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:20:13,119 INFO L225 Difference]: With dead ends: 49 [2018-11-14 19:20:13,119 INFO L226 Difference]: Without dead ends: 37 [2018-11-14 19:20:13,120 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-14 19:20:13,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-14 19:20:13,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2018-11-14 19:20:13,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:20:13,200 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 30 states. [2018-11-14 19:20:13,200 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 30 states. [2018-11-14 19:20:13,201 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 30 states. [2018-11-14 19:20:13,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:13,204 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-11-14 19:20:13,205 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-14 19:20:13,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:13,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:13,206 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 37 states. [2018-11-14 19:20:13,206 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 37 states. [2018-11-14 19:20:13,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:13,208 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-11-14 19:20:13,209 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-14 19:20:13,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:13,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:13,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:20:13,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:20:13,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 19:20:13,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-11-14 19:20:13,212 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 18 [2018-11-14 19:20:13,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:20:13,213 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-11-14 19:20:13,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 19:20:13,213 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-11-14 19:20:13,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 19:20:13,214 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:20:13,214 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:20:13,214 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:20:13,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:20:13,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1070919706, now seen corresponding path program 2 times [2018-11-14 19:20:13,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:20:13,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:20:13,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:13,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:20:13,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:13,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:13,400 INFO L256 TraceCheckUtils]: 0: Hoare triple {610#true} call ULTIMATE.init(); {610#true} is VALID [2018-11-14 19:20:13,401 INFO L273 TraceCheckUtils]: 1: Hoare triple {610#true} assume true; {610#true} is VALID [2018-11-14 19:20:13,401 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {610#true} {610#true} #46#return; {610#true} is VALID [2018-11-14 19:20:13,402 INFO L256 TraceCheckUtils]: 3: Hoare triple {610#true} call #t~ret2 := main(); {610#true} is VALID [2018-11-14 19:20:13,402 INFO L273 TraceCheckUtils]: 4: Hoare triple {610#true} ~x~0 := 0;~y~0 := 0; {610#true} is VALID [2018-11-14 19:20:13,402 INFO L273 TraceCheckUtils]: 5: Hoare triple {610#true} assume true; {610#true} is VALID [2018-11-14 19:20:13,403 INFO L273 TraceCheckUtils]: 6: Hoare triple {610#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {612#(and (<= 0 main_~y~0) (<= main_~y~0 0))} is VALID [2018-11-14 19:20:13,404 INFO L273 TraceCheckUtils]: 7: Hoare triple {612#(and (<= 0 main_~y~0) (<= main_~y~0 0))} assume true; {612#(and (<= 0 main_~y~0) (<= main_~y~0 0))} is VALID [2018-11-14 19:20:13,405 INFO L273 TraceCheckUtils]: 8: Hoare triple {612#(and (<= 0 main_~y~0) (<= main_~y~0 0))} assume !!(~y~0 % 4294967296 < 10);#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {613#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2018-11-14 19:20:13,406 INFO L273 TraceCheckUtils]: 9: Hoare triple {613#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume true; {613#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2018-11-14 19:20:13,407 INFO L273 TraceCheckUtils]: 10: Hoare triple {613#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {614#(and (< 0 (+ (div main_~y~0 4294967296) 1)) (<= main_~y~0 2))} is VALID [2018-11-14 19:20:13,408 INFO L273 TraceCheckUtils]: 11: Hoare triple {614#(and (< 0 (+ (div main_~y~0 4294967296) 1)) (<= main_~y~0 2))} assume true; {614#(and (< 0 (+ (div main_~y~0 4294967296) 1)) (<= main_~y~0 2))} is VALID [2018-11-14 19:20:13,409 INFO L273 TraceCheckUtils]: 12: Hoare triple {614#(and (< 0 (+ (div main_~y~0 4294967296) 1)) (<= main_~y~0 2))} assume !(~y~0 % 4294967296 < 10); {611#false} is VALID [2018-11-14 19:20:13,409 INFO L273 TraceCheckUtils]: 13: Hoare triple {611#false} #t~post1 := ~x~0;~x~0 := #t~post1 + 1;havoc #t~post1; {611#false} is VALID [2018-11-14 19:20:13,410 INFO L273 TraceCheckUtils]: 14: Hoare triple {611#false} assume true; {611#false} is VALID [2018-11-14 19:20:13,411 INFO L273 TraceCheckUtils]: 15: Hoare triple {611#false} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {611#false} is VALID [2018-11-14 19:20:13,411 INFO L273 TraceCheckUtils]: 16: Hoare triple {611#false} assume true; {611#false} is VALID [2018-11-14 19:20:13,412 INFO L273 TraceCheckUtils]: 17: Hoare triple {611#false} assume !!(~y~0 % 4294967296 < 10);#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {611#false} is VALID [2018-11-14 19:20:13,412 INFO L273 TraceCheckUtils]: 18: Hoare triple {611#false} assume true; {611#false} is VALID [2018-11-14 19:20:13,412 INFO L273 TraceCheckUtils]: 19: Hoare triple {611#false} assume !!(~y~0 % 4294967296 < 10);#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {611#false} is VALID [2018-11-14 19:20:13,412 INFO L273 TraceCheckUtils]: 20: Hoare triple {611#false} assume true; {611#false} is VALID [2018-11-14 19:20:13,413 INFO L273 TraceCheckUtils]: 21: Hoare triple {611#false} assume !(~y~0 % 4294967296 < 10); {611#false} is VALID [2018-11-14 19:20:13,413 INFO L273 TraceCheckUtils]: 22: Hoare triple {611#false} #t~post1 := ~x~0;~x~0 := #t~post1 + 1;havoc #t~post1; {611#false} is VALID [2018-11-14 19:20:13,414 INFO L273 TraceCheckUtils]: 23: Hoare triple {611#false} assume true; {611#false} is VALID [2018-11-14 19:20:13,414 INFO L273 TraceCheckUtils]: 24: Hoare triple {611#false} assume !(~x~0 % 4294967296 < 268435455); {611#false} is VALID [2018-11-14 19:20:13,414 INFO L256 TraceCheckUtils]: 25: Hoare triple {611#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {611#false} is VALID [2018-11-14 19:20:13,415 INFO L273 TraceCheckUtils]: 26: Hoare triple {611#false} ~cond := #in~cond; {611#false} is VALID [2018-11-14 19:20:13,415 INFO L273 TraceCheckUtils]: 27: Hoare triple {611#false} assume ~cond == 0; {611#false} is VALID [2018-11-14 19:20:13,415 INFO L273 TraceCheckUtils]: 28: Hoare triple {611#false} assume !false; {611#false} is VALID [2018-11-14 19:20:13,417 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-14 19:20:13,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:20:13,418 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-14 19:20:13,432 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 19:20:13,454 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 19:20:13,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:20:13,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:13,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:20:13,578 INFO L256 TraceCheckUtils]: 0: Hoare triple {610#true} call ULTIMATE.init(); {610#true} is VALID [2018-11-14 19:20:13,579 INFO L273 TraceCheckUtils]: 1: Hoare triple {610#true} assume true; {610#true} is VALID [2018-11-14 19:20:13,579 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {610#true} {610#true} #46#return; {610#true} is VALID [2018-11-14 19:20:13,579 INFO L256 TraceCheckUtils]: 3: Hoare triple {610#true} call #t~ret2 := main(); {610#true} is VALID [2018-11-14 19:20:13,583 INFO L273 TraceCheckUtils]: 4: Hoare triple {610#true} ~x~0 := 0;~y~0 := 0; {630#(= main_~x~0 0)} is VALID [2018-11-14 19:20:13,584 INFO L273 TraceCheckUtils]: 5: Hoare triple {630#(= main_~x~0 0)} assume true; {630#(= main_~x~0 0)} is VALID [2018-11-14 19:20:13,587 INFO L273 TraceCheckUtils]: 6: Hoare triple {630#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {630#(= main_~x~0 0)} is VALID [2018-11-14 19:20:13,587 INFO L273 TraceCheckUtils]: 7: Hoare triple {630#(= main_~x~0 0)} assume true; {630#(= main_~x~0 0)} is VALID [2018-11-14 19:20:13,589 INFO L273 TraceCheckUtils]: 8: Hoare triple {630#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {630#(= main_~x~0 0)} is VALID [2018-11-14 19:20:13,589 INFO L273 TraceCheckUtils]: 9: Hoare triple {630#(= main_~x~0 0)} assume true; {630#(= main_~x~0 0)} is VALID [2018-11-14 19:20:13,590 INFO L273 TraceCheckUtils]: 10: Hoare triple {630#(= main_~x~0 0)} assume !!(~y~0 % 4294967296 < 10);#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {630#(= main_~x~0 0)} is VALID [2018-11-14 19:20:13,591 INFO L273 TraceCheckUtils]: 11: Hoare triple {630#(= main_~x~0 0)} assume true; {630#(= main_~x~0 0)} is VALID [2018-11-14 19:20:13,591 INFO L273 TraceCheckUtils]: 12: Hoare triple {630#(= main_~x~0 0)} assume !(~y~0 % 4294967296 < 10); {630#(= main_~x~0 0)} is VALID [2018-11-14 19:20:13,592 INFO L273 TraceCheckUtils]: 13: Hoare triple {630#(= main_~x~0 0)} #t~post1 := ~x~0;~x~0 := #t~post1 + 1;havoc #t~post1; {658#(= main_~x~0 1)} is VALID [2018-11-14 19:20:13,593 INFO L273 TraceCheckUtils]: 14: Hoare triple {658#(= main_~x~0 1)} assume true; {658#(= main_~x~0 1)} is VALID [2018-11-14 19:20:13,594 INFO L273 TraceCheckUtils]: 15: Hoare triple {658#(= main_~x~0 1)} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {658#(= main_~x~0 1)} is VALID [2018-11-14 19:20:13,594 INFO L273 TraceCheckUtils]: 16: Hoare triple {658#(= main_~x~0 1)} assume true; {658#(= main_~x~0 1)} is VALID [2018-11-14 19:20:13,595 INFO L273 TraceCheckUtils]: 17: Hoare triple {658#(= main_~x~0 1)} assume !!(~y~0 % 4294967296 < 10);#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {658#(= main_~x~0 1)} is VALID [2018-11-14 19:20:13,596 INFO L273 TraceCheckUtils]: 18: Hoare triple {658#(= main_~x~0 1)} assume true; {658#(= main_~x~0 1)} is VALID [2018-11-14 19:20:13,613 INFO L273 TraceCheckUtils]: 19: Hoare triple {658#(= main_~x~0 1)} assume !!(~y~0 % 4294967296 < 10);#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {658#(= main_~x~0 1)} is VALID [2018-11-14 19:20:13,614 INFO L273 TraceCheckUtils]: 20: Hoare triple {658#(= main_~x~0 1)} assume true; {658#(= main_~x~0 1)} is VALID [2018-11-14 19:20:13,615 INFO L273 TraceCheckUtils]: 21: Hoare triple {658#(= main_~x~0 1)} assume !(~y~0 % 4294967296 < 10); {658#(= main_~x~0 1)} is VALID [2018-11-14 19:20:13,617 INFO L273 TraceCheckUtils]: 22: Hoare triple {658#(= main_~x~0 1)} #t~post1 := ~x~0;~x~0 := #t~post1 + 1;havoc #t~post1; {686#(= main_~x~0 2)} is VALID [2018-11-14 19:20:13,618 INFO L273 TraceCheckUtils]: 23: Hoare triple {686#(= main_~x~0 2)} assume true; {686#(= main_~x~0 2)} is VALID [2018-11-14 19:20:13,619 INFO L273 TraceCheckUtils]: 24: Hoare triple {686#(= main_~x~0 2)} assume !(~x~0 % 4294967296 < 268435455); {611#false} is VALID [2018-11-14 19:20:13,619 INFO L256 TraceCheckUtils]: 25: Hoare triple {611#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {611#false} is VALID [2018-11-14 19:20:13,620 INFO L273 TraceCheckUtils]: 26: Hoare triple {611#false} ~cond := #in~cond; {611#false} is VALID [2018-11-14 19:20:13,620 INFO L273 TraceCheckUtils]: 27: Hoare triple {611#false} assume ~cond == 0; {611#false} is VALID [2018-11-14 19:20:13,620 INFO L273 TraceCheckUtils]: 28: Hoare triple {611#false} assume !false; {611#false} is VALID [2018-11-14 19:20:13,622 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-14 19:20:13,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:20:13,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-14 19:20:13,649 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-11-14 19:20:13,649 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:20:13,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 19:20:13,750 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:20:13,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 19:20:13,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 19:20:13,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-14 19:20:13,751 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 8 states. [2018-11-14 19:20:14,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:14,542 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2018-11-14 19:20:14,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-14 19:20:14,542 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-11-14 19:20:14,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:20:14,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 19:20:14,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 74 transitions. [2018-11-14 19:20:14,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 19:20:14,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 74 transitions. [2018-11-14 19:20:14,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 74 transitions. [2018-11-14 19:20:14,712 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:20:14,715 INFO L225 Difference]: With dead ends: 71 [2018-11-14 19:20:14,716 INFO L226 Difference]: Without dead ends: 54 [2018-11-14 19:20:14,716 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2018-11-14 19:20:14,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-14 19:20:14,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2018-11-14 19:20:14,833 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:20:14,834 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 45 states. [2018-11-14 19:20:14,834 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 45 states. [2018-11-14 19:20:14,834 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 45 states. [2018-11-14 19:20:14,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:14,838 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-11-14 19:20:14,838 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-14 19:20:14,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:14,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:14,839 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 54 states. [2018-11-14 19:20:14,839 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 54 states. [2018-11-14 19:20:14,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:14,843 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-11-14 19:20:14,843 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-14 19:20:14,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:14,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:14,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:20:14,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:20:14,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-14 19:20:14,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-11-14 19:20:14,847 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 29 [2018-11-14 19:20:14,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:20:14,847 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-11-14 19:20:14,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 19:20:14,847 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-11-14 19:20:14,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-14 19:20:14,849 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:20:14,849 INFO L375 BasicCegarLoop]: trace histogram [12, 9, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:20:14,849 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:20:14,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:20:14,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1068904040, now seen corresponding path program 3 times [2018-11-14 19:20:14,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:20:14,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:20:14,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:14,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:20:14,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:14,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:15,455 INFO L256 TraceCheckUtils]: 0: Hoare triple {1002#true} call ULTIMATE.init(); {1002#true} is VALID [2018-11-14 19:20:15,456 INFO L273 TraceCheckUtils]: 1: Hoare triple {1002#true} assume true; {1002#true} is VALID [2018-11-14 19:20:15,456 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1002#true} {1002#true} #46#return; {1002#true} is VALID [2018-11-14 19:20:15,457 INFO L256 TraceCheckUtils]: 3: Hoare triple {1002#true} call #t~ret2 := main(); {1002#true} is VALID [2018-11-14 19:20:15,457 INFO L273 TraceCheckUtils]: 4: Hoare triple {1002#true} ~x~0 := 0;~y~0 := 0; {1002#true} is VALID [2018-11-14 19:20:15,457 INFO L273 TraceCheckUtils]: 5: Hoare triple {1002#true} assume true; {1002#true} is VALID [2018-11-14 19:20:15,458 INFO L273 TraceCheckUtils]: 6: Hoare triple {1002#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1004#(and (<= 0 main_~y~0) (<= main_~y~0 0))} is VALID [2018-11-14 19:20:15,458 INFO L273 TraceCheckUtils]: 7: Hoare triple {1004#(and (<= 0 main_~y~0) (<= main_~y~0 0))} assume true; {1004#(and (<= 0 main_~y~0) (<= main_~y~0 0))} is VALID [2018-11-14 19:20:15,459 INFO L273 TraceCheckUtils]: 8: Hoare triple {1004#(and (<= 0 main_~y~0) (<= main_~y~0 0))} assume !!(~y~0 % 4294967296 < 10);#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1005#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2018-11-14 19:20:15,460 INFO L273 TraceCheckUtils]: 9: Hoare triple {1005#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume true; {1005#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2018-11-14 19:20:15,461 INFO L273 TraceCheckUtils]: 10: Hoare triple {1005#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 < 10);#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1006#(and (<= main_~y~0 2) (<= 2 main_~y~0))} is VALID [2018-11-14 19:20:15,462 INFO L273 TraceCheckUtils]: 11: Hoare triple {1006#(and (<= main_~y~0 2) (<= 2 main_~y~0))} assume true; {1006#(and (<= main_~y~0 2) (<= 2 main_~y~0))} is VALID [2018-11-14 19:20:15,464 INFO L273 TraceCheckUtils]: 12: Hoare triple {1006#(and (<= main_~y~0 2) (<= 2 main_~y~0))} assume !!(~y~0 % 4294967296 < 10);#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1007#(and (< 0 (+ (div main_~y~0 4294967296) 1)) (<= main_~y~0 3))} is VALID [2018-11-14 19:20:15,464 INFO L273 TraceCheckUtils]: 13: Hoare triple {1007#(and (< 0 (+ (div main_~y~0 4294967296) 1)) (<= main_~y~0 3))} assume true; {1007#(and (< 0 (+ (div main_~y~0 4294967296) 1)) (<= main_~y~0 3))} is VALID [2018-11-14 19:20:15,466 INFO L273 TraceCheckUtils]: 14: Hoare triple {1007#(and (< 0 (+ (div main_~y~0 4294967296) 1)) (<= main_~y~0 3))} assume !(~y~0 % 4294967296 < 10); {1003#false} is VALID [2018-11-14 19:20:15,466 INFO L273 TraceCheckUtils]: 15: Hoare triple {1003#false} #t~post1 := ~x~0;~x~0 := #t~post1 + 1;havoc #t~post1; {1003#false} is VALID [2018-11-14 19:20:15,466 INFO L273 TraceCheckUtils]: 16: Hoare triple {1003#false} assume true; {1003#false} is VALID [2018-11-14 19:20:15,467 INFO L273 TraceCheckUtils]: 17: Hoare triple {1003#false} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1003#false} is VALID [2018-11-14 19:20:15,467 INFO L273 TraceCheckUtils]: 18: Hoare triple {1003#false} assume true; {1003#false} is VALID [2018-11-14 19:20:15,467 INFO L273 TraceCheckUtils]: 19: Hoare triple {1003#false} assume !!(~y~0 % 4294967296 < 10);#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1003#false} is VALID [2018-11-14 19:20:15,468 INFO L273 TraceCheckUtils]: 20: Hoare triple {1003#false} assume true; {1003#false} is VALID [2018-11-14 19:20:15,468 INFO L273 TraceCheckUtils]: 21: Hoare triple {1003#false} assume !!(~y~0 % 4294967296 < 10);#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1003#false} is VALID [2018-11-14 19:20:15,469 INFO L273 TraceCheckUtils]: 22: Hoare triple {1003#false} assume true; {1003#false} is VALID [2018-11-14 19:20:15,469 INFO L273 TraceCheckUtils]: 23: Hoare triple {1003#false} assume !!(~y~0 % 4294967296 < 10);#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1003#false} is VALID [2018-11-14 19:20:15,470 INFO L273 TraceCheckUtils]: 24: Hoare triple {1003#false} assume true; {1003#false} is VALID [2018-11-14 19:20:15,470 INFO L273 TraceCheckUtils]: 25: Hoare triple {1003#false} assume !(~y~0 % 4294967296 < 10); {1003#false} is VALID [2018-11-14 19:20:15,470 INFO L273 TraceCheckUtils]: 26: Hoare triple {1003#false} #t~post1 := ~x~0;~x~0 := #t~post1 + 1;havoc #t~post1; {1003#false} is VALID [2018-11-14 19:20:15,470 INFO L273 TraceCheckUtils]: 27: Hoare triple {1003#false} assume true; {1003#false} is VALID [2018-11-14 19:20:15,471 INFO L273 TraceCheckUtils]: 28: Hoare triple {1003#false} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1003#false} is VALID [2018-11-14 19:20:15,471 INFO L273 TraceCheckUtils]: 29: Hoare triple {1003#false} assume true; {1003#false} is VALID [2018-11-14 19:20:15,471 INFO L273 TraceCheckUtils]: 30: Hoare triple {1003#false} assume !!(~y~0 % 4294967296 < 10);#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1003#false} is VALID [2018-11-14 19:20:15,472 INFO L273 TraceCheckUtils]: 31: Hoare triple {1003#false} assume true; {1003#false} is VALID [2018-11-14 19:20:15,472 INFO L273 TraceCheckUtils]: 32: Hoare triple {1003#false} assume !!(~y~0 % 4294967296 < 10);#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1003#false} is VALID [2018-11-14 19:20:15,472 INFO L273 TraceCheckUtils]: 33: Hoare triple {1003#false} assume true; {1003#false} is VALID [2018-11-14 19:20:15,472 INFO L273 TraceCheckUtils]: 34: Hoare triple {1003#false} assume !!(~y~0 % 4294967296 < 10);#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1003#false} is VALID [2018-11-14 19:20:15,472 INFO L273 TraceCheckUtils]: 35: Hoare triple {1003#false} assume true; {1003#false} is VALID [2018-11-14 19:20:15,473 INFO L273 TraceCheckUtils]: 36: Hoare triple {1003#false} assume !(~y~0 % 4294967296 < 10); {1003#false} is VALID [2018-11-14 19:20:15,473 INFO L273 TraceCheckUtils]: 37: Hoare triple {1003#false} #t~post1 := ~x~0;~x~0 := #t~post1 + 1;havoc #t~post1; {1003#false} is VALID [2018-11-14 19:20:15,473 INFO L273 TraceCheckUtils]: 38: Hoare triple {1003#false} assume true; {1003#false} is VALID [2018-11-14 19:20:15,473 INFO L273 TraceCheckUtils]: 39: Hoare triple {1003#false} assume !(~x~0 % 4294967296 < 268435455); {1003#false} is VALID [2018-11-14 19:20:15,473 INFO L256 TraceCheckUtils]: 40: Hoare triple {1003#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1003#false} is VALID [2018-11-14 19:20:15,474 INFO L273 TraceCheckUtils]: 41: Hoare triple {1003#false} ~cond := #in~cond; {1003#false} is VALID [2018-11-14 19:20:15,474 INFO L273 TraceCheckUtils]: 42: Hoare triple {1003#false} assume ~cond == 0; {1003#false} is VALID [2018-11-14 19:20:15,474 INFO L273 TraceCheckUtils]: 43: Hoare triple {1003#false} assume !false; {1003#false} is VALID [2018-11-14 19:20:15,478 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 70 proven. 12 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-14 19:20:15,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:20:15,478 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-14 19:20:15,494 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 19:20:15,525 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-14 19:20:15,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:20:15,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:15,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:20:18,445 WARN L832 $PredicateComparison]: unable to prove that (or (exists ((v_main_~x~0_BEFORE_CALL_1 Int)) (let ((.cse0 (mod v_main_~x~0_BEFORE_CALL_1 2))) (and (<= 268435455 (mod v_main_~x~0_BEFORE_CALL_1 4294967296)) (= .cse0 |c___VERIFIER_assert_#in~cond|) (= .cse0 0) (< (mod (+ v_main_~x~0_BEFORE_CALL_1 4294967295) 4294967296) 268435455) (<= .cse0 2147483647)))) (exists ((v_prenex_5 Int)) (let ((.cse3 (mod v_prenex_5 2))) (let ((.cse1 (mod (+ .cse3 4294967294) 4294967296)) (.cse2 (mod v_prenex_5 4294967296))) (and (<= .cse1 2147483647) (<= 268435455 .cse2) (= |c___VERIFIER_assert_#in~cond| .cse1) (< .cse2 0) (< (mod (+ v_prenex_5 4294967295) 4294967296) 268435455) (not (= .cse3 0)))))) (exists ((v_prenex_4 Int)) (let ((.cse5 (mod v_prenex_4 4294967296)) (.cse4 (mod v_prenex_4 2))) (and (< 2147483647 .cse4) (<= 0 .cse5) (<= 268435455 .cse5) (= (+ |c___VERIFIER_assert_#in~cond| 4294967296) .cse4) (< (mod (+ v_prenex_4 4294967295) 4294967296) 268435455)))) (exists ((v_prenex_3 Int)) (let ((.cse8 (mod v_prenex_3 2))) (let ((.cse7 (mod v_prenex_3 4294967296)) (.cse6 (mod (+ .cse8 4294967294) 4294967296))) (and (= (+ |c___VERIFIER_assert_#in~cond| 4294967296) .cse6) (<= 268435455 .cse7) (< .cse7 0) (< 2147483647 .cse6) (< (mod (+ v_prenex_3 4294967295) 4294967296) 268435455) (not (= .cse8 0)))))) (exists ((v_prenex_1 Int)) (let ((.cse9 (mod v_prenex_1 2))) (and (<= 268435455 (mod v_prenex_1 4294967296)) (< 2147483647 .cse9) (= .cse9 0) (< (mod (+ v_prenex_1 4294967295) 4294967296) 268435455) (= (+ |c___VERIFIER_assert_#in~cond| 4294967296) .cse9)))) (exists ((v_prenex_2 Int)) (let ((.cse10 (mod v_prenex_2 4294967296)) (.cse11 (mod v_prenex_2 2))) (and (<= 0 .cse10) (< (mod (+ v_prenex_2 4294967295) 4294967296) 268435455) (<= .cse11 2147483647) (<= 268435455 .cse10) (= .cse11 |c___VERIFIER_assert_#in~cond|))))) is different from false [2018-11-14 19:20:29,358 WARN L179 SmtUtils]: Spent 6.43 s on a formula simplification. DAG size of input: 90 DAG size of output: 19 [2018-11-14 19:20:31,441 INFO L256 TraceCheckUtils]: 0: Hoare triple {1002#true} call ULTIMATE.init(); {1002#true} is VALID [2018-11-14 19:20:31,442 INFO L273 TraceCheckUtils]: 1: Hoare triple {1002#true} assume true; {1002#true} is VALID [2018-11-14 19:20:31,442 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1002#true} {1002#true} #46#return; {1002#true} is VALID [2018-11-14 19:20:31,442 INFO L256 TraceCheckUtils]: 3: Hoare triple {1002#true} call #t~ret2 := main(); {1002#true} is VALID [2018-11-14 19:20:31,442 INFO L273 TraceCheckUtils]: 4: Hoare triple {1002#true} ~x~0 := 0;~y~0 := 0; {1002#true} is VALID [2018-11-14 19:20:31,443 INFO L273 TraceCheckUtils]: 5: Hoare triple {1002#true} assume true; {1002#true} is VALID [2018-11-14 19:20:31,443 INFO L273 TraceCheckUtils]: 6: Hoare triple {1002#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1002#true} is VALID [2018-11-14 19:20:31,443 INFO L273 TraceCheckUtils]: 7: Hoare triple {1002#true} assume true; {1002#true} is VALID [2018-11-14 19:20:31,443 INFO L273 TraceCheckUtils]: 8: Hoare triple {1002#true} assume !!(~y~0 % 4294967296 < 10);#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1002#true} is VALID [2018-11-14 19:20:31,444 INFO L273 TraceCheckUtils]: 9: Hoare triple {1002#true} assume true; {1002#true} is VALID [2018-11-14 19:20:31,444 INFO L273 TraceCheckUtils]: 10: Hoare triple {1002#true} assume !!(~y~0 % 4294967296 < 10);#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1002#true} is VALID [2018-11-14 19:20:31,444 INFO L273 TraceCheckUtils]: 11: Hoare triple {1002#true} assume true; {1002#true} is VALID [2018-11-14 19:20:31,444 INFO L273 TraceCheckUtils]: 12: Hoare triple {1002#true} assume !!(~y~0 % 4294967296 < 10);#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1002#true} is VALID [2018-11-14 19:20:31,444 INFO L273 TraceCheckUtils]: 13: Hoare triple {1002#true} assume true; {1002#true} is VALID [2018-11-14 19:20:31,445 INFO L273 TraceCheckUtils]: 14: Hoare triple {1002#true} assume !(~y~0 % 4294967296 < 10); {1002#true} is VALID [2018-11-14 19:20:31,445 INFO L273 TraceCheckUtils]: 15: Hoare triple {1002#true} #t~post1 := ~x~0;~x~0 := #t~post1 + 1;havoc #t~post1; {1002#true} is VALID [2018-11-14 19:20:31,445 INFO L273 TraceCheckUtils]: 16: Hoare triple {1002#true} assume true; {1002#true} is VALID [2018-11-14 19:20:31,445 INFO L273 TraceCheckUtils]: 17: Hoare triple {1002#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1002#true} is VALID [2018-11-14 19:20:31,446 INFO L273 TraceCheckUtils]: 18: Hoare triple {1002#true} assume true; {1002#true} is VALID [2018-11-14 19:20:31,446 INFO L273 TraceCheckUtils]: 19: Hoare triple {1002#true} assume !!(~y~0 % 4294967296 < 10);#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1002#true} is VALID [2018-11-14 19:20:31,446 INFO L273 TraceCheckUtils]: 20: Hoare triple {1002#true} assume true; {1002#true} is VALID [2018-11-14 19:20:31,446 INFO L273 TraceCheckUtils]: 21: Hoare triple {1002#true} assume !!(~y~0 % 4294967296 < 10);#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1002#true} is VALID [2018-11-14 19:20:31,447 INFO L273 TraceCheckUtils]: 22: Hoare triple {1002#true} assume true; {1002#true} is VALID [2018-11-14 19:20:31,447 INFO L273 TraceCheckUtils]: 23: Hoare triple {1002#true} assume !!(~y~0 % 4294967296 < 10);#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1002#true} is VALID [2018-11-14 19:20:31,447 INFO L273 TraceCheckUtils]: 24: Hoare triple {1002#true} assume true; {1002#true} is VALID [2018-11-14 19:20:31,447 INFO L273 TraceCheckUtils]: 25: Hoare triple {1002#true} assume !(~y~0 % 4294967296 < 10); {1002#true} is VALID [2018-11-14 19:20:31,447 INFO L273 TraceCheckUtils]: 26: Hoare triple {1002#true} #t~post1 := ~x~0;~x~0 := #t~post1 + 1;havoc #t~post1; {1002#true} is VALID [2018-11-14 19:20:31,448 INFO L273 TraceCheckUtils]: 27: Hoare triple {1002#true} assume true; {1002#true} is VALID [2018-11-14 19:20:31,454 INFO L273 TraceCheckUtils]: 28: Hoare triple {1002#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1095#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2018-11-14 19:20:31,454 INFO L273 TraceCheckUtils]: 29: Hoare triple {1095#(< (mod main_~x~0 4294967296) 268435455)} assume true; {1095#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2018-11-14 19:20:31,471 INFO L273 TraceCheckUtils]: 30: Hoare triple {1095#(< (mod main_~x~0 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1095#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2018-11-14 19:20:31,484 INFO L273 TraceCheckUtils]: 31: Hoare triple {1095#(< (mod main_~x~0 4294967296) 268435455)} assume true; {1095#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2018-11-14 19:20:31,494 INFO L273 TraceCheckUtils]: 32: Hoare triple {1095#(< (mod main_~x~0 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1095#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2018-11-14 19:20:31,495 INFO L273 TraceCheckUtils]: 33: Hoare triple {1095#(< (mod main_~x~0 4294967296) 268435455)} assume true; {1095#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2018-11-14 19:20:31,495 INFO L273 TraceCheckUtils]: 34: Hoare triple {1095#(< (mod main_~x~0 4294967296) 268435455)} assume !!(~y~0 % 4294967296 < 10);#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1095#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2018-11-14 19:20:31,496 INFO L273 TraceCheckUtils]: 35: Hoare triple {1095#(< (mod main_~x~0 4294967296) 268435455)} assume true; {1095#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2018-11-14 19:20:31,496 INFO L273 TraceCheckUtils]: 36: Hoare triple {1095#(< (mod main_~x~0 4294967296) 268435455)} assume !(~y~0 % 4294967296 < 10); {1095#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2018-11-14 19:20:31,497 INFO L273 TraceCheckUtils]: 37: Hoare triple {1095#(< (mod main_~x~0 4294967296) 268435455)} #t~post1 := ~x~0;~x~0 := #t~post1 + 1;havoc #t~post1; {1123#(< (mod (+ main_~x~0 4294967295) 4294967296) 268435455)} is VALID [2018-11-14 19:20:31,498 INFO L273 TraceCheckUtils]: 38: Hoare triple {1123#(< (mod (+ main_~x~0 4294967295) 4294967296) 268435455)} assume true; {1123#(< (mod (+ main_~x~0 4294967295) 4294967296) 268435455)} is VALID [2018-11-14 19:20:31,499 INFO L273 TraceCheckUtils]: 39: Hoare triple {1123#(< (mod (+ main_~x~0 4294967295) 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {1130#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455) (<= 268435455 (mod main_~x~0 4294967296)))} is VALID [2018-11-14 19:20:31,505 INFO L256 TraceCheckUtils]: 40: Hoare triple {1130#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455) (<= 268435455 (mod main_~x~0 4294967296)))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1134#(or (exists ((v_main_~x~0_BEFORE_CALL_1 Int)) (and (<= 268435455 (mod v_main_~x~0_BEFORE_CALL_1 4294967296)) (= (mod v_main_~x~0_BEFORE_CALL_1 2) |__VERIFIER_assert_#in~cond|) (= (mod v_main_~x~0_BEFORE_CALL_1 2) 0) (< (mod (+ v_main_~x~0_BEFORE_CALL_1 4294967295) 4294967296) 268435455) (<= (mod v_main_~x~0_BEFORE_CALL_1 2) 2147483647))) (exists ((v_prenex_5 Int)) (and (<= (mod (+ (mod v_prenex_5 2) 4294967294) 4294967296) 2147483647) (<= 268435455 (mod v_prenex_5 4294967296)) (= |__VERIFIER_assert_#in~cond| (mod (+ (mod v_prenex_5 2) 4294967294) 4294967296)) (< (mod v_prenex_5 4294967296) 0) (< (mod (+ v_prenex_5 4294967295) 4294967296) 268435455) (not (= (mod v_prenex_5 2) 0)))) (exists ((v_prenex_4 Int)) (and (< 2147483647 (mod v_prenex_4 2)) (<= 0 (mod v_prenex_4 4294967296)) (<= 268435455 (mod v_prenex_4 4294967296)) (= (+ |__VERIFIER_assert_#in~cond| 4294967296) (mod v_prenex_4 2)) (< (mod (+ v_prenex_4 4294967295) 4294967296) 268435455))) (exists ((v_prenex_3 Int)) (and (= (+ |__VERIFIER_assert_#in~cond| 4294967296) (mod (+ (mod v_prenex_3 2) 4294967294) 4294967296)) (<= 268435455 (mod v_prenex_3 4294967296)) (< (mod v_prenex_3 4294967296) 0) (< 2147483647 (mod (+ (mod v_prenex_3 2) 4294967294) 4294967296)) (< (mod (+ v_prenex_3 4294967295) 4294967296) 268435455) (not (= (mod v_prenex_3 2) 0)))) (exists ((v_prenex_1 Int)) (and (<= 268435455 (mod v_prenex_1 4294967296)) (< 2147483647 (mod v_prenex_1 2)) (= (mod v_prenex_1 2) 0) (< (mod (+ v_prenex_1 4294967295) 4294967296) 268435455) (= (+ |__VERIFIER_assert_#in~cond| 4294967296) (mod v_prenex_1 2)))) (exists ((v_prenex_2 Int)) (and (<= 0 (mod v_prenex_2 4294967296)) (< (mod (+ v_prenex_2 4294967295) 4294967296) 268435455) (<= (mod v_prenex_2 2) 2147483647) (<= 268435455 (mod v_prenex_2 4294967296)) (= (mod v_prenex_2 2) |__VERIFIER_assert_#in~cond|))))} is VALID [2018-11-14 19:20:31,513 INFO L273 TraceCheckUtils]: 41: Hoare triple {1134#(or (exists ((v_main_~x~0_BEFORE_CALL_1 Int)) (and (<= 268435455 (mod v_main_~x~0_BEFORE_CALL_1 4294967296)) (= (mod v_main_~x~0_BEFORE_CALL_1 2) |__VERIFIER_assert_#in~cond|) (= (mod v_main_~x~0_BEFORE_CALL_1 2) 0) (< (mod (+ v_main_~x~0_BEFORE_CALL_1 4294967295) 4294967296) 268435455) (<= (mod v_main_~x~0_BEFORE_CALL_1 2) 2147483647))) (exists ((v_prenex_5 Int)) (and (<= (mod (+ (mod v_prenex_5 2) 4294967294) 4294967296) 2147483647) (<= 268435455 (mod v_prenex_5 4294967296)) (= |__VERIFIER_assert_#in~cond| (mod (+ (mod v_prenex_5 2) 4294967294) 4294967296)) (< (mod v_prenex_5 4294967296) 0) (< (mod (+ v_prenex_5 4294967295) 4294967296) 268435455) (not (= (mod v_prenex_5 2) 0)))) (exists ((v_prenex_4 Int)) (and (< 2147483647 (mod v_prenex_4 2)) (<= 0 (mod v_prenex_4 4294967296)) (<= 268435455 (mod v_prenex_4 4294967296)) (= (+ |__VERIFIER_assert_#in~cond| 4294967296) (mod v_prenex_4 2)) (< (mod (+ v_prenex_4 4294967295) 4294967296) 268435455))) (exists ((v_prenex_3 Int)) (and (= (+ |__VERIFIER_assert_#in~cond| 4294967296) (mod (+ (mod v_prenex_3 2) 4294967294) 4294967296)) (<= 268435455 (mod v_prenex_3 4294967296)) (< (mod v_prenex_3 4294967296) 0) (< 2147483647 (mod (+ (mod v_prenex_3 2) 4294967294) 4294967296)) (< (mod (+ v_prenex_3 4294967295) 4294967296) 268435455) (not (= (mod v_prenex_3 2) 0)))) (exists ((v_prenex_1 Int)) (and (<= 268435455 (mod v_prenex_1 4294967296)) (< 2147483647 (mod v_prenex_1 2)) (= (mod v_prenex_1 2) 0) (< (mod (+ v_prenex_1 4294967295) 4294967296) 268435455) (= (+ |__VERIFIER_assert_#in~cond| 4294967296) (mod v_prenex_1 2)))) (exists ((v_prenex_2 Int)) (and (<= 0 (mod v_prenex_2 4294967296)) (< (mod (+ v_prenex_2 4294967295) 4294967296) 268435455) (<= (mod v_prenex_2 2) 2147483647) (<= 268435455 (mod v_prenex_2 4294967296)) (= (mod v_prenex_2 2) |__VERIFIER_assert_#in~cond|))))} ~cond := #in~cond; {1138#(exists ((v_prenex_2 Int)) (and (= (mod v_prenex_2 2) __VERIFIER_assert_~cond) (<= 0 (mod v_prenex_2 4294967296)) (< (mod (+ v_prenex_2 4294967295) 4294967296) 268435455) (<= (mod v_prenex_2 2) 2147483647) (<= 268435455 (mod v_prenex_2 4294967296))))} is VALID [2018-11-14 19:20:31,516 INFO L273 TraceCheckUtils]: 42: Hoare triple {1138#(exists ((v_prenex_2 Int)) (and (= (mod v_prenex_2 2) __VERIFIER_assert_~cond) (<= 0 (mod v_prenex_2 4294967296)) (< (mod (+ v_prenex_2 4294967295) 4294967296) 268435455) (<= (mod v_prenex_2 2) 2147483647) (<= 268435455 (mod v_prenex_2 4294967296))))} assume ~cond == 0; {1003#false} is VALID [2018-11-14 19:20:31,516 INFO L273 TraceCheckUtils]: 43: Hoare triple {1003#false} assume !false; {1003#false} is VALID [2018-11-14 19:20:31,523 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-14 19:20:31,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:20:31,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2018-11-14 19:20:31,550 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2018-11-14 19:20:31,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:20:31,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 19:20:31,626 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:20:31,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 19:20:31,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 19:20:31,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=69, Unknown=2, NotChecked=16, Total=110 [2018-11-14 19:20:31,627 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 11 states. [2018-11-14 19:20:40,792 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-14 19:20:41,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:41,958 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2018-11-14 19:20:41,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 19:20:41,958 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2018-11-14 19:20:41,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:20:41,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 19:20:41,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 50 transitions. [2018-11-14 19:20:41,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 19:20:41,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 50 transitions. [2018-11-14 19:20:41,964 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 50 transitions. [2018-11-14 19:20:44,131 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 49 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-14 19:20:44,132 INFO L225 Difference]: With dead ends: 79 [2018-11-14 19:20:44,132 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 19:20:44,133 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=86, Invalid=258, Unknown=2, NotChecked=34, Total=380 [2018-11-14 19:20:44,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 19:20:44,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 19:20:44,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:20:44,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 19:20:44,134 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 19:20:44,134 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 19:20:44,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:44,135 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 19:20:44,135 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 19:20:44,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:44,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:44,135 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 19:20:44,135 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 19:20:44,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:44,136 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 19:20:44,136 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 19:20:44,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:44,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:44,136 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:20:44,136 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:20:44,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 19:20:44,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 19:20:44,137 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2018-11-14 19:20:44,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:20:44,137 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 19:20:44,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 19:20:44,137 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 19:20:44,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:44,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 19:20:44,397 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-14 19:20:44,397 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 19:20:44,397 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 19:20:44,398 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 19:20:44,398 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 19:20:44,398 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 19:20:44,398 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 8 19) no Hoare annotation was computed. [2018-11-14 19:20:44,398 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 8 19) no Hoare annotation was computed. [2018-11-14 19:20:44,398 INFO L425 ceAbstractionStarter]: For program point L13-1(lines 13 15) no Hoare annotation was computed. [2018-11-14 19:20:44,398 INFO L425 ceAbstractionStarter]: For program point L11-1(lines 11 17) no Hoare annotation was computed. [2018-11-14 19:20:44,398 INFO L421 ceAbstractionStarter]: At program point L13-3(lines 13 15) the Hoare annotation is: (or (= main_~x~0 0) (and (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455) (< (mod main_~x~0 4294967296) 268435455))) [2018-11-14 19:20:44,398 INFO L425 ceAbstractionStarter]: For program point L13-4(lines 13 15) no Hoare annotation was computed. [2018-11-14 19:20:44,399 INFO L421 ceAbstractionStarter]: At program point L11-3(lines 11 17) the Hoare annotation is: (or (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455) (and (<= 0 main_~y~0) (<= main_~x~0 0) (<= 0 main_~x~0) (<= main_~y~0 0))) [2018-11-14 19:20:44,399 INFO L421 ceAbstractionStarter]: At program point L11-4(lines 11 17) the Hoare annotation is: (and (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455) (<= 268435455 (mod main_~x~0 4294967296))) [2018-11-14 19:20:44,399 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 8 19) the Hoare annotation is: true [2018-11-14 19:20:44,399 INFO L425 ceAbstractionStarter]: For program point L3-2(lines 2 7) no Hoare annotation was computed. [2018-11-14 19:20:44,399 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 2 7) the Hoare annotation is: true [2018-11-14 19:20:44,399 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 2 7) no Hoare annotation was computed. [2018-11-14 19:20:44,399 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2018-11-14 19:20:44,400 INFO L425 ceAbstractionStarter]: For program point L4(line 4) no Hoare annotation was computed. [2018-11-14 19:20:44,400 INFO L425 ceAbstractionStarter]: For program point L3(lines 3 5) no Hoare annotation was computed. [2018-11-14 19:20:44,402 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 19:20:44,402 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-14 19:20:44,403 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 19:20:44,403 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 19:20:44,403 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2018-11-14 19:20:44,403 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-14 19:20:44,403 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-14 19:20:44,403 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 19:20:44,404 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2018-11-14 19:20:44,404 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2018-11-14 19:20:44,404 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 19:20:44,404 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 19:20:44,404 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 19:20:44,404 WARN L170 areAnnotationChecker]: L3-2 has no Hoare annotation [2018-11-14 19:20:44,404 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2018-11-14 19:20:44,404 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2018-11-14 19:20:44,404 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 19:20:44,404 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-14 19:20:44,405 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2018-11-14 19:20:44,405 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2018-11-14 19:20:44,405 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2018-11-14 19:20:44,405 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 19:20:44,405 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 19:20:44,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 07:20:44 BoogieIcfgContainer [2018-11-14 19:20:44,415 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 19:20:44,416 INFO L168 Benchmark]: Toolchain (without parser) took 35582.98 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 744.0 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -221.0 MB). Peak memory consumption was 523.0 MB. Max. memory is 7.1 GB. [2018-11-14 19:20:44,418 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 19:20:44,419 INFO L168 Benchmark]: CACSL2BoogieTranslator took 288.74 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:20:44,420 INFO L168 Benchmark]: Boogie Preprocessor took 43.33 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:20:44,420 INFO L168 Benchmark]: RCFGBuilder took 689.79 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 744.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -789.9 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-14 19:20:44,421 INFO L168 Benchmark]: TraceAbstraction took 34556.59 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 558.4 MB). Peak memory consumption was 558.4 MB. Max. memory is 7.1 GB. [2018-11-14 19:20:44,425 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 288.74 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 43.33 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 689.79 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 744.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -789.9 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 34556.59 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 558.4 MB). Peak memory consumption was 558.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: (x + 4294967295) % 4294967296 < 268435455 || (((0 <= y && x <= 0) && 0 <= x) && y <= 0) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: x == 0 || ((x + 4294967295) % 4294967296 < 268435455 && x % 4294967296 < 268435455) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. SAFE Result, 34.4s OverallTime, 6 OverallIterations, 12 TraceHistogramMax, 15.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 105 SDtfs, 33 SDslu, 243 SDs, 0 SdLazy, 190 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 134 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 14.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=5, 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.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 19 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 14 PreInvPairs, 34 NumberOfFragments, 56 HoareAnnotationTreeSize, 14 FomulaSimplifications, 492 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 462 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 17.6s InterpolantComputationTime, 219 NumberOfCodeBlocks, 191 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 210 ConstructedInterpolants, 2 QuantifiedInterpolants, 25024 SizeOfPredicates, 5 NumberOfNonLiveVariables, 127 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 9 InterpolantComputations, 4 PerfectInterpolantSequences, 329/378 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...