java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf -i ../../../trunk/examples/svcomp/loop-industry-pattern/mod3_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 19:24:19,283 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 19:24:19,286 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 19:24:19,303 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 19:24:19,303 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 19:24:19,304 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 19:24:19,305 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 19:24:19,307 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 19:24:19,309 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 19:24:19,310 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 19:24:19,311 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 19:24:19,311 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 19:24:19,313 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 19:24:19,314 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 19:24:19,315 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 19:24:19,316 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 19:24:19,317 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 19:24:19,319 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 19:24:19,321 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 19:24:19,323 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 19:24:19,324 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 19:24:19,325 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 19:24:19,330 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 19:24:19,331 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 19:24:19,331 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 19:24:19,332 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 19:24:19,333 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 19:24:19,334 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 19:24:19,335 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 19:24:19,338 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 19:24:19,338 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 19:24:19,339 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 19:24:19,340 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 19:24:19,340 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 19:24:19,341 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 19:24:19,344 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 19:24:19,344 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 19:24:19,365 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 19:24:19,365 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 19:24:19,366 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 19:24:19,369 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 19:24:19,370 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 19:24:19,370 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 19:24:19,370 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 19:24:19,371 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 19:24:19,371 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 19:24:19,371 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 19:24:19,371 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 19:24:19,371 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 19:24:19,372 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 19:24:19,373 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 19:24:19,373 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 19:24:19,373 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 19:24:19,373 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 19:24:19,373 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 19:24:19,374 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 19:24:19,374 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 19:24:19,374 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 19:24:19,374 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 19:24:19,374 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 19:24:19,376 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 19:24:19,376 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 19:24:19,376 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 19:24:19,376 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 19:24:19,377 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 19:24:19,377 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 19:24:19,377 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 19:24:19,377 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 19:24:19,457 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 19:24:19,473 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 19:24:19,476 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 19:24:19,478 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 19:24:19,479 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 19:24:19,479 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-industry-pattern/mod3_true-unreach-call.c [2018-11-14 19:24:19,538 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/082debdbd/11616515fc1f428997162c689ceafa00/FLAGf5b4b0d74 [2018-11-14 19:24:19,986 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 19:24:19,987 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/mod3_true-unreach-call.c [2018-11-14 19:24:19,994 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/082debdbd/11616515fc1f428997162c689ceafa00/FLAGf5b4b0d74 [2018-11-14 19:24:20,013 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/082debdbd/11616515fc1f428997162c689ceafa00 [2018-11-14 19:24:20,023 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 19:24:20,025 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 19:24:20,025 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 19:24:20,026 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 19:24:20,030 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 19:24:20,031 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:24:20" (1/1) ... [2018-11-14 19:24:20,034 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5742dfac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:24:20, skipping insertion in model container [2018-11-14 19:24:20,035 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:24:20" (1/1) ... [2018-11-14 19:24:20,046 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 19:24:20,069 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 19:24:20,313 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:24:20,321 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 19:24:20,344 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:24:20,363 INFO L195 MainTranslator]: Completed translation [2018-11-14 19:24:20,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:24:20 WrapperNode [2018-11-14 19:24:20,364 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 19:24:20,365 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 19:24:20,365 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 19:24:20,365 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 19:24:20,381 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:24:20" (1/1) ... [2018-11-14 19:24:20,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:24:20" (1/1) ... [2018-11-14 19:24:20,387 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:24:20" (1/1) ... [2018-11-14 19:24:20,388 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:24:20" (1/1) ... [2018-11-14 19:24:20,394 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:24:20" (1/1) ... [2018-11-14 19:24:20,401 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:24:20" (1/1) ... [2018-11-14 19:24:20,402 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:24:20" (1/1) ... [2018-11-14 19:24:20,406 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 19:24:20,406 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 19:24:20,407 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 19:24:20,407 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 19:24:20,411 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:24:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 19:24:20,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 19:24:20,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 19:24:20,555 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 19:24:20,555 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 19:24:20,555 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 19:24:20,555 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 19:24:20,555 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 19:24:20,558 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 19:24:20,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 19:24:20,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 19:24:21,075 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 19:24:21,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:24:21 BoogieIcfgContainer [2018-11-14 19:24:21,076 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 19:24:21,077 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 19:24:21,077 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 19:24:21,081 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 19:24:21,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 07:24:20" (1/3) ... [2018-11-14 19:24:21,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@136a33e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:24:21, skipping insertion in model container [2018-11-14 19:24:21,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:24:20" (2/3) ... [2018-11-14 19:24:21,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@136a33e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:24:21, skipping insertion in model container [2018-11-14 19:24:21,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:24:21" (3/3) ... [2018-11-14 19:24:21,085 INFO L112 eAbstractionObserver]: Analyzing ICFG mod3_true-unreach-call.c [2018-11-14 19:24:21,096 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 19:24:21,107 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 19:24:21,126 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 19:24:21,165 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 19:24:21,166 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 19:24:21,166 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 19:24:21,167 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 19:24:21,167 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 19:24:21,167 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 19:24:21,167 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 19:24:21,167 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 19:24:21,168 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 19:24:21,198 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-14 19:24:21,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 19:24:21,207 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:24:21,208 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:24:21,210 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:24:21,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:24:21,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1560473904, now seen corresponding path program 1 times [2018-11-14 19:24:21,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:24:21,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:24:21,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:21,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:24:21,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:21,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:24:21,345 INFO L256 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2018-11-14 19:24:21,349 INFO L273 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2018-11-14 19:24:21,350 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #56#return; {27#true} is VALID [2018-11-14 19:24:21,350 INFO L256 TraceCheckUtils]: 3: Hoare triple {27#true} call #t~ret2 := main(); {27#true} is VALID [2018-11-14 19:24:21,350 INFO L273 TraceCheckUtils]: 4: Hoare triple {27#true} havoc ~x~0;~y~0 := 1; {27#true} is VALID [2018-11-14 19:24:21,368 INFO L273 TraceCheckUtils]: 5: Hoare triple {27#true} assume !true; {28#false} is VALID [2018-11-14 19:24:21,369 INFO L273 TraceCheckUtils]: 6: Hoare triple {28#false} assume ~y~0 % 4294967296 == 0; {28#false} is VALID [2018-11-14 19:24:21,370 INFO L256 TraceCheckUtils]: 7: Hoare triple {28#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 3 != 0 then ~x~0 % 4294967296 % 3 - 3 else ~x~0 % 4294967296 % 3) % 4294967296 == 0 then 1 else 0)); {28#false} is VALID [2018-11-14 19:24:21,370 INFO L273 TraceCheckUtils]: 8: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2018-11-14 19:24:21,370 INFO L273 TraceCheckUtils]: 9: Hoare triple {28#false} assume ~cond == 0; {28#false} is VALID [2018-11-14 19:24:21,371 INFO L273 TraceCheckUtils]: 10: Hoare triple {28#false} assume !false; {28#false} is VALID [2018-11-14 19:24:21,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:24:21,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:24:21,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 19:24:21,383 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-14 19:24:21,386 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:24:21,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 19:24:21,441 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:24:21,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 19:24:21,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 19:24:21,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 19:24:21,453 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2018-11-14 19:24:21,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:21,586 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2018-11-14 19:24:21,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 19:24:21,587 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-14 19:24:21,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:24:21,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:24:21,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 45 transitions. [2018-11-14 19:24:21,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:24:21,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 45 transitions. [2018-11-14 19:24:21,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 45 transitions. [2018-11-14 19:24:21,997 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:24:22,011 INFO L225 Difference]: With dead ends: 37 [2018-11-14 19:24:22,011 INFO L226 Difference]: Without dead ends: 17 [2018-11-14 19:24:22,015 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:24:22,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-14 19:24:22,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-14 19:24:22,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:24:22,064 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2018-11-14 19:24:22,065 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-14 19:24:22,065 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-14 19:24:22,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:22,069 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-11-14 19:24:22,070 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2018-11-14 19:24:22,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:22,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:22,071 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-14 19:24:22,071 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-14 19:24:22,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:22,074 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-11-14 19:24:22,075 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2018-11-14 19:24:22,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:22,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:22,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:24:22,076 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:24:22,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 19:24:22,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-11-14 19:24:22,080 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 11 [2018-11-14 19:24:22,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:24:22,081 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-14 19:24:22,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 19:24:22,081 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2018-11-14 19:24:22,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-14 19:24:22,082 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:24:22,082 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:24:22,082 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:24:22,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:24:22,083 INFO L82 PathProgramCache]: Analyzing trace with hash -808267866, now seen corresponding path program 1 times [2018-11-14 19:24:22,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:24:22,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:24:22,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:22,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:24:22,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:22,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:24:22,498 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-11-14 19:24:22,532 INFO L256 TraceCheckUtils]: 0: Hoare triple {135#true} call ULTIMATE.init(); {135#true} is VALID [2018-11-14 19:24:22,533 INFO L273 TraceCheckUtils]: 1: Hoare triple {135#true} assume true; {135#true} is VALID [2018-11-14 19:24:22,533 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {135#true} {135#true} #56#return; {135#true} is VALID [2018-11-14 19:24:22,533 INFO L256 TraceCheckUtils]: 3: Hoare triple {135#true} call #t~ret2 := main(); {135#true} is VALID [2018-11-14 19:24:22,537 INFO L273 TraceCheckUtils]: 4: Hoare triple {135#true} havoc ~x~0;~y~0 := 1; {137#(and (<= (div main_~y~0 4294967296) 0) (<= 1 main_~y~0))} is VALID [2018-11-14 19:24:22,554 INFO L273 TraceCheckUtils]: 5: Hoare triple {137#(and (<= (div main_~y~0 4294967296) 0) (<= 1 main_~y~0))} assume true; {137#(and (<= (div main_~y~0 4294967296) 0) (<= 1 main_~y~0))} is VALID [2018-11-14 19:24:22,555 INFO L273 TraceCheckUtils]: 6: Hoare triple {137#(and (<= (div main_~y~0 4294967296) 0) (<= 1 main_~y~0))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {137#(and (<= (div main_~y~0 4294967296) 0) (<= 1 main_~y~0))} is VALID [2018-11-14 19:24:22,560 INFO L273 TraceCheckUtils]: 7: Hoare triple {137#(and (<= (div main_~y~0 4294967296) 0) (<= 1 main_~y~0))} assume !(#t~nondet0 != 0);havoc #t~nondet0; {137#(and (<= (div main_~y~0 4294967296) 0) (<= 1 main_~y~0))} is VALID [2018-11-14 19:24:22,561 INFO L273 TraceCheckUtils]: 8: Hoare triple {137#(and (<= (div main_~y~0 4294967296) 0) (<= 1 main_~y~0))} assume ~y~0 % 4294967296 == 0; {136#false} is VALID [2018-11-14 19:24:22,562 INFO L256 TraceCheckUtils]: 9: Hoare triple {136#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 3 != 0 then ~x~0 % 4294967296 % 3 - 3 else ~x~0 % 4294967296 % 3) % 4294967296 == 0 then 1 else 0)); {136#false} is VALID [2018-11-14 19:24:22,562 INFO L273 TraceCheckUtils]: 10: Hoare triple {136#false} ~cond := #in~cond; {136#false} is VALID [2018-11-14 19:24:22,562 INFO L273 TraceCheckUtils]: 11: Hoare triple {136#false} assume ~cond == 0; {136#false} is VALID [2018-11-14 19:24:22,563 INFO L273 TraceCheckUtils]: 12: Hoare triple {136#false} assume !false; {136#false} is VALID [2018-11-14 19:24:22,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:24:22,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:24:22,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 19:24:22,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-14 19:24:22,567 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:24:22,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 19:24:22,620 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:24:22,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 19:24:22,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 19:24:22,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 19:24:22,622 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 3 states. [2018-11-14 19:24:22,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:22,876 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2018-11-14 19:24:22,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 19:24:22,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-14 19:24:22,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:24:22,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:24:22,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2018-11-14 19:24:22,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:24:22,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2018-11-14 19:24:22,882 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 35 transitions. [2018-11-14 19:24:22,966 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:24:22,968 INFO L225 Difference]: With dead ends: 29 [2018-11-14 19:24:22,968 INFO L226 Difference]: Without dead ends: 23 [2018-11-14 19:24:22,969 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 19:24:22,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-14 19:24:23,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2018-11-14 19:24:23,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:24:23,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 20 states. [2018-11-14 19:24:23,053 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 20 states. [2018-11-14 19:24:23,053 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 20 states. [2018-11-14 19:24:23,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:23,056 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2018-11-14 19:24:23,056 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2018-11-14 19:24:23,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:23,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:23,062 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 23 states. [2018-11-14 19:24:23,062 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 23 states. [2018-11-14 19:24:23,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:23,066 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2018-11-14 19:24:23,066 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2018-11-14 19:24:23,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:23,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:23,067 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:24:23,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:24:23,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 19:24:23,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-11-14 19:24:23,070 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 13 [2018-11-14 19:24:23,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:24:23,070 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-14 19:24:23,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 19:24:23,071 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2018-11-14 19:24:23,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 19:24:23,071 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:24:23,071 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:24:23,072 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:24:23,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:24:23,072 INFO L82 PathProgramCache]: Analyzing trace with hash -109903733, now seen corresponding path program 1 times [2018-11-14 19:24:23,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:24:23,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:24:23,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:23,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:24:23,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:23,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:24:24,078 WARN L179 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 17 [2018-11-14 19:24:24,141 INFO L256 TraceCheckUtils]: 0: Hoare triple {253#true} call ULTIMATE.init(); {253#true} is VALID [2018-11-14 19:24:24,141 INFO L273 TraceCheckUtils]: 1: Hoare triple {253#true} assume true; {253#true} is VALID [2018-11-14 19:24:24,141 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {253#true} {253#true} #56#return; {253#true} is VALID [2018-11-14 19:24:24,142 INFO L256 TraceCheckUtils]: 3: Hoare triple {253#true} call #t~ret2 := main(); {253#true} is VALID [2018-11-14 19:24:24,142 INFO L273 TraceCheckUtils]: 4: Hoare triple {253#true} havoc ~x~0;~y~0 := 1; {253#true} is VALID [2018-11-14 19:24:24,142 INFO L273 TraceCheckUtils]: 5: Hoare triple {253#true} assume true; {253#true} is VALID [2018-11-14 19:24:24,142 INFO L273 TraceCheckUtils]: 6: Hoare triple {253#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {253#true} is VALID [2018-11-14 19:24:24,143 INFO L273 TraceCheckUtils]: 7: Hoare triple {253#true} assume !!(#t~nondet0 != 0);havoc #t~nondet0; {253#true} is VALID [2018-11-14 19:24:24,578 INFO L273 TraceCheckUtils]: 8: Hoare triple {253#true} assume (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 3 != 0 then ~x~0 % 4294967296 % 3 - 3 else ~x~0 % 4294967296 % 3) % 4294967296 == 1;~x~0 := ~x~0 + 2;~y~0 := 0; {255#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296)) (* (- 3) (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296))) 3))) 4294967296)) (* 4294967296 (div main_~x~0 4294967296)) (* 3 (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296))) 3))))} is VALID [2018-11-14 19:24:24,580 INFO L273 TraceCheckUtils]: 9: Hoare triple {255#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296)) (* (- 3) (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296))) 3))) 4294967296)) (* 4294967296 (div main_~x~0 4294967296)) (* 3 (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296))) 3))))} assume true; {255#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296)) (* (- 3) (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296))) 3))) 4294967296)) (* 4294967296 (div main_~x~0 4294967296)) (* 3 (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296))) 3))))} is VALID [2018-11-14 19:24:24,581 INFO L273 TraceCheckUtils]: 10: Hoare triple {255#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296)) (* (- 3) (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296))) 3))) 4294967296)) (* 4294967296 (div main_~x~0 4294967296)) (* 3 (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296))) 3))))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {255#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296)) (* (- 3) (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296))) 3))) 4294967296)) (* 4294967296 (div main_~x~0 4294967296)) (* 3 (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296))) 3))))} is VALID [2018-11-14 19:24:24,582 INFO L273 TraceCheckUtils]: 11: Hoare triple {255#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296)) (* (- 3) (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296))) 3))) 4294967296)) (* 4294967296 (div main_~x~0 4294967296)) (* 3 (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296))) 3))))} assume !(#t~nondet0 != 0);havoc #t~nondet0; {255#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296)) (* (- 3) (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296))) 3))) 4294967296)) (* 4294967296 (div main_~x~0 4294967296)) (* 3 (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296))) 3))))} is VALID [2018-11-14 19:24:24,583 INFO L273 TraceCheckUtils]: 12: Hoare triple {255#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296)) (* (- 3) (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296))) 3))) 4294967296)) (* 4294967296 (div main_~x~0 4294967296)) (* 3 (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296))) 3))))} assume ~y~0 % 4294967296 == 0; {255#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296)) (* (- 3) (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296))) 3))) 4294967296)) (* 4294967296 (div main_~x~0 4294967296)) (* 3 (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296))) 3))))} is VALID [2018-11-14 19:24:24,603 INFO L256 TraceCheckUtils]: 13: Hoare triple {255#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296)) (* (- 3) (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296))) 3))) 4294967296)) (* 4294967296 (div main_~x~0 4294967296)) (* 3 (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296))) 3))))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 3 != 0 then ~x~0 % 4294967296 % 3 - 3 else ~x~0 % 4294967296 % 3) % 4294967296 == 0 then 1 else 0)); {256#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 19:24:24,604 INFO L273 TraceCheckUtils]: 14: Hoare triple {256#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {257#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-14 19:24:24,605 INFO L273 TraceCheckUtils]: 15: Hoare triple {257#(= __VERIFIER_assert_~cond 1)} assume ~cond == 0; {254#false} is VALID [2018-11-14 19:24:24,605 INFO L273 TraceCheckUtils]: 16: Hoare triple {254#false} assume !false; {254#false} is VALID [2018-11-14 19:24:24,609 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:24:24,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:24:24,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 19:24:24,610 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-14 19:24:24,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:24:24,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 19:24:26,983 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 16 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-14 19:24:26,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 19:24:26,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 19:24:26,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:24:26,984 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 5 states. [2018-11-14 19:24:30,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:30,285 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2018-11-14 19:24:30,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 19:24:30,285 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-14 19:24:30,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:24:30,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:24:30,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2018-11-14 19:24:30,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:24:30,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2018-11-14 19:24:30,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 49 transitions. [2018-11-14 19:24:32,402 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 48 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-14 19:24:32,404 INFO L225 Difference]: With dead ends: 45 [2018-11-14 19:24:32,404 INFO L226 Difference]: Without dead ends: 26 [2018-11-14 19:24:32,405 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:24:32,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-14 19:24:32,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-11-14 19:24:32,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:24:32,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 25 states. [2018-11-14 19:24:32,443 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 25 states. [2018-11-14 19:24:32,443 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 25 states. [2018-11-14 19:24:32,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:32,446 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-14 19:24:32,446 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-14 19:24:32,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:32,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:32,447 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 26 states. [2018-11-14 19:24:32,447 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 26 states. [2018-11-14 19:24:32,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:32,450 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-14 19:24:32,450 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-14 19:24:32,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:32,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:32,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:24:32,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:24:32,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 19:24:32,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-14 19:24:32,453 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 17 [2018-11-14 19:24:32,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:24:32,454 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-14 19:24:32,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 19:24:32,454 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-14 19:24:32,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 19:24:32,455 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:24:32,455 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:24:32,455 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:24:32,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:24:32,456 INFO L82 PathProgramCache]: Analyzing trace with hash 887741156, now seen corresponding path program 1 times [2018-11-14 19:24:32,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:24:32,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:24:32,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:32,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:24:32,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:32,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:24:33,323 INFO L256 TraceCheckUtils]: 0: Hoare triple {408#true} call ULTIMATE.init(); {408#true} is VALID [2018-11-14 19:24:33,323 INFO L273 TraceCheckUtils]: 1: Hoare triple {408#true} assume true; {408#true} is VALID [2018-11-14 19:24:33,324 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {408#true} {408#true} #56#return; {408#true} is VALID [2018-11-14 19:24:33,324 INFO L256 TraceCheckUtils]: 3: Hoare triple {408#true} call #t~ret2 := main(); {408#true} is VALID [2018-11-14 19:24:33,324 INFO L273 TraceCheckUtils]: 4: Hoare triple {408#true} havoc ~x~0;~y~0 := 1; {408#true} is VALID [2018-11-14 19:24:33,325 INFO L273 TraceCheckUtils]: 5: Hoare triple {408#true} assume true; {408#true} is VALID [2018-11-14 19:24:33,325 INFO L273 TraceCheckUtils]: 6: Hoare triple {408#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {408#true} is VALID [2018-11-14 19:24:33,325 INFO L273 TraceCheckUtils]: 7: Hoare triple {408#true} assume !!(#t~nondet0 != 0);havoc #t~nondet0; {408#true} is VALID [2018-11-14 19:24:33,325 INFO L273 TraceCheckUtils]: 8: Hoare triple {408#true} assume !((if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 3 != 0 then ~x~0 % 4294967296 % 3 - 3 else ~x~0 % 4294967296 % 3) % 4294967296 == 1); {408#true} is VALID [2018-11-14 19:24:34,246 INFO L273 TraceCheckUtils]: 9: Hoare triple {408#true} assume (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 3 != 0 then ~x~0 % 4294967296 % 3 - 3 else ~x~0 % 4294967296 % 3) % 4294967296 == 2;~x~0 := ~x~0 + 1;~y~0 := 0; {410#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* 3 (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296))) 3))))} is VALID [2018-11-14 19:24:34,250 INFO L273 TraceCheckUtils]: 10: Hoare triple {410#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* 3 (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296))) 3))))} assume true; {410#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* 3 (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296))) 3))))} is VALID [2018-11-14 19:24:34,251 INFO L273 TraceCheckUtils]: 11: Hoare triple {410#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* 3 (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296))) 3))))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {410#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* 3 (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296))) 3))))} is VALID [2018-11-14 19:24:34,252 INFO L273 TraceCheckUtils]: 12: Hoare triple {410#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* 3 (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296))) 3))))} assume !(#t~nondet0 != 0);havoc #t~nondet0; {410#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* 3 (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296))) 3))))} is VALID [2018-11-14 19:24:34,252 INFO L273 TraceCheckUtils]: 13: Hoare triple {410#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* 3 (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296))) 3))))} assume ~y~0 % 4294967296 == 0; {410#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* 3 (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296))) 3))))} is VALID [2018-11-14 19:24:34,254 INFO L256 TraceCheckUtils]: 14: Hoare triple {410#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* 3 (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296))) 3))))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 3 != 0 then ~x~0 % 4294967296 % 3 - 3 else ~x~0 % 4294967296 % 3) % 4294967296 == 0 then 1 else 0)); {411#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 19:24:34,256 INFO L273 TraceCheckUtils]: 15: Hoare triple {411#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {412#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-14 19:24:34,256 INFO L273 TraceCheckUtils]: 16: Hoare triple {412#(= __VERIFIER_assert_~cond 1)} assume ~cond == 0; {409#false} is VALID [2018-11-14 19:24:34,257 INFO L273 TraceCheckUtils]: 17: Hoare triple {409#false} assume !false; {409#false} is VALID [2018-11-14 19:24:34,258 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:24:34,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:24:34,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 19:24:34,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-14 19:24:34,260 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:24:34,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 19:24:36,393 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 17 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-14 19:24:36,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 19:24:36,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 19:24:36,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:24:36,395 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 5 states. [2018-11-14 19:24:38,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:38,334 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2018-11-14 19:24:38,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 19:24:38,334 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-14 19:24:38,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:24:38,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:24:38,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2018-11-14 19:24:38,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:24:38,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2018-11-14 19:24:38,339 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 43 transitions. [2018-11-14 19:24:41,076 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 42 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-14 19:24:41,077 INFO L225 Difference]: With dead ends: 46 [2018-11-14 19:24:41,077 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 19:24:41,078 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:24:41,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 19:24:41,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 19:24:41,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:24:41,078 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 19:24:41,079 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 19:24:41,079 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 19:24:41,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:41,079 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 19:24:41,079 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 19:24:41,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:41,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:41,080 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 19:24:41,080 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 19:24:41,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:41,081 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 19:24:41,081 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 19:24:41,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:41,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:41,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:24:41,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:24:41,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 19:24:41,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 19:24:41,082 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2018-11-14 19:24:41,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:24:41,082 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 19:24:41,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 19:24:41,083 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 19:24:41,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:41,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 19:24:41,194 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-14 19:24:41,194 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 19:24:41,195 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 19:24:41,195 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 19:24:41,195 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 19:24:41,195 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 19:24:41,195 INFO L421 ceAbstractionStarter]: At program point L31(line 31) the Hoare annotation is: (<= main_~x~0 (let ((.cse2 (div main_~x~0 4294967296))) (let ((.cse0 (* (- 4294967296) .cse2))) (let ((.cse1 (div (+ main_~x~0 .cse0) 3))) (+ (* 4294967296 (div (+ main_~x~0 .cse0 (* (- 3) .cse1)) 4294967296)) (* 4294967296 .cse2) (* 3 .cse1)))))) [2018-11-14 19:24:41,195 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 12 33) no Hoare annotation was computed. [2018-11-14 19:24:41,195 INFO L425 ceAbstractionStarter]: For program point L23(lines 23 26) no Hoare annotation was computed. [2018-11-14 19:24:41,196 INFO L421 ceAbstractionStarter]: At program point L23-2(lines 16 29) the Hoare annotation is: (or (<= main_~x~0 (let ((.cse0 (div main_~x~0 4294967296))) (+ (* 4294967296 .cse0) (* 3 (div (+ main_~x~0 (* (- 4294967296) .cse0)) 3))))) (and (<= (div main_~y~0 4294967296) 0) (<= 1 main_~y~0))) [2018-11-14 19:24:41,196 INFO L425 ceAbstractionStarter]: For program point L17(lines 17 28) no Hoare annotation was computed. [2018-11-14 19:24:41,196 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 12 33) no Hoare annotation was computed. [2018-11-14 19:24:41,196 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 31) no Hoare annotation was computed. [2018-11-14 19:24:41,196 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 12 33) the Hoare annotation is: true [2018-11-14 19:24:41,196 INFO L425 ceAbstractionStarter]: For program point L20(lines 20 27) no Hoare annotation was computed. [2018-11-14 19:24:41,196 INFO L425 ceAbstractionStarter]: For program point L16-1(lines 16 29) no Hoare annotation was computed. [2018-11-14 19:24:41,196 INFO L425 ceAbstractionStarter]: For program point L16-2(lines 16 29) no Hoare annotation was computed. [2018-11-14 19:24:41,197 INFO L425 ceAbstractionStarter]: For program point L16-4(lines 12 33) no Hoare annotation was computed. [2018-11-14 19:24:41,197 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 6 10) the Hoare annotation is: true [2018-11-14 19:24:41,197 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2018-11-14 19:24:41,197 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 6 10) no Hoare annotation was computed. [2018-11-14 19:24:41,197 INFO L425 ceAbstractionStarter]: For program point L8(line 8) no Hoare annotation was computed. [2018-11-14 19:24:41,197 INFO L425 ceAbstractionStarter]: For program point L7(lines 7 8) no Hoare annotation was computed. [2018-11-14 19:24:41,197 INFO L425 ceAbstractionStarter]: For program point L7-2(lines 6 10) no Hoare annotation was computed. [2018-11-14 19:24:41,199 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 19:24:41,201 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2018-11-14 19:24:41,201 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 19:24:41,201 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 19:24:41,201 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2018-11-14 19:24:41,202 WARN L170 areAnnotationChecker]: L16-4 has no Hoare annotation [2018-11-14 19:24:41,202 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2018-11-14 19:24:41,202 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2018-11-14 19:24:41,202 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 19:24:41,202 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2018-11-14 19:24:41,202 WARN L170 areAnnotationChecker]: L16-4 has no Hoare annotation [2018-11-14 19:24:41,202 WARN L170 areAnnotationChecker]: L16-4 has no Hoare annotation [2018-11-14 19:24:41,202 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2018-11-14 19:24:41,203 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2018-11-14 19:24:41,203 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2018-11-14 19:24:41,203 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2018-11-14 19:24:41,203 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2018-11-14 19:24:41,203 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2018-11-14 19:24:41,203 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2018-11-14 19:24:41,203 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-14 19:24:41,204 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-14 19:24:41,204 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-14 19:24:41,204 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 19:24:41,204 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2018-11-14 19:24:41,204 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2018-11-14 19:24:41,204 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 19:24:41,204 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2018-11-14 19:24:41,204 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2018-11-14 19:24:41,205 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 19:24:41,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 07:24:41 BoogieIcfgContainer [2018-11-14 19:24:41,215 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 19:24:41,216 INFO L168 Benchmark]: Toolchain (without parser) took 21192.46 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 725.1 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -554.5 MB). Peak memory consumption was 170.5 MB. Max. memory is 7.1 GB. [2018-11-14 19:24:41,218 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 19:24:41,218 INFO L168 Benchmark]: CACSL2BoogieTranslator took 338.98 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-14 19:24:41,219 INFO L168 Benchmark]: Boogie Preprocessor took 41.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 19:24:41,220 INFO L168 Benchmark]: RCFGBuilder took 669.36 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 725.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -771.6 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2018-11-14 19:24:41,221 INFO L168 Benchmark]: TraceAbstraction took 20138.13 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 206.5 MB). Peak memory consumption was 206.5 MB. Max. memory is 7.1 GB. [2018-11-14 19:24:41,225 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.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 338.98 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 41.19 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 669.36 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 725.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -771.6 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20138.13 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 206.5 MB). Peak memory consumption was 206.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: x <= 4294967296 * (x / 4294967296) + 3 * ((x + -4294967296 * (x / 4294967296)) / 3) || (y / 4294967296 <= 0 && 1 <= y) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. SAFE Result, 20.0s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 11.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 90 SDtfs, 11 SDslu, 115 SDs, 0 SdLazy, 49 SolverSat, 9 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 12 PreInvPairs, 17 NumberOfFragments, 75 HoareAnnotationTreeSize, 12 FomulaSimplifications, 61 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 20 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 59 NumberOfCodeBlocks, 59 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 55 ConstructedInterpolants, 0 QuantifiedInterpolants, 6035 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 6/6 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...