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.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/nested3_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:37:28,277 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:37:28,279 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:37:28,291 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:37:28,292 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:37:28,293 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:37:28,294 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:37:28,297 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:37:28,300 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:37:28,302 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:37:28,303 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:37:28,305 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:37:28,306 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:37:28,307 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:37:28,308 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:37:28,311 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:37:28,312 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:37:28,321 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:37:28,323 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:37:28,325 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:37:28,326 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:37:28,329 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:37:28,333 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:37:28,333 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:37:28,333 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:37:28,334 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:37:28,335 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:37:28,337 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:37:28,339 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:37:28,342 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:37:28,342 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:37:28,342 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:37:28,343 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:37:28,344 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:37:28,344 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:37:28,345 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:37:28,345 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-14 17:37:28,374 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:37:28,375 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:37:28,379 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:37:28,379 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:37:28,380 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:37:28,380 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:37:28,380 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:37:28,381 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:37:28,384 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:37:28,384 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:37:28,384 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:37:28,384 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:37:28,384 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:37:28,385 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:37:28,385 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:37:28,385 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:37:28,385 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:37:28,385 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:37:28,387 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:37:28,387 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:37:28,387 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:37:28,387 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:37:28,387 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:37:28,388 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:37:28,388 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:37:28,388 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:37:28,388 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:37:28,388 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:37:28,389 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:37:28,389 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:37:28,434 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:37:28,448 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:37:28,452 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:37:28,453 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:37:28,454 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:37:28,454 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/nested3_false-unreach-call.c [2018-11-14 17:37:28,516 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6cffc3ed/2ab66eae2e6c4d5898cbb1eafc71efc0/FLAG2d81ded83 [2018-11-14 17:37:28,954 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:37:28,954 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested3_false-unreach-call.c [2018-11-14 17:37:28,962 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6cffc3ed/2ab66eae2e6c4d5898cbb1eafc71efc0/FLAG2d81ded83 [2018-11-14 17:37:28,982 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6cffc3ed/2ab66eae2e6c4d5898cbb1eafc71efc0 [2018-11-14 17:37:28,992 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:37:28,994 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:37:28,995 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:37:28,996 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:37:29,000 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:37:29,001 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:37:28" (1/1) ... [2018-11-14 17:37:29,004 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24b62639 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:37:29, skipping insertion in model container [2018-11-14 17:37:29,005 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:37:28" (1/1) ... [2018-11-14 17:37:29,015 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:37:29,044 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:37:29,311 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:37:29,321 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:37:29,345 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:37:29,366 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:37:29,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:37:29 WrapperNode [2018-11-14 17:37:29,367 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:37:29,368 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:37:29,368 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:37:29,369 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:37:29,387 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:37:29" (1/1) ... [2018-11-14 17:37:29,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:37:29" (1/1) ... [2018-11-14 17:37:29,394 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:37:29" (1/1) ... [2018-11-14 17:37:29,396 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:37:29" (1/1) ... [2018-11-14 17:37:29,407 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:37:29" (1/1) ... [2018-11-14 17:37:29,420 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:37:29" (1/1) ... [2018-11-14 17:37:29,421 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:37:29" (1/1) ... [2018-11-14 17:37:29,423 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:37:29,423 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:37:29,423 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:37:29,424 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:37:29,424 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:37:29" (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 17:37:29,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:37:29,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:37:29,568 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 17:37:29,568 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:37:29,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:37:29,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:37:29,569 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:37:29,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:37:29,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:37:30,092 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:37:30,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:37:30 BoogieIcfgContainer [2018-11-14 17:37:30,093 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:37:30,094 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:37:30,094 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:37:30,097 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:37:30,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:37:28" (1/3) ... [2018-11-14 17:37:30,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c6e1ac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:37:30, skipping insertion in model container [2018-11-14 17:37:30,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:37:29" (2/3) ... [2018-11-14 17:37:30,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c6e1ac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:37:30, skipping insertion in model container [2018-11-14 17:37:30,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:37:30" (3/3) ... [2018-11-14 17:37:30,101 INFO L112 eAbstractionObserver]: Analyzing ICFG nested3_false-unreach-call.c [2018-11-14 17:37:30,111 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:37:30,121 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:37:30,139 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:37:30,175 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:37:30,175 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:37:30,176 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:37:30,176 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:37:30,176 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:37:30,176 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:37:30,176 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:37:30,176 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:37:30,176 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:37:30,198 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2018-11-14 17:37:30,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-14 17:37:30,205 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:37:30,206 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:37:30,208 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:37:30,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:37:30,216 INFO L82 PathProgramCache]: Analyzing trace with hash 17946046, now seen corresponding path program 1 times [2018-11-14 17:37:30,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:37:30,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:37:30,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:30,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:37:30,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:30,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:30,415 INFO L256 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {29#true} is VALID [2018-11-14 17:37:30,419 INFO L273 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2018-11-14 17:37:30,420 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #62#return; {29#true} is VALID [2018-11-14 17:37:30,420 INFO L256 TraceCheckUtils]: 3: Hoare triple {29#true} call #t~ret3 := main(); {29#true} is VALID [2018-11-14 17:37:30,421 INFO L273 TraceCheckUtils]: 4: Hoare triple {29#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {29#true} is VALID [2018-11-14 17:37:30,422 INFO L273 TraceCheckUtils]: 5: Hoare triple {29#true} assume !true; {30#false} is VALID [2018-11-14 17:37:30,422 INFO L256 TraceCheckUtils]: 6: Hoare triple {30#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 == 0 then 1 else 0)); {30#false} is VALID [2018-11-14 17:37:30,422 INFO L273 TraceCheckUtils]: 7: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2018-11-14 17:37:30,423 INFO L273 TraceCheckUtils]: 8: Hoare triple {30#false} assume ~cond == 0; {30#false} is VALID [2018-11-14 17:37:30,423 INFO L273 TraceCheckUtils]: 9: Hoare triple {30#false} assume !false; {30#false} is VALID [2018-11-14 17:37:30,425 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 17:37:30,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:37:30,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:37:30,433 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 17:37:30,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:37:30,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:37:30,501 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 17:37:30,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:37:30,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:37:30,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:37:30,512 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2018-11-14 17:37:30,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:30,727 INFO L93 Difference]: Finished difference Result 47 states and 66 transitions. [2018-11-14 17:37:30,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:37:30,727 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 17:37:30,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:37:30,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:37:30,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 66 transitions. [2018-11-14 17:37:30,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:37:30,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 66 transitions. [2018-11-14 17:37:30,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 66 transitions. [2018-11-14 17:37:31,198 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:31,209 INFO L225 Difference]: With dead ends: 47 [2018-11-14 17:37:31,210 INFO L226 Difference]: Without dead ends: 22 [2018-11-14 17:37:31,213 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 17:37:31,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-14 17:37:31,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-14 17:37:31,257 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:37:31,258 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-14 17:37:31,258 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 17:37:31,259 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 17:37:31,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:31,264 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2018-11-14 17:37:31,264 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2018-11-14 17:37:31,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:31,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:31,265 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 17:37:31,265 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 17:37:31,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:31,270 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2018-11-14 17:37:31,270 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2018-11-14 17:37:31,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:31,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:31,271 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:37:31,271 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:37:31,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 17:37:31,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2018-11-14 17:37:31,276 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 10 [2018-11-14 17:37:31,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:37:31,276 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-11-14 17:37:31,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:37:31,277 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2018-11-14 17:37:31,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 17:37:31,277 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:37:31,278 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:37:31,278 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:37:31,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:37:31,279 INFO L82 PathProgramCache]: Analyzing trace with hash -583657870, now seen corresponding path program 1 times [2018-11-14 17:37:31,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:37:31,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:37:31,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:31,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:37:31,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:31,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:31,508 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 5 [2018-11-14 17:37:31,556 INFO L256 TraceCheckUtils]: 0: Hoare triple {175#true} call ULTIMATE.init(); {175#true} is VALID [2018-11-14 17:37:31,557 INFO L273 TraceCheckUtils]: 1: Hoare triple {175#true} assume true; {175#true} is VALID [2018-11-14 17:37:31,557 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {175#true} {175#true} #62#return; {175#true} is VALID [2018-11-14 17:37:31,557 INFO L256 TraceCheckUtils]: 3: Hoare triple {175#true} call #t~ret3 := main(); {175#true} is VALID [2018-11-14 17:37:31,566 INFO L273 TraceCheckUtils]: 4: Hoare triple {175#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {177#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:37:31,572 INFO L273 TraceCheckUtils]: 5: Hoare triple {177#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {177#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:37:31,589 INFO L273 TraceCheckUtils]: 6: Hoare triple {177#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {176#false} is VALID [2018-11-14 17:37:31,589 INFO L256 TraceCheckUtils]: 7: Hoare triple {176#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 == 0 then 1 else 0)); {176#false} is VALID [2018-11-14 17:37:31,590 INFO L273 TraceCheckUtils]: 8: Hoare triple {176#false} ~cond := #in~cond; {176#false} is VALID [2018-11-14 17:37:31,590 INFO L273 TraceCheckUtils]: 9: Hoare triple {176#false} assume ~cond == 0; {176#false} is VALID [2018-11-14 17:37:31,590 INFO L273 TraceCheckUtils]: 10: Hoare triple {176#false} assume !false; {176#false} is VALID [2018-11-14 17:37:31,591 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 17:37:31,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:37:31,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:37:31,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-14 17:37:31,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:37:31,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:37:31,628 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 17:37:31,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:37:31,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:37:31,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:37:31,629 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 3 states. [2018-11-14 17:37:31,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:31,847 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2018-11-14 17:37:31,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:37:31,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-14 17:37:31,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:37:31,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:37:31,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2018-11-14 17:37:31,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:37:31,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2018-11-14 17:37:31,855 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 47 transitions. [2018-11-14 17:37:32,237 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:32,240 INFO L225 Difference]: With dead ends: 39 [2018-11-14 17:37:32,241 INFO L226 Difference]: Without dead ends: 32 [2018-11-14 17:37:32,242 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 17:37:32,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-14 17:37:32,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2018-11-14 17:37:32,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:37:32,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 24 states. [2018-11-14 17:37:32,264 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 24 states. [2018-11-14 17:37:32,264 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 24 states. [2018-11-14 17:37:32,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:32,269 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2018-11-14 17:37:32,269 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2018-11-14 17:37:32,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:32,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:32,270 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 32 states. [2018-11-14 17:37:32,271 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 32 states. [2018-11-14 17:37:32,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:32,279 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2018-11-14 17:37:32,279 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2018-11-14 17:37:32,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:32,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:32,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:37:32,281 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:37:32,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 17:37:32,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-11-14 17:37:32,287 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 11 [2018-11-14 17:37:32,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:37:32,290 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-14 17:37:32,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:37:32,291 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-14 17:37:32,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-14 17:37:32,292 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:37:32,292 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:37:32,292 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:37:32,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:37:32,294 INFO L82 PathProgramCache]: Analyzing trace with hash 2034978746, now seen corresponding path program 1 times [2018-11-14 17:37:32,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:37:32,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:37:32,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:32,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:37:32,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:32,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:32,553 INFO L256 TraceCheckUtils]: 0: Hoare triple {337#true} call ULTIMATE.init(); {337#true} is VALID [2018-11-14 17:37:32,553 INFO L273 TraceCheckUtils]: 1: Hoare triple {337#true} assume true; {337#true} is VALID [2018-11-14 17:37:32,554 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {337#true} {337#true} #62#return; {337#true} is VALID [2018-11-14 17:37:32,554 INFO L256 TraceCheckUtils]: 3: Hoare triple {337#true} call #t~ret3 := main(); {337#true} is VALID [2018-11-14 17:37:32,555 INFO L273 TraceCheckUtils]: 4: Hoare triple {337#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {337#true} is VALID [2018-11-14 17:37:32,555 INFO L273 TraceCheckUtils]: 5: Hoare triple {337#true} assume true; {337#true} is VALID [2018-11-14 17:37:32,556 INFO L273 TraceCheckUtils]: 6: Hoare triple {337#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {339#(and (<= 0 main_~y~0) (<= main_~y~0 0))} is VALID [2018-11-14 17:37:32,556 INFO L273 TraceCheckUtils]: 7: Hoare triple {339#(and (<= 0 main_~y~0) (<= main_~y~0 0))} assume true; {339#(and (<= 0 main_~y~0) (<= main_~y~0 0))} is VALID [2018-11-14 17:37:32,557 INFO L273 TraceCheckUtils]: 8: Hoare triple {339#(and (<= 0 main_~y~0) (<= main_~y~0 0))} assume !(~y~0 % 4294967296 < 268435455); {338#false} is VALID [2018-11-14 17:37:32,558 INFO L256 TraceCheckUtils]: 9: Hoare triple {338#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 2 != 0 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {338#false} is VALID [2018-11-14 17:37:32,558 INFO L273 TraceCheckUtils]: 10: Hoare triple {338#false} ~cond := #in~cond; {338#false} is VALID [2018-11-14 17:37:32,558 INFO L273 TraceCheckUtils]: 11: Hoare triple {338#false} assume ~cond == 0; {338#false} is VALID [2018-11-14 17:37:32,559 INFO L273 TraceCheckUtils]: 12: Hoare triple {338#false} assume !false; {338#false} is VALID [2018-11-14 17:37:32,561 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 17:37:32,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:37:32,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:37:32,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-14 17:37:32,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:37:32,562 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:37:32,576 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 17:37:32,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:37:32,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:37:32,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:37:32,577 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 3 states. [2018-11-14 17:37:32,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:32,814 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2018-11-14 17:37:32,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:37:32,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-14 17:37:32,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:37:32,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:37:32,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2018-11-14 17:37:32,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:37:32,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2018-11-14 17:37:32,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2018-11-14 17:37:32,943 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:32,945 INFO L225 Difference]: With dead ends: 47 [2018-11-14 17:37:32,945 INFO L226 Difference]: Without dead ends: 30 [2018-11-14 17:37:32,946 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 17:37:32,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-14 17:37:32,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2018-11-14 17:37:32,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:37:32,970 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 26 states. [2018-11-14 17:37:32,970 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 26 states. [2018-11-14 17:37:32,970 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 26 states. [2018-11-14 17:37:32,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:32,974 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2018-11-14 17:37:32,974 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2018-11-14 17:37:32,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:32,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:32,975 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 30 states. [2018-11-14 17:37:32,975 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 30 states. [2018-11-14 17:37:32,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:32,979 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2018-11-14 17:37:32,979 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2018-11-14 17:37:32,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:32,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:32,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:37:32,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:37:32,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 17:37:32,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-11-14 17:37:32,985 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 13 [2018-11-14 17:37:32,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:37:32,985 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-14 17:37:32,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:37:32,986 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-14 17:37:32,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 17:37:32,987 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:37:32,987 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:37:32,987 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:37:32,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:37:32,988 INFO L82 PathProgramCache]: Analyzing trace with hash 2046656706, now seen corresponding path program 1 times [2018-11-14 17:37:32,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:37:32,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:37:32,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:32,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:37:32,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:33,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:33,133 INFO L256 TraceCheckUtils]: 0: Hoare triple {510#true} call ULTIMATE.init(); {510#true} is VALID [2018-11-14 17:37:33,133 INFO L273 TraceCheckUtils]: 1: Hoare triple {510#true} assume true; {510#true} is VALID [2018-11-14 17:37:33,134 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {510#true} {510#true} #62#return; {510#true} is VALID [2018-11-14 17:37:33,134 INFO L256 TraceCheckUtils]: 3: Hoare triple {510#true} call #t~ret3 := main(); {510#true} is VALID [2018-11-14 17:37:33,134 INFO L273 TraceCheckUtils]: 4: Hoare triple {510#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {510#true} is VALID [2018-11-14 17:37:33,135 INFO L273 TraceCheckUtils]: 5: Hoare triple {510#true} assume true; {510#true} is VALID [2018-11-14 17:37:33,135 INFO L273 TraceCheckUtils]: 6: Hoare triple {510#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {510#true} is VALID [2018-11-14 17:37:33,135 INFO L273 TraceCheckUtils]: 7: Hoare triple {510#true} assume true; {510#true} is VALID [2018-11-14 17:37:33,142 INFO L273 TraceCheckUtils]: 8: Hoare triple {510#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {512#(and (<= main_~z~0 0) (< 0 (+ (div main_~z~0 4294967296) 1)))} is VALID [2018-11-14 17:37:33,147 INFO L273 TraceCheckUtils]: 9: Hoare triple {512#(and (<= main_~z~0 0) (< 0 (+ (div main_~z~0 4294967296) 1)))} assume true; {512#(and (<= main_~z~0 0) (< 0 (+ (div main_~z~0 4294967296) 1)))} is VALID [2018-11-14 17:37:33,149 INFO L273 TraceCheckUtils]: 10: Hoare triple {512#(and (<= main_~z~0 0) (< 0 (+ (div main_~z~0 4294967296) 1)))} assume !(~z~0 % 4294967296 < 268435455); {511#false} is VALID [2018-11-14 17:37:33,149 INFO L256 TraceCheckUtils]: 11: Hoare triple {511#false} call __VERIFIER_assert((if (if ~z~0 % 4294967296 < 0 && ~z~0 % 4294967296 % 4 != 0 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 == 0 then 1 else 0)); {511#false} is VALID [2018-11-14 17:37:33,149 INFO L273 TraceCheckUtils]: 12: Hoare triple {511#false} ~cond := #in~cond; {511#false} is VALID [2018-11-14 17:37:33,150 INFO L273 TraceCheckUtils]: 13: Hoare triple {511#false} assume ~cond == 0; {511#false} is VALID [2018-11-14 17:37:33,150 INFO L273 TraceCheckUtils]: 14: Hoare triple {511#false} assume !false; {511#false} is VALID [2018-11-14 17:37:33,151 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 17:37:33,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:37:33,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:37:33,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-14 17:37:33,152 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:37:33,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:37:33,183 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:33,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:37:33,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:37:33,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:37:33,185 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 3 states. [2018-11-14 17:37:33,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:33,316 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-14 17:37:33,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:37:33,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-14 17:37:33,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:37:33,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:37:33,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-14 17:37:33,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:37:33,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-14 17:37:33,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2018-11-14 17:37:33,438 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:33,440 INFO L225 Difference]: With dead ends: 49 [2018-11-14 17:37:33,441 INFO L226 Difference]: Without dead ends: 30 [2018-11-14 17:37:33,441 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 17:37:33,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-14 17:37:33,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-11-14 17:37:33,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:37:33,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 28 states. [2018-11-14 17:37:33,463 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 28 states. [2018-11-14 17:37:33,463 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 28 states. [2018-11-14 17:37:33,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:33,466 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-14 17:37:33,466 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-14 17:37:33,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:33,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:33,468 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 30 states. [2018-11-14 17:37:33,468 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 30 states. [2018-11-14 17:37:33,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:33,471 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-14 17:37:33,471 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-14 17:37:33,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:33,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:33,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:37:33,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:37:33,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 17:37:33,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-14 17:37:33,475 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 15 [2018-11-14 17:37:33,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:37:33,475 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-14 17:37:33,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:37:33,476 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-14 17:37:33,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 17:37:33,477 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:37:33,477 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:37:33,477 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:37:33,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:37:33,478 INFO L82 PathProgramCache]: Analyzing trace with hash 441532680, now seen corresponding path program 1 times [2018-11-14 17:37:33,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:37:33,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:37:33,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:33,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:37:33,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:33,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:33,664 INFO L256 TraceCheckUtils]: 0: Hoare triple {689#true} call ULTIMATE.init(); {689#true} is VALID [2018-11-14 17:37:33,664 INFO L273 TraceCheckUtils]: 1: Hoare triple {689#true} assume true; {689#true} is VALID [2018-11-14 17:37:33,664 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {689#true} {689#true} #62#return; {689#true} is VALID [2018-11-14 17:37:33,665 INFO L256 TraceCheckUtils]: 3: Hoare triple {689#true} call #t~ret3 := main(); {689#true} is VALID [2018-11-14 17:37:33,665 INFO L273 TraceCheckUtils]: 4: Hoare triple {689#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {689#true} is VALID [2018-11-14 17:37:33,666 INFO L273 TraceCheckUtils]: 5: Hoare triple {689#true} assume true; {689#true} is VALID [2018-11-14 17:37:33,666 INFO L273 TraceCheckUtils]: 6: Hoare triple {689#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {689#true} is VALID [2018-11-14 17:37:33,667 INFO L273 TraceCheckUtils]: 7: Hoare triple {689#true} assume true; {689#true} is VALID [2018-11-14 17:37:33,670 INFO L273 TraceCheckUtils]: 8: Hoare triple {689#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {691#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:37:33,671 INFO L273 TraceCheckUtils]: 9: Hoare triple {691#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume true; {691#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:37:33,672 INFO L273 TraceCheckUtils]: 10: Hoare triple {691#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {692#(and (<= main_~z~0 1) (< 0 (+ (div main_~z~0 4294967296) 1)))} is VALID [2018-11-14 17:37:33,672 INFO L273 TraceCheckUtils]: 11: Hoare triple {692#(and (<= main_~z~0 1) (< 0 (+ (div main_~z~0 4294967296) 1)))} assume true; {692#(and (<= main_~z~0 1) (< 0 (+ (div main_~z~0 4294967296) 1)))} is VALID [2018-11-14 17:37:33,676 INFO L273 TraceCheckUtils]: 12: Hoare triple {692#(and (<= main_~z~0 1) (< 0 (+ (div main_~z~0 4294967296) 1)))} assume !(~z~0 % 4294967296 < 268435455); {690#false} is VALID [2018-11-14 17:37:33,676 INFO L256 TraceCheckUtils]: 13: Hoare triple {690#false} call __VERIFIER_assert((if (if ~z~0 % 4294967296 < 0 && ~z~0 % 4294967296 % 4 != 0 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 == 0 then 1 else 0)); {690#false} is VALID [2018-11-14 17:37:33,676 INFO L273 TraceCheckUtils]: 14: Hoare triple {690#false} ~cond := #in~cond; {690#false} is VALID [2018-11-14 17:37:33,677 INFO L273 TraceCheckUtils]: 15: Hoare triple {690#false} assume ~cond == 0; {690#false} is VALID [2018-11-14 17:37:33,677 INFO L273 TraceCheckUtils]: 16: Hoare triple {690#false} assume !false; {690#false} is VALID [2018-11-14 17:37:33,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:37:33,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:37:33,679 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 17:37:33,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:37:33,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:33,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:33,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:37:33,921 INFO L256 TraceCheckUtils]: 0: Hoare triple {689#true} call ULTIMATE.init(); {689#true} is VALID [2018-11-14 17:37:33,921 INFO L273 TraceCheckUtils]: 1: Hoare triple {689#true} assume true; {689#true} is VALID [2018-11-14 17:37:33,922 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {689#true} {689#true} #62#return; {689#true} is VALID [2018-11-14 17:37:33,922 INFO L256 TraceCheckUtils]: 3: Hoare triple {689#true} call #t~ret3 := main(); {689#true} is VALID [2018-11-14 17:37:33,923 INFO L273 TraceCheckUtils]: 4: Hoare triple {689#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {689#true} is VALID [2018-11-14 17:37:33,923 INFO L273 TraceCheckUtils]: 5: Hoare triple {689#true} assume true; {689#true} is VALID [2018-11-14 17:37:33,923 INFO L273 TraceCheckUtils]: 6: Hoare triple {689#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {689#true} is VALID [2018-11-14 17:37:33,923 INFO L273 TraceCheckUtils]: 7: Hoare triple {689#true} assume true; {689#true} is VALID [2018-11-14 17:37:33,933 INFO L273 TraceCheckUtils]: 8: Hoare triple {689#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {691#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:37:33,946 INFO L273 TraceCheckUtils]: 9: Hoare triple {691#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume true; {691#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:37:33,960 INFO L273 TraceCheckUtils]: 10: Hoare triple {691#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {726#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:37:33,973 INFO L273 TraceCheckUtils]: 11: Hoare triple {726#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume true; {726#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:37:33,986 INFO L273 TraceCheckUtils]: 12: Hoare triple {726#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 < 268435455); {690#false} is VALID [2018-11-14 17:37:33,986 INFO L256 TraceCheckUtils]: 13: Hoare triple {690#false} call __VERIFIER_assert((if (if ~z~0 % 4294967296 < 0 && ~z~0 % 4294967296 % 4 != 0 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 == 0 then 1 else 0)); {690#false} is VALID [2018-11-14 17:37:33,987 INFO L273 TraceCheckUtils]: 14: Hoare triple {690#false} ~cond := #in~cond; {690#false} is VALID [2018-11-14 17:37:33,987 INFO L273 TraceCheckUtils]: 15: Hoare triple {690#false} assume ~cond == 0; {690#false} is VALID [2018-11-14 17:37:33,987 INFO L273 TraceCheckUtils]: 16: Hoare triple {690#false} assume !false; {690#false} is VALID [2018-11-14 17:37:33,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:37:34,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:37:34,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-14 17:37:34,023 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-14 17:37:34,024 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:37:34,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:37:34,167 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:34,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:37:34,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:37:34,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:37:34,169 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 5 states. [2018-11-14 17:37:34,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:34,722 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2018-11-14 17:37:34,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:37:34,722 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-14 17:37:34,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:37:34,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:37:34,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-14 17:37:34,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:37:34,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-14 17:37:34,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2018-11-14 17:37:34,881 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:34,882 INFO L225 Difference]: With dead ends: 53 [2018-11-14 17:37:34,882 INFO L226 Difference]: Without dead ends: 32 [2018-11-14 17:37:34,883 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:37:34,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-14 17:37:34,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-14 17:37:34,902 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:37:34,902 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 30 states. [2018-11-14 17:37:34,902 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 30 states. [2018-11-14 17:37:34,902 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 30 states. [2018-11-14 17:37:34,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:34,905 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-14 17:37:34,905 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-14 17:37:34,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:34,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:34,909 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 32 states. [2018-11-14 17:37:34,910 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 32 states. [2018-11-14 17:37:34,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:34,912 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-14 17:37:34,912 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-14 17:37:34,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:34,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:34,913 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:37:34,913 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:37:34,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 17:37:34,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-11-14 17:37:34,916 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 17 [2018-11-14 17:37:34,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:37:34,916 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-11-14 17:37:34,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:37:34,917 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-14 17:37:34,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 17:37:34,917 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:37:34,917 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:37:34,918 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:37:34,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:37:34,918 INFO L82 PathProgramCache]: Analyzing trace with hash -189397042, now seen corresponding path program 2 times [2018-11-14 17:37:34,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:37:34,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:37:34,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:34,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:37:34,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:34,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:35,117 INFO L256 TraceCheckUtils]: 0: Hoare triple {931#true} call ULTIMATE.init(); {931#true} is VALID [2018-11-14 17:37:35,118 INFO L273 TraceCheckUtils]: 1: Hoare triple {931#true} assume true; {931#true} is VALID [2018-11-14 17:37:35,118 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {931#true} {931#true} #62#return; {931#true} is VALID [2018-11-14 17:37:35,119 INFO L256 TraceCheckUtils]: 3: Hoare triple {931#true} call #t~ret3 := main(); {931#true} is VALID [2018-11-14 17:37:35,119 INFO L273 TraceCheckUtils]: 4: Hoare triple {931#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {931#true} is VALID [2018-11-14 17:37:35,119 INFO L273 TraceCheckUtils]: 5: Hoare triple {931#true} assume true; {931#true} is VALID [2018-11-14 17:37:35,120 INFO L273 TraceCheckUtils]: 6: Hoare triple {931#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {931#true} is VALID [2018-11-14 17:37:35,120 INFO L273 TraceCheckUtils]: 7: Hoare triple {931#true} assume true; {931#true} is VALID [2018-11-14 17:37:35,121 INFO L273 TraceCheckUtils]: 8: Hoare triple {931#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {933#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:37:35,122 INFO L273 TraceCheckUtils]: 9: Hoare triple {933#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume true; {933#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:37:35,123 INFO L273 TraceCheckUtils]: 10: Hoare triple {933#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {934#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:37:35,123 INFO L273 TraceCheckUtils]: 11: Hoare triple {934#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume true; {934#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:37:35,125 INFO L273 TraceCheckUtils]: 12: Hoare triple {934#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {935#(and (<= main_~z~0 2) (< 0 (+ (div main_~z~0 4294967296) 1)))} is VALID [2018-11-14 17:37:35,126 INFO L273 TraceCheckUtils]: 13: Hoare triple {935#(and (<= main_~z~0 2) (< 0 (+ (div main_~z~0 4294967296) 1)))} assume true; {935#(and (<= main_~z~0 2) (< 0 (+ (div main_~z~0 4294967296) 1)))} is VALID [2018-11-14 17:37:35,127 INFO L273 TraceCheckUtils]: 14: Hoare triple {935#(and (<= main_~z~0 2) (< 0 (+ (div main_~z~0 4294967296) 1)))} assume !(~z~0 % 4294967296 < 268435455); {932#false} is VALID [2018-11-14 17:37:35,128 INFO L256 TraceCheckUtils]: 15: Hoare triple {932#false} call __VERIFIER_assert((if (if ~z~0 % 4294967296 < 0 && ~z~0 % 4294967296 % 4 != 0 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 == 0 then 1 else 0)); {932#false} is VALID [2018-11-14 17:37:35,128 INFO L273 TraceCheckUtils]: 16: Hoare triple {932#false} ~cond := #in~cond; {932#false} is VALID [2018-11-14 17:37:35,128 INFO L273 TraceCheckUtils]: 17: Hoare triple {932#false} assume ~cond == 0; {932#false} is VALID [2018-11-14 17:37:35,129 INFO L273 TraceCheckUtils]: 18: Hoare triple {932#false} assume !false; {932#false} is VALID [2018-11-14 17:37:35,130 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:37:35,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:37:35,131 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 17:37:35,140 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:37:35,179 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:37:35,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:37:35,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:35,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:37:35,438 INFO L256 TraceCheckUtils]: 0: Hoare triple {931#true} call ULTIMATE.init(); {931#true} is VALID [2018-11-14 17:37:35,438 INFO L273 TraceCheckUtils]: 1: Hoare triple {931#true} assume true; {931#true} is VALID [2018-11-14 17:37:35,439 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {931#true} {931#true} #62#return; {931#true} is VALID [2018-11-14 17:37:35,439 INFO L256 TraceCheckUtils]: 3: Hoare triple {931#true} call #t~ret3 := main(); {931#true} is VALID [2018-11-14 17:37:35,439 INFO L273 TraceCheckUtils]: 4: Hoare triple {931#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {931#true} is VALID [2018-11-14 17:37:35,439 INFO L273 TraceCheckUtils]: 5: Hoare triple {931#true} assume true; {931#true} is VALID [2018-11-14 17:37:35,440 INFO L273 TraceCheckUtils]: 6: Hoare triple {931#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {931#true} is VALID [2018-11-14 17:37:35,440 INFO L273 TraceCheckUtils]: 7: Hoare triple {931#true} assume true; {931#true} is VALID [2018-11-14 17:37:35,444 INFO L273 TraceCheckUtils]: 8: Hoare triple {931#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {933#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:37:35,445 INFO L273 TraceCheckUtils]: 9: Hoare triple {933#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume true; {933#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:37:35,447 INFO L273 TraceCheckUtils]: 10: Hoare triple {933#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {934#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:37:35,447 INFO L273 TraceCheckUtils]: 11: Hoare triple {934#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume true; {934#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:37:35,449 INFO L273 TraceCheckUtils]: 12: Hoare triple {934#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {975#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:37:35,450 INFO L273 TraceCheckUtils]: 13: Hoare triple {975#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume true; {975#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:37:35,451 INFO L273 TraceCheckUtils]: 14: Hoare triple {975#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume !(~z~0 % 4294967296 < 268435455); {932#false} is VALID [2018-11-14 17:37:35,451 INFO L256 TraceCheckUtils]: 15: Hoare triple {932#false} call __VERIFIER_assert((if (if ~z~0 % 4294967296 < 0 && ~z~0 % 4294967296 % 4 != 0 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 == 0 then 1 else 0)); {932#false} is VALID [2018-11-14 17:37:35,452 INFO L273 TraceCheckUtils]: 16: Hoare triple {932#false} ~cond := #in~cond; {932#false} is VALID [2018-11-14 17:37:35,452 INFO L273 TraceCheckUtils]: 17: Hoare triple {932#false} assume ~cond == 0; {932#false} is VALID [2018-11-14 17:37:35,452 INFO L273 TraceCheckUtils]: 18: Hoare triple {932#false} assume !false; {932#false} is VALID [2018-11-14 17:37:35,454 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:37:35,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:37:35,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-14 17:37:35,479 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-14 17:37:35,479 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:37:35,480 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:37:35,512 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:35,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:37:35,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:37:35,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:37:35,513 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 6 states. [2018-11-14 17:37:35,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:35,916 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2018-11-14 17:37:35,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:37:35,916 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-14 17:37:35,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:37:35,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:37:35,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2018-11-14 17:37:35,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:37:35,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2018-11-14 17:37:35,921 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 58 transitions. [2018-11-14 17:37:36,095 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:36,097 INFO L225 Difference]: With dead ends: 57 [2018-11-14 17:37:36,097 INFO L226 Difference]: Without dead ends: 34 [2018-11-14 17:37:36,098 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:37:36,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-14 17:37:36,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-11-14 17:37:36,154 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:37:36,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 32 states. [2018-11-14 17:37:36,154 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 32 states. [2018-11-14 17:37:36,154 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 32 states. [2018-11-14 17:37:36,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:36,157 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-14 17:37:36,157 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-14 17:37:36,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:36,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:36,158 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states. [2018-11-14 17:37:36,158 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states. [2018-11-14 17:37:36,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:36,160 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-14 17:37:36,160 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-14 17:37:36,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:36,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:36,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:37:36,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:37:36,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 17:37:36,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-11-14 17:37:36,163 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 19 [2018-11-14 17:37:36,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:37:36,164 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-11-14 17:37:36,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:37:36,164 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-14 17:37:36,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 17:37:36,165 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:37:36,165 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:37:36,165 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:37:36,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:37:36,165 INFO L82 PathProgramCache]: Analyzing trace with hash -922471148, now seen corresponding path program 3 times [2018-11-14 17:37:36,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:37:36,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:37:36,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:36,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:37:36,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:36,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:36,398 INFO L256 TraceCheckUtils]: 0: Hoare triple {1193#true} call ULTIMATE.init(); {1193#true} is VALID [2018-11-14 17:37:36,399 INFO L273 TraceCheckUtils]: 1: Hoare triple {1193#true} assume true; {1193#true} is VALID [2018-11-14 17:37:36,399 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1193#true} {1193#true} #62#return; {1193#true} is VALID [2018-11-14 17:37:36,400 INFO L256 TraceCheckUtils]: 3: Hoare triple {1193#true} call #t~ret3 := main(); {1193#true} is VALID [2018-11-14 17:37:36,400 INFO L273 TraceCheckUtils]: 4: Hoare triple {1193#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {1193#true} is VALID [2018-11-14 17:37:36,401 INFO L273 TraceCheckUtils]: 5: Hoare triple {1193#true} assume true; {1193#true} is VALID [2018-11-14 17:37:36,401 INFO L273 TraceCheckUtils]: 6: Hoare triple {1193#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1193#true} is VALID [2018-11-14 17:37:36,402 INFO L273 TraceCheckUtils]: 7: Hoare triple {1193#true} assume true; {1193#true} is VALID [2018-11-14 17:37:36,405 INFO L273 TraceCheckUtils]: 8: Hoare triple {1193#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {1195#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:37:36,406 INFO L273 TraceCheckUtils]: 9: Hoare triple {1195#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume true; {1195#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:37:36,407 INFO L273 TraceCheckUtils]: 10: Hoare triple {1195#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {1196#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:37:36,407 INFO L273 TraceCheckUtils]: 11: Hoare triple {1196#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume true; {1196#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:37:36,408 INFO L273 TraceCheckUtils]: 12: Hoare triple {1196#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {1197#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:37:36,408 INFO L273 TraceCheckUtils]: 13: Hoare triple {1197#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume true; {1197#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:37:36,409 INFO L273 TraceCheckUtils]: 14: Hoare triple {1197#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {1198#(and (< 0 (+ (div main_~z~0 4294967296) 1)) (<= main_~z~0 3))} is VALID [2018-11-14 17:37:36,410 INFO L273 TraceCheckUtils]: 15: Hoare triple {1198#(and (< 0 (+ (div main_~z~0 4294967296) 1)) (<= main_~z~0 3))} assume true; {1198#(and (< 0 (+ (div main_~z~0 4294967296) 1)) (<= main_~z~0 3))} is VALID [2018-11-14 17:37:36,411 INFO L273 TraceCheckUtils]: 16: Hoare triple {1198#(and (< 0 (+ (div main_~z~0 4294967296) 1)) (<= main_~z~0 3))} assume !(~z~0 % 4294967296 < 268435455); {1194#false} is VALID [2018-11-14 17:37:36,412 INFO L256 TraceCheckUtils]: 17: Hoare triple {1194#false} call __VERIFIER_assert((if (if ~z~0 % 4294967296 < 0 && ~z~0 % 4294967296 % 4 != 0 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 == 0 then 1 else 0)); {1194#false} is VALID [2018-11-14 17:37:36,412 INFO L273 TraceCheckUtils]: 18: Hoare triple {1194#false} ~cond := #in~cond; {1194#false} is VALID [2018-11-14 17:37:36,413 INFO L273 TraceCheckUtils]: 19: Hoare triple {1194#false} assume ~cond == 0; {1194#false} is VALID [2018-11-14 17:37:36,413 INFO L273 TraceCheckUtils]: 20: Hoare triple {1194#false} assume !false; {1194#false} is VALID [2018-11-14 17:37:36,415 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:37:36,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:37:36,415 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 17:37:36,436 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:37:36,450 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-14 17:37:36,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:37:36,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:36,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:37:36,567 INFO L256 TraceCheckUtils]: 0: Hoare triple {1193#true} call ULTIMATE.init(); {1193#true} is VALID [2018-11-14 17:37:36,568 INFO L273 TraceCheckUtils]: 1: Hoare triple {1193#true} assume true; {1193#true} is VALID [2018-11-14 17:37:36,568 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1193#true} {1193#true} #62#return; {1193#true} is VALID [2018-11-14 17:37:36,568 INFO L256 TraceCheckUtils]: 3: Hoare triple {1193#true} call #t~ret3 := main(); {1193#true} is VALID [2018-11-14 17:37:36,569 INFO L273 TraceCheckUtils]: 4: Hoare triple {1193#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {1193#true} is VALID [2018-11-14 17:37:36,569 INFO L273 TraceCheckUtils]: 5: Hoare triple {1193#true} assume true; {1193#true} is VALID [2018-11-14 17:37:36,570 INFO L273 TraceCheckUtils]: 6: Hoare triple {1193#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1193#true} is VALID [2018-11-14 17:37:36,570 INFO L273 TraceCheckUtils]: 7: Hoare triple {1193#true} assume true; {1193#true} is VALID [2018-11-14 17:37:36,570 INFO L273 TraceCheckUtils]: 8: Hoare triple {1193#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {1195#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:37:36,571 INFO L273 TraceCheckUtils]: 9: Hoare triple {1195#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume true; {1195#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:37:36,572 INFO L273 TraceCheckUtils]: 10: Hoare triple {1195#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {1196#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:37:36,595 INFO L273 TraceCheckUtils]: 11: Hoare triple {1196#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume true; {1196#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:37:36,609 INFO L273 TraceCheckUtils]: 12: Hoare triple {1196#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {1197#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:37:36,612 INFO L273 TraceCheckUtils]: 13: Hoare triple {1197#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume true; {1197#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:37:36,613 INFO L273 TraceCheckUtils]: 14: Hoare triple {1197#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {1244#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:37:36,615 INFO L273 TraceCheckUtils]: 15: Hoare triple {1244#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume true; {1244#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:37:36,615 INFO L273 TraceCheckUtils]: 16: Hoare triple {1244#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume !(~z~0 % 4294967296 < 268435455); {1194#false} is VALID [2018-11-14 17:37:36,616 INFO L256 TraceCheckUtils]: 17: Hoare triple {1194#false} call __VERIFIER_assert((if (if ~z~0 % 4294967296 < 0 && ~z~0 % 4294967296 % 4 != 0 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 == 0 then 1 else 0)); {1194#false} is VALID [2018-11-14 17:37:36,616 INFO L273 TraceCheckUtils]: 18: Hoare triple {1194#false} ~cond := #in~cond; {1194#false} is VALID [2018-11-14 17:37:36,616 INFO L273 TraceCheckUtils]: 19: Hoare triple {1194#false} assume ~cond == 0; {1194#false} is VALID [2018-11-14 17:37:36,616 INFO L273 TraceCheckUtils]: 20: Hoare triple {1194#false} assume !false; {1194#false} is VALID [2018-11-14 17:37:36,618 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:37:36,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:37:36,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-14 17:37:36,642 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-11-14 17:37:36,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:37:36,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 17:37:36,673 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:36,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 17:37:36,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 17:37:36,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:37:36,675 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 7 states. [2018-11-14 17:37:36,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:36,990 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2018-11-14 17:37:36,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:37:36,990 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-11-14 17:37:36,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:37:36,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:37:36,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2018-11-14 17:37:36,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:37:36,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2018-11-14 17:37:36,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 60 transitions. [2018-11-14 17:37:37,098 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:37,099 INFO L225 Difference]: With dead ends: 61 [2018-11-14 17:37:37,100 INFO L226 Difference]: Without dead ends: 36 [2018-11-14 17:37:37,100 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:37:37,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-14 17:37:37,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-11-14 17:37:37,175 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:37:37,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 34 states. [2018-11-14 17:37:37,175 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 34 states. [2018-11-14 17:37:37,176 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 34 states. [2018-11-14 17:37:37,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:37,178 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-14 17:37:37,178 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-14 17:37:37,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:37,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:37,179 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 36 states. [2018-11-14 17:37:37,179 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 36 states. [2018-11-14 17:37:37,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:37,181 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-14 17:37:37,181 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-14 17:37:37,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:37,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:37,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:37:37,182 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:37:37,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 17:37:37,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-14 17:37:37,184 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 21 [2018-11-14 17:37:37,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:37:37,185 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-14 17:37:37,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 17:37:37,185 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-14 17:37:37,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 17:37:37,186 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:37:37,186 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:37:37,186 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:37:37,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:37:37,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1032050470, now seen corresponding path program 4 times [2018-11-14 17:37:37,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:37:37,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:37:37,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:37,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:37:37,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:37,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:37,719 INFO L256 TraceCheckUtils]: 0: Hoare triple {1475#true} call ULTIMATE.init(); {1475#true} is VALID [2018-11-14 17:37:37,719 INFO L273 TraceCheckUtils]: 1: Hoare triple {1475#true} assume true; {1475#true} is VALID [2018-11-14 17:37:37,719 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1475#true} {1475#true} #62#return; {1475#true} is VALID [2018-11-14 17:37:37,720 INFO L256 TraceCheckUtils]: 3: Hoare triple {1475#true} call #t~ret3 := main(); {1475#true} is VALID [2018-11-14 17:37:37,720 INFO L273 TraceCheckUtils]: 4: Hoare triple {1475#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {1475#true} is VALID [2018-11-14 17:37:37,720 INFO L273 TraceCheckUtils]: 5: Hoare triple {1475#true} assume true; {1475#true} is VALID [2018-11-14 17:37:37,720 INFO L273 TraceCheckUtils]: 6: Hoare triple {1475#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1475#true} is VALID [2018-11-14 17:37:37,720 INFO L273 TraceCheckUtils]: 7: Hoare triple {1475#true} assume true; {1475#true} is VALID [2018-11-14 17:37:37,721 INFO L273 TraceCheckUtils]: 8: Hoare triple {1475#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {1477#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:37:37,722 INFO L273 TraceCheckUtils]: 9: Hoare triple {1477#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume true; {1477#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:37:37,723 INFO L273 TraceCheckUtils]: 10: Hoare triple {1477#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {1478#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:37:37,723 INFO L273 TraceCheckUtils]: 11: Hoare triple {1478#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume true; {1478#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:37:37,724 INFO L273 TraceCheckUtils]: 12: Hoare triple {1478#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {1479#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:37:37,725 INFO L273 TraceCheckUtils]: 13: Hoare triple {1479#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume true; {1479#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:37:37,726 INFO L273 TraceCheckUtils]: 14: Hoare triple {1479#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {1480#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:37:37,727 INFO L273 TraceCheckUtils]: 15: Hoare triple {1480#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume true; {1480#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:37:37,729 INFO L273 TraceCheckUtils]: 16: Hoare triple {1480#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {1481#(and (<= main_~z~0 4) (< 0 (+ (div main_~z~0 4294967296) 1)))} is VALID [2018-11-14 17:37:37,730 INFO L273 TraceCheckUtils]: 17: Hoare triple {1481#(and (<= main_~z~0 4) (< 0 (+ (div main_~z~0 4294967296) 1)))} assume true; {1481#(and (<= main_~z~0 4) (< 0 (+ (div main_~z~0 4294967296) 1)))} is VALID [2018-11-14 17:37:37,731 INFO L273 TraceCheckUtils]: 18: Hoare triple {1481#(and (<= main_~z~0 4) (< 0 (+ (div main_~z~0 4294967296) 1)))} assume !(~z~0 % 4294967296 < 268435455); {1476#false} is VALID [2018-11-14 17:37:37,731 INFO L256 TraceCheckUtils]: 19: Hoare triple {1476#false} call __VERIFIER_assert((if (if ~z~0 % 4294967296 < 0 && ~z~0 % 4294967296 % 4 != 0 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 == 0 then 1 else 0)); {1476#false} is VALID [2018-11-14 17:37:37,731 INFO L273 TraceCheckUtils]: 20: Hoare triple {1476#false} ~cond := #in~cond; {1476#false} is VALID [2018-11-14 17:37:37,732 INFO L273 TraceCheckUtils]: 21: Hoare triple {1476#false} assume ~cond == 0; {1476#false} is VALID [2018-11-14 17:37:37,732 INFO L273 TraceCheckUtils]: 22: Hoare triple {1476#false} assume !false; {1476#false} is VALID [2018-11-14 17:37:37,734 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:37:37,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:37:37,735 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:37:37,744 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:37:37,757 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:37:37,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:37:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:37,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:37:37,939 INFO L256 TraceCheckUtils]: 0: Hoare triple {1475#true} call ULTIMATE.init(); {1475#true} is VALID [2018-11-14 17:37:37,940 INFO L273 TraceCheckUtils]: 1: Hoare triple {1475#true} assume true; {1475#true} is VALID [2018-11-14 17:37:37,940 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1475#true} {1475#true} #62#return; {1475#true} is VALID [2018-11-14 17:37:37,940 INFO L256 TraceCheckUtils]: 3: Hoare triple {1475#true} call #t~ret3 := main(); {1475#true} is VALID [2018-11-14 17:37:37,941 INFO L273 TraceCheckUtils]: 4: Hoare triple {1475#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {1475#true} is VALID [2018-11-14 17:37:37,941 INFO L273 TraceCheckUtils]: 5: Hoare triple {1475#true} assume true; {1475#true} is VALID [2018-11-14 17:37:37,941 INFO L273 TraceCheckUtils]: 6: Hoare triple {1475#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1475#true} is VALID [2018-11-14 17:37:37,941 INFO L273 TraceCheckUtils]: 7: Hoare triple {1475#true} assume true; {1475#true} is VALID [2018-11-14 17:37:37,942 INFO L273 TraceCheckUtils]: 8: Hoare triple {1475#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {1477#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:37:37,942 INFO L273 TraceCheckUtils]: 9: Hoare triple {1477#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume true; {1477#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:37:37,943 INFO L273 TraceCheckUtils]: 10: Hoare triple {1477#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {1478#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:37:37,944 INFO L273 TraceCheckUtils]: 11: Hoare triple {1478#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume true; {1478#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:37:37,944 INFO L273 TraceCheckUtils]: 12: Hoare triple {1478#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {1479#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:37:37,945 INFO L273 TraceCheckUtils]: 13: Hoare triple {1479#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume true; {1479#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:37:37,946 INFO L273 TraceCheckUtils]: 14: Hoare triple {1479#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {1480#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:37:37,947 INFO L273 TraceCheckUtils]: 15: Hoare triple {1480#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume true; {1480#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:37:37,948 INFO L273 TraceCheckUtils]: 16: Hoare triple {1480#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {1533#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:37:37,956 INFO L273 TraceCheckUtils]: 17: Hoare triple {1533#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume true; {1533#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:37:37,957 INFO L273 TraceCheckUtils]: 18: Hoare triple {1533#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume !(~z~0 % 4294967296 < 268435455); {1476#false} is VALID [2018-11-14 17:37:37,958 INFO L256 TraceCheckUtils]: 19: Hoare triple {1476#false} call __VERIFIER_assert((if (if ~z~0 % 4294967296 < 0 && ~z~0 % 4294967296 % 4 != 0 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 == 0 then 1 else 0)); {1476#false} is VALID [2018-11-14 17:37:37,958 INFO L273 TraceCheckUtils]: 20: Hoare triple {1476#false} ~cond := #in~cond; {1476#false} is VALID [2018-11-14 17:37:37,958 INFO L273 TraceCheckUtils]: 21: Hoare triple {1476#false} assume ~cond == 0; {1476#false} is VALID [2018-11-14 17:37:37,958 INFO L273 TraceCheckUtils]: 22: Hoare triple {1476#false} assume !false; {1476#false} is VALID [2018-11-14 17:37:37,960 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:37:37,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:37:37,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-14 17:37:37,984 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-11-14 17:37:37,984 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:37:37,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 17:37:38,009 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:38,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 17:37:38,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 17:37:38,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:37:38,011 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 8 states. [2018-11-14 17:37:38,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:38,412 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2018-11-14 17:37:38,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 17:37:38,413 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-11-14 17:37:38,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:37:38,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:37:38,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2018-11-14 17:37:38,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:37:38,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2018-11-14 17:37:38,417 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 62 transitions. [2018-11-14 17:37:38,486 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:38,488 INFO L225 Difference]: With dead ends: 65 [2018-11-14 17:37:38,488 INFO L226 Difference]: Without dead ends: 38 [2018-11-14 17:37:38,489 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:37:38,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-14 17:37:38,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2018-11-14 17:37:38,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:37:38,543 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 36 states. [2018-11-14 17:37:38,543 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 36 states. [2018-11-14 17:37:38,543 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 36 states. [2018-11-14 17:37:38,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:38,546 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-14 17:37:38,546 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-14 17:37:38,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:38,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:38,547 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 38 states. [2018-11-14 17:37:38,547 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 38 states. [2018-11-14 17:37:38,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:38,549 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-14 17:37:38,549 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-14 17:37:38,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:38,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:38,550 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:37:38,550 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:37:38,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 17:37:38,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-11-14 17:37:38,552 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 23 [2018-11-14 17:37:38,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:37:38,553 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-11-14 17:37:38,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 17:37:38,553 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-14 17:37:38,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 17:37:38,554 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:37:38,554 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:37:38,554 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:37:38,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:37:38,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1036403488, now seen corresponding path program 5 times [2018-11-14 17:37:38,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:37:38,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:37:38,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:38,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:37:38,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:38,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:39,486 INFO L256 TraceCheckUtils]: 0: Hoare triple {1777#true} call ULTIMATE.init(); {1777#true} is VALID [2018-11-14 17:37:39,487 INFO L273 TraceCheckUtils]: 1: Hoare triple {1777#true} assume true; {1777#true} is VALID [2018-11-14 17:37:39,487 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1777#true} {1777#true} #62#return; {1777#true} is VALID [2018-11-14 17:37:39,487 INFO L256 TraceCheckUtils]: 3: Hoare triple {1777#true} call #t~ret3 := main(); {1777#true} is VALID [2018-11-14 17:37:39,488 INFO L273 TraceCheckUtils]: 4: Hoare triple {1777#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {1777#true} is VALID [2018-11-14 17:37:39,488 INFO L273 TraceCheckUtils]: 5: Hoare triple {1777#true} assume true; {1777#true} is VALID [2018-11-14 17:37:39,488 INFO L273 TraceCheckUtils]: 6: Hoare triple {1777#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1777#true} is VALID [2018-11-14 17:37:39,488 INFO L273 TraceCheckUtils]: 7: Hoare triple {1777#true} assume true; {1777#true} is VALID [2018-11-14 17:37:39,489 INFO L273 TraceCheckUtils]: 8: Hoare triple {1777#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {1779#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:37:39,490 INFO L273 TraceCheckUtils]: 9: Hoare triple {1779#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume true; {1779#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:37:39,497 INFO L273 TraceCheckUtils]: 10: Hoare triple {1779#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {1780#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:37:39,499 INFO L273 TraceCheckUtils]: 11: Hoare triple {1780#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume true; {1780#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:37:39,503 INFO L273 TraceCheckUtils]: 12: Hoare triple {1780#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {1781#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:37:39,504 INFO L273 TraceCheckUtils]: 13: Hoare triple {1781#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume true; {1781#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:37:39,505 INFO L273 TraceCheckUtils]: 14: Hoare triple {1781#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {1782#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:37:39,506 INFO L273 TraceCheckUtils]: 15: Hoare triple {1782#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume true; {1782#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:37:39,507 INFO L273 TraceCheckUtils]: 16: Hoare triple {1782#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {1783#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:37:39,507 INFO L273 TraceCheckUtils]: 17: Hoare triple {1783#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume true; {1783#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:37:39,508 INFO L273 TraceCheckUtils]: 18: Hoare triple {1783#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {1784#(and (<= main_~z~0 5) (< 0 (+ (div main_~z~0 4294967296) 1)))} is VALID [2018-11-14 17:37:39,509 INFO L273 TraceCheckUtils]: 19: Hoare triple {1784#(and (<= main_~z~0 5) (< 0 (+ (div main_~z~0 4294967296) 1)))} assume true; {1784#(and (<= main_~z~0 5) (< 0 (+ (div main_~z~0 4294967296) 1)))} is VALID [2018-11-14 17:37:39,510 INFO L273 TraceCheckUtils]: 20: Hoare triple {1784#(and (<= main_~z~0 5) (< 0 (+ (div main_~z~0 4294967296) 1)))} assume !(~z~0 % 4294967296 < 268435455); {1778#false} is VALID [2018-11-14 17:37:39,511 INFO L256 TraceCheckUtils]: 21: Hoare triple {1778#false} call __VERIFIER_assert((if (if ~z~0 % 4294967296 < 0 && ~z~0 % 4294967296 % 4 != 0 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 == 0 then 1 else 0)); {1778#false} is VALID [2018-11-14 17:37:39,511 INFO L273 TraceCheckUtils]: 22: Hoare triple {1778#false} ~cond := #in~cond; {1778#false} is VALID [2018-11-14 17:37:39,512 INFO L273 TraceCheckUtils]: 23: Hoare triple {1778#false} assume ~cond == 0; {1778#false} is VALID [2018-11-14 17:37:39,512 INFO L273 TraceCheckUtils]: 24: Hoare triple {1778#false} assume !false; {1778#false} is VALID [2018-11-14 17:37:39,515 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:37:39,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:37:39,515 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:37:39,532 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 17:37:39,561 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-14 17:37:39,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:37:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:39,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:37:39,675 INFO L256 TraceCheckUtils]: 0: Hoare triple {1777#true} call ULTIMATE.init(); {1777#true} is VALID [2018-11-14 17:37:39,676 INFO L273 TraceCheckUtils]: 1: Hoare triple {1777#true} assume true; {1777#true} is VALID [2018-11-14 17:37:39,676 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1777#true} {1777#true} #62#return; {1777#true} is VALID [2018-11-14 17:37:39,677 INFO L256 TraceCheckUtils]: 3: Hoare triple {1777#true} call #t~ret3 := main(); {1777#true} is VALID [2018-11-14 17:37:39,677 INFO L273 TraceCheckUtils]: 4: Hoare triple {1777#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {1777#true} is VALID [2018-11-14 17:37:39,677 INFO L273 TraceCheckUtils]: 5: Hoare triple {1777#true} assume true; {1777#true} is VALID [2018-11-14 17:37:39,678 INFO L273 TraceCheckUtils]: 6: Hoare triple {1777#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1777#true} is VALID [2018-11-14 17:37:39,678 INFO L273 TraceCheckUtils]: 7: Hoare triple {1777#true} assume true; {1777#true} is VALID [2018-11-14 17:37:39,678 INFO L273 TraceCheckUtils]: 8: Hoare triple {1777#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {1779#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:37:39,679 INFO L273 TraceCheckUtils]: 9: Hoare triple {1779#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume true; {1779#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:37:39,680 INFO L273 TraceCheckUtils]: 10: Hoare triple {1779#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {1780#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:37:39,680 INFO L273 TraceCheckUtils]: 11: Hoare triple {1780#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume true; {1780#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:37:39,681 INFO L273 TraceCheckUtils]: 12: Hoare triple {1780#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {1781#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:37:39,682 INFO L273 TraceCheckUtils]: 13: Hoare triple {1781#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume true; {1781#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:37:39,683 INFO L273 TraceCheckUtils]: 14: Hoare triple {1781#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {1782#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:37:39,686 INFO L273 TraceCheckUtils]: 15: Hoare triple {1782#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume true; {1782#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:37:39,687 INFO L273 TraceCheckUtils]: 16: Hoare triple {1782#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {1783#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:37:39,688 INFO L273 TraceCheckUtils]: 17: Hoare triple {1783#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume true; {1783#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:37:39,688 INFO L273 TraceCheckUtils]: 18: Hoare triple {1783#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {1842#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2018-11-14 17:37:39,692 INFO L273 TraceCheckUtils]: 19: Hoare triple {1842#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume true; {1842#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2018-11-14 17:37:39,694 INFO L273 TraceCheckUtils]: 20: Hoare triple {1842#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 < 268435455); {1778#false} is VALID [2018-11-14 17:37:39,695 INFO L256 TraceCheckUtils]: 21: Hoare triple {1778#false} call __VERIFIER_assert((if (if ~z~0 % 4294967296 < 0 && ~z~0 % 4294967296 % 4 != 0 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 == 0 then 1 else 0)); {1778#false} is VALID [2018-11-14 17:37:39,695 INFO L273 TraceCheckUtils]: 22: Hoare triple {1778#false} ~cond := #in~cond; {1778#false} is VALID [2018-11-14 17:37:39,695 INFO L273 TraceCheckUtils]: 23: Hoare triple {1778#false} assume ~cond == 0; {1778#false} is VALID [2018-11-14 17:37:39,696 INFO L273 TraceCheckUtils]: 24: Hoare triple {1778#false} assume !false; {1778#false} is VALID [2018-11-14 17:37:39,697 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:37:39,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:37:39,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-14 17:37:39,719 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-11-14 17:37:39,720 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:37:39,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 17:37:39,829 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 17:37:39,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 17:37:39,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 17:37:39,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:37:39,830 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 9 states. [2018-11-14 17:37:40,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:40,600 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2018-11-14 17:37:40,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 17:37:40,600 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-11-14 17:37:40,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:37:40,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:37:40,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 64 transitions. [2018-11-14 17:37:40,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:37:40,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 64 transitions. [2018-11-14 17:37:40,606 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 64 transitions. [2018-11-14 17:37:40,869 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:40,871 INFO L225 Difference]: With dead ends: 69 [2018-11-14 17:37:40,871 INFO L226 Difference]: Without dead ends: 40 [2018-11-14 17:37:40,872 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:37:40,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-14 17:37:40,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-11-14 17:37:40,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:37:40,900 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 38 states. [2018-11-14 17:37:40,900 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 38 states. [2018-11-14 17:37:40,900 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 38 states. [2018-11-14 17:37:40,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:40,902 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-14 17:37:40,907 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-14 17:37:40,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:40,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:40,908 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 40 states. [2018-11-14 17:37:40,908 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 40 states. [2018-11-14 17:37:40,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:40,910 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-14 17:37:40,910 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-14 17:37:40,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:40,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:40,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:37:40,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:37:40,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 17:37:40,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-11-14 17:37:40,914 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 25 [2018-11-14 17:37:40,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:37:40,914 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-11-14 17:37:40,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 17:37:40,914 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-14 17:37:40,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 17:37:40,915 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:37:40,915 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:37:40,915 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:37:40,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:37:40,915 INFO L82 PathProgramCache]: Analyzing trace with hash 250799078, now seen corresponding path program 6 times [2018-11-14 17:37:40,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:37:40,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:37:40,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:40,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:37:40,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:41,183 INFO L256 TraceCheckUtils]: 0: Hoare triple {2099#true} call ULTIMATE.init(); {2099#true} is VALID [2018-11-14 17:37:41,184 INFO L273 TraceCheckUtils]: 1: Hoare triple {2099#true} assume true; {2099#true} is VALID [2018-11-14 17:37:41,184 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2099#true} {2099#true} #62#return; {2099#true} is VALID [2018-11-14 17:37:41,184 INFO L256 TraceCheckUtils]: 3: Hoare triple {2099#true} call #t~ret3 := main(); {2099#true} is VALID [2018-11-14 17:37:41,184 INFO L273 TraceCheckUtils]: 4: Hoare triple {2099#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {2099#true} is VALID [2018-11-14 17:37:41,185 INFO L273 TraceCheckUtils]: 5: Hoare triple {2099#true} assume true; {2099#true} is VALID [2018-11-14 17:37:41,185 INFO L273 TraceCheckUtils]: 6: Hoare triple {2099#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {2099#true} is VALID [2018-11-14 17:37:41,185 INFO L273 TraceCheckUtils]: 7: Hoare triple {2099#true} assume true; {2099#true} is VALID [2018-11-14 17:37:41,185 INFO L273 TraceCheckUtils]: 8: Hoare triple {2099#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {2101#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:37:41,186 INFO L273 TraceCheckUtils]: 9: Hoare triple {2101#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume true; {2101#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:37:41,186 INFO L273 TraceCheckUtils]: 10: Hoare triple {2101#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {2102#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:37:41,187 INFO L273 TraceCheckUtils]: 11: Hoare triple {2102#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume true; {2102#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:37:41,188 INFO L273 TraceCheckUtils]: 12: Hoare triple {2102#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {2103#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:37:41,188 INFO L273 TraceCheckUtils]: 13: Hoare triple {2103#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume true; {2103#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:37:41,189 INFO L273 TraceCheckUtils]: 14: Hoare triple {2103#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {2104#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:37:41,190 INFO L273 TraceCheckUtils]: 15: Hoare triple {2104#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume true; {2104#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:37:41,191 INFO L273 TraceCheckUtils]: 16: Hoare triple {2104#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {2105#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:37:41,192 INFO L273 TraceCheckUtils]: 17: Hoare triple {2105#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume true; {2105#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:37:41,193 INFO L273 TraceCheckUtils]: 18: Hoare triple {2105#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {2106#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2018-11-14 17:37:41,194 INFO L273 TraceCheckUtils]: 19: Hoare triple {2106#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume true; {2106#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2018-11-14 17:37:41,195 INFO L273 TraceCheckUtils]: 20: Hoare triple {2106#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {2107#(and (<= main_~z~0 6) (< 0 (+ (div main_~z~0 4294967296) 1)))} is VALID [2018-11-14 17:37:41,196 INFO L273 TraceCheckUtils]: 21: Hoare triple {2107#(and (<= main_~z~0 6) (< 0 (+ (div main_~z~0 4294967296) 1)))} assume true; {2107#(and (<= main_~z~0 6) (< 0 (+ (div main_~z~0 4294967296) 1)))} is VALID [2018-11-14 17:37:41,197 INFO L273 TraceCheckUtils]: 22: Hoare triple {2107#(and (<= main_~z~0 6) (< 0 (+ (div main_~z~0 4294967296) 1)))} assume !(~z~0 % 4294967296 < 268435455); {2100#false} is VALID [2018-11-14 17:37:41,197 INFO L256 TraceCheckUtils]: 23: Hoare triple {2100#false} call __VERIFIER_assert((if (if ~z~0 % 4294967296 < 0 && ~z~0 % 4294967296 % 4 != 0 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 == 0 then 1 else 0)); {2100#false} is VALID [2018-11-14 17:37:41,197 INFO L273 TraceCheckUtils]: 24: Hoare triple {2100#false} ~cond := #in~cond; {2100#false} is VALID [2018-11-14 17:37:41,197 INFO L273 TraceCheckUtils]: 25: Hoare triple {2100#false} assume ~cond == 0; {2100#false} is VALID [2018-11-14 17:37:41,198 INFO L273 TraceCheckUtils]: 26: Hoare triple {2100#false} assume !false; {2100#false} is VALID [2018-11-14 17:37:41,199 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:37:41,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:37:41,200 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:37:41,209 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 17:37:41,238 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-14 17:37:41,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:37:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:41,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:37:41,343 INFO L256 TraceCheckUtils]: 0: Hoare triple {2099#true} call ULTIMATE.init(); {2099#true} is VALID [2018-11-14 17:37:41,343 INFO L273 TraceCheckUtils]: 1: Hoare triple {2099#true} assume true; {2099#true} is VALID [2018-11-14 17:37:41,343 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2099#true} {2099#true} #62#return; {2099#true} is VALID [2018-11-14 17:37:41,344 INFO L256 TraceCheckUtils]: 3: Hoare triple {2099#true} call #t~ret3 := main(); {2099#true} is VALID [2018-11-14 17:37:41,344 INFO L273 TraceCheckUtils]: 4: Hoare triple {2099#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {2099#true} is VALID [2018-11-14 17:37:41,344 INFO L273 TraceCheckUtils]: 5: Hoare triple {2099#true} assume true; {2099#true} is VALID [2018-11-14 17:37:41,344 INFO L273 TraceCheckUtils]: 6: Hoare triple {2099#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {2099#true} is VALID [2018-11-14 17:37:41,345 INFO L273 TraceCheckUtils]: 7: Hoare triple {2099#true} assume true; {2099#true} is VALID [2018-11-14 17:37:41,345 INFO L273 TraceCheckUtils]: 8: Hoare triple {2099#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {2101#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:37:41,346 INFO L273 TraceCheckUtils]: 9: Hoare triple {2101#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume true; {2101#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:37:41,364 INFO L273 TraceCheckUtils]: 10: Hoare triple {2101#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {2102#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:37:41,378 INFO L273 TraceCheckUtils]: 11: Hoare triple {2102#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume true; {2102#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:37:41,394 INFO L273 TraceCheckUtils]: 12: Hoare triple {2102#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {2103#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:37:41,409 INFO L273 TraceCheckUtils]: 13: Hoare triple {2103#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume true; {2103#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:37:41,413 INFO L273 TraceCheckUtils]: 14: Hoare triple {2103#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {2104#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:37:41,414 INFO L273 TraceCheckUtils]: 15: Hoare triple {2104#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume true; {2104#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:37:41,418 INFO L273 TraceCheckUtils]: 16: Hoare triple {2104#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {2105#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:37:41,418 INFO L273 TraceCheckUtils]: 17: Hoare triple {2105#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume true; {2105#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:37:41,421 INFO L273 TraceCheckUtils]: 18: Hoare triple {2105#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {2106#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2018-11-14 17:37:41,421 INFO L273 TraceCheckUtils]: 19: Hoare triple {2106#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume true; {2106#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2018-11-14 17:37:41,422 INFO L273 TraceCheckUtils]: 20: Hoare triple {2106#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {2171#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2018-11-14 17:37:41,422 INFO L273 TraceCheckUtils]: 21: Hoare triple {2171#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume true; {2171#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2018-11-14 17:37:41,423 INFO L273 TraceCheckUtils]: 22: Hoare triple {2171#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 < 268435455); {2100#false} is VALID [2018-11-14 17:37:41,423 INFO L256 TraceCheckUtils]: 23: Hoare triple {2100#false} call __VERIFIER_assert((if (if ~z~0 % 4294967296 < 0 && ~z~0 % 4294967296 % 4 != 0 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 == 0 then 1 else 0)); {2100#false} is VALID [2018-11-14 17:37:41,423 INFO L273 TraceCheckUtils]: 24: Hoare triple {2100#false} ~cond := #in~cond; {2100#false} is VALID [2018-11-14 17:37:41,423 INFO L273 TraceCheckUtils]: 25: Hoare triple {2100#false} assume ~cond == 0; {2100#false} is VALID [2018-11-14 17:37:41,423 INFO L273 TraceCheckUtils]: 26: Hoare triple {2100#false} assume !false; {2100#false} is VALID [2018-11-14 17:37:41,425 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:37:41,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:37:41,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-14 17:37:41,455 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-11-14 17:37:41,455 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:37:41,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 17:37:41,491 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:41,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 17:37:41,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 17:37:41,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:37:41,493 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 10 states. [2018-11-14 17:37:41,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:41,880 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-11-14 17:37:41,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 17:37:41,880 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-11-14 17:37:41,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:37:41,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:37:41,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 66 transitions. [2018-11-14 17:37:41,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:37:41,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 66 transitions. [2018-11-14 17:37:41,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 66 transitions. [2018-11-14 17:37:41,955 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:41,957 INFO L225 Difference]: With dead ends: 73 [2018-11-14 17:37:41,957 INFO L226 Difference]: Without dead ends: 42 [2018-11-14 17:37:41,958 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:37:41,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-14 17:37:41,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-11-14 17:37:41,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:37:41,995 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 40 states. [2018-11-14 17:37:41,996 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 40 states. [2018-11-14 17:37:41,996 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 40 states. [2018-11-14 17:37:41,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:41,997 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-14 17:37:41,997 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-14 17:37:41,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:41,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:41,998 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 42 states. [2018-11-14 17:37:41,998 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 42 states. [2018-11-14 17:37:42,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:42,000 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-14 17:37:42,001 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-14 17:37:42,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:42,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:42,001 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:37:42,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:37:42,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-14 17:37:42,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-11-14 17:37:42,003 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 27 [2018-11-14 17:37:42,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:37:42,003 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-11-14 17:37:42,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 17:37:42,003 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-14 17:37:42,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 17:37:42,004 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:37:42,005 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:37:42,005 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:37:42,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:37:42,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1199205164, now seen corresponding path program 7 times [2018-11-14 17:37:42,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:37:42,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:37:42,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:42,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:37:42,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:42,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:42,325 INFO L256 TraceCheckUtils]: 0: Hoare triple {2441#true} call ULTIMATE.init(); {2441#true} is VALID [2018-11-14 17:37:42,325 INFO L273 TraceCheckUtils]: 1: Hoare triple {2441#true} assume true; {2441#true} is VALID [2018-11-14 17:37:42,325 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2441#true} {2441#true} #62#return; {2441#true} is VALID [2018-11-14 17:37:42,325 INFO L256 TraceCheckUtils]: 3: Hoare triple {2441#true} call #t~ret3 := main(); {2441#true} is VALID [2018-11-14 17:37:42,326 INFO L273 TraceCheckUtils]: 4: Hoare triple {2441#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {2441#true} is VALID [2018-11-14 17:37:42,326 INFO L273 TraceCheckUtils]: 5: Hoare triple {2441#true} assume true; {2441#true} is VALID [2018-11-14 17:37:42,326 INFO L273 TraceCheckUtils]: 6: Hoare triple {2441#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {2441#true} is VALID [2018-11-14 17:37:42,326 INFO L273 TraceCheckUtils]: 7: Hoare triple {2441#true} assume true; {2441#true} is VALID [2018-11-14 17:37:42,327 INFO L273 TraceCheckUtils]: 8: Hoare triple {2441#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {2443#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:37:42,328 INFO L273 TraceCheckUtils]: 9: Hoare triple {2443#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume true; {2443#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:37:42,330 INFO L273 TraceCheckUtils]: 10: Hoare triple {2443#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {2444#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:37:42,330 INFO L273 TraceCheckUtils]: 11: Hoare triple {2444#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume true; {2444#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:37:42,332 INFO L273 TraceCheckUtils]: 12: Hoare triple {2444#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {2445#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:37:42,332 INFO L273 TraceCheckUtils]: 13: Hoare triple {2445#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume true; {2445#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:37:42,334 INFO L273 TraceCheckUtils]: 14: Hoare triple {2445#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {2446#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:37:42,334 INFO L273 TraceCheckUtils]: 15: Hoare triple {2446#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume true; {2446#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:37:42,336 INFO L273 TraceCheckUtils]: 16: Hoare triple {2446#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {2447#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:37:42,336 INFO L273 TraceCheckUtils]: 17: Hoare triple {2447#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume true; {2447#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:37:42,338 INFO L273 TraceCheckUtils]: 18: Hoare triple {2447#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {2448#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2018-11-14 17:37:42,338 INFO L273 TraceCheckUtils]: 19: Hoare triple {2448#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume true; {2448#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2018-11-14 17:37:42,340 INFO L273 TraceCheckUtils]: 20: Hoare triple {2448#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {2449#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2018-11-14 17:37:42,340 INFO L273 TraceCheckUtils]: 21: Hoare triple {2449#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume true; {2449#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2018-11-14 17:37:42,342 INFO L273 TraceCheckUtils]: 22: Hoare triple {2449#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {2450#(and (< 0 (+ (div main_~z~0 4294967296) 1)) (<= main_~z~0 7))} is VALID [2018-11-14 17:37:42,342 INFO L273 TraceCheckUtils]: 23: Hoare triple {2450#(and (< 0 (+ (div main_~z~0 4294967296) 1)) (<= main_~z~0 7))} assume true; {2450#(and (< 0 (+ (div main_~z~0 4294967296) 1)) (<= main_~z~0 7))} is VALID [2018-11-14 17:37:42,344 INFO L273 TraceCheckUtils]: 24: Hoare triple {2450#(and (< 0 (+ (div main_~z~0 4294967296) 1)) (<= main_~z~0 7))} assume !(~z~0 % 4294967296 < 268435455); {2442#false} is VALID [2018-11-14 17:37:42,344 INFO L256 TraceCheckUtils]: 25: Hoare triple {2442#false} call __VERIFIER_assert((if (if ~z~0 % 4294967296 < 0 && ~z~0 % 4294967296 % 4 != 0 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 == 0 then 1 else 0)); {2442#false} is VALID [2018-11-14 17:37:42,344 INFO L273 TraceCheckUtils]: 26: Hoare triple {2442#false} ~cond := #in~cond; {2442#false} is VALID [2018-11-14 17:37:42,344 INFO L273 TraceCheckUtils]: 27: Hoare triple {2442#false} assume ~cond == 0; {2442#false} is VALID [2018-11-14 17:37:42,344 INFO L273 TraceCheckUtils]: 28: Hoare triple {2442#false} assume !false; {2442#false} is VALID [2018-11-14 17:37:42,346 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:37:42,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:37:42,346 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:37:42,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:37:42,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:42,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:42,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:37:42,462 INFO L256 TraceCheckUtils]: 0: Hoare triple {2441#true} call ULTIMATE.init(); {2441#true} is VALID [2018-11-14 17:37:42,463 INFO L273 TraceCheckUtils]: 1: Hoare triple {2441#true} assume true; {2441#true} is VALID [2018-11-14 17:37:42,463 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2441#true} {2441#true} #62#return; {2441#true} is VALID [2018-11-14 17:37:42,463 INFO L256 TraceCheckUtils]: 3: Hoare triple {2441#true} call #t~ret3 := main(); {2441#true} is VALID [2018-11-14 17:37:42,463 INFO L273 TraceCheckUtils]: 4: Hoare triple {2441#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {2441#true} is VALID [2018-11-14 17:37:42,463 INFO L273 TraceCheckUtils]: 5: Hoare triple {2441#true} assume true; {2441#true} is VALID [2018-11-14 17:37:42,463 INFO L273 TraceCheckUtils]: 6: Hoare triple {2441#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {2441#true} is VALID [2018-11-14 17:37:42,464 INFO L273 TraceCheckUtils]: 7: Hoare triple {2441#true} assume true; {2441#true} is VALID [2018-11-14 17:37:42,464 INFO L273 TraceCheckUtils]: 8: Hoare triple {2441#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {2443#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:37:42,464 INFO L273 TraceCheckUtils]: 9: Hoare triple {2443#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume true; {2443#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:37:42,465 INFO L273 TraceCheckUtils]: 10: Hoare triple {2443#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {2444#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:37:42,466 INFO L273 TraceCheckUtils]: 11: Hoare triple {2444#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume true; {2444#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:37:42,466 INFO L273 TraceCheckUtils]: 12: Hoare triple {2444#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {2445#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:37:42,467 INFO L273 TraceCheckUtils]: 13: Hoare triple {2445#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume true; {2445#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:37:42,468 INFO L273 TraceCheckUtils]: 14: Hoare triple {2445#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {2446#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:37:42,469 INFO L273 TraceCheckUtils]: 15: Hoare triple {2446#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume true; {2446#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:37:42,470 INFO L273 TraceCheckUtils]: 16: Hoare triple {2446#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {2447#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:37:42,470 INFO L273 TraceCheckUtils]: 17: Hoare triple {2447#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume true; {2447#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:37:42,471 INFO L273 TraceCheckUtils]: 18: Hoare triple {2447#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {2448#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2018-11-14 17:37:42,472 INFO L273 TraceCheckUtils]: 19: Hoare triple {2448#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume true; {2448#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2018-11-14 17:37:42,473 INFO L273 TraceCheckUtils]: 20: Hoare triple {2448#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {2449#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2018-11-14 17:37:42,474 INFO L273 TraceCheckUtils]: 21: Hoare triple {2449#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume true; {2449#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2018-11-14 17:37:42,475 INFO L273 TraceCheckUtils]: 22: Hoare triple {2449#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {2520#(and (<= 7 main_~z~0) (<= main_~z~0 7))} is VALID [2018-11-14 17:37:42,475 INFO L273 TraceCheckUtils]: 23: Hoare triple {2520#(and (<= 7 main_~z~0) (<= main_~z~0 7))} assume true; {2520#(and (<= 7 main_~z~0) (<= main_~z~0 7))} is VALID [2018-11-14 17:37:42,476 INFO L273 TraceCheckUtils]: 24: Hoare triple {2520#(and (<= 7 main_~z~0) (<= main_~z~0 7))} assume !(~z~0 % 4294967296 < 268435455); {2442#false} is VALID [2018-11-14 17:37:42,476 INFO L256 TraceCheckUtils]: 25: Hoare triple {2442#false} call __VERIFIER_assert((if (if ~z~0 % 4294967296 < 0 && ~z~0 % 4294967296 % 4 != 0 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 == 0 then 1 else 0)); {2442#false} is VALID [2018-11-14 17:37:42,477 INFO L273 TraceCheckUtils]: 26: Hoare triple {2442#false} ~cond := #in~cond; {2442#false} is VALID [2018-11-14 17:37:42,477 INFO L273 TraceCheckUtils]: 27: Hoare triple {2442#false} assume ~cond == 0; {2442#false} is VALID [2018-11-14 17:37:42,477 INFO L273 TraceCheckUtils]: 28: Hoare triple {2442#false} assume !false; {2442#false} is VALID [2018-11-14 17:37:42,479 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:37:42,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:37:42,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-14 17:37:42,500 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-11-14 17:37:42,500 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:37:42,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 17:37:42,530 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 17:37:42,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 17:37:42,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 17:37:42,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:37:42,531 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 11 states. [2018-11-14 17:37:43,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:43,145 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2018-11-14 17:37:43,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 17:37:43,145 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-11-14 17:37:43,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:37:43,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 17:37:43,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2018-11-14 17:37:43,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 17:37:43,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2018-11-14 17:37:43,149 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 68 transitions. [2018-11-14 17:37:43,291 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:43,292 INFO L225 Difference]: With dead ends: 77 [2018-11-14 17:37:43,293 INFO L226 Difference]: Without dead ends: 44 [2018-11-14 17:37:43,294 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:37:43,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-14 17:37:43,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-11-14 17:37:43,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:37:43,329 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 42 states. [2018-11-14 17:37:43,329 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 42 states. [2018-11-14 17:37:43,329 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 42 states. [2018-11-14 17:37:43,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:43,330 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-11-14 17:37:43,331 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-14 17:37:43,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:43,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:43,331 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 44 states. [2018-11-14 17:37:43,331 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 44 states. [2018-11-14 17:37:43,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:43,333 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-11-14 17:37:43,333 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-14 17:37:43,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:43,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:43,333 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:37:43,333 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:37:43,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-14 17:37:43,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-11-14 17:37:43,335 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 29 [2018-11-14 17:37:43,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:37:43,335 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-11-14 17:37:43,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 17:37:43,335 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-14 17:37:43,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 17:37:43,335 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:37:43,335 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:37:43,336 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:37:43,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:37:43,336 INFO L82 PathProgramCache]: Analyzing trace with hash 2084387058, now seen corresponding path program 8 times [2018-11-14 17:37:43,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:37:43,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:37:43,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:43,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:37:43,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:43,744 INFO L256 TraceCheckUtils]: 0: Hoare triple {2803#true} call ULTIMATE.init(); {2803#true} is VALID [2018-11-14 17:37:43,744 INFO L273 TraceCheckUtils]: 1: Hoare triple {2803#true} assume true; {2803#true} is VALID [2018-11-14 17:37:43,744 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2803#true} {2803#true} #62#return; {2803#true} is VALID [2018-11-14 17:37:43,744 INFO L256 TraceCheckUtils]: 3: Hoare triple {2803#true} call #t~ret3 := main(); {2803#true} is VALID [2018-11-14 17:37:43,745 INFO L273 TraceCheckUtils]: 4: Hoare triple {2803#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {2803#true} is VALID [2018-11-14 17:37:43,745 INFO L273 TraceCheckUtils]: 5: Hoare triple {2803#true} assume true; {2803#true} is VALID [2018-11-14 17:37:43,746 INFO L273 TraceCheckUtils]: 6: Hoare triple {2803#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {2803#true} is VALID [2018-11-14 17:37:43,746 INFO L273 TraceCheckUtils]: 7: Hoare triple {2803#true} assume true; {2803#true} is VALID [2018-11-14 17:37:43,747 INFO L273 TraceCheckUtils]: 8: Hoare triple {2803#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {2805#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:37:43,748 INFO L273 TraceCheckUtils]: 9: Hoare triple {2805#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume true; {2805#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:37:43,749 INFO L273 TraceCheckUtils]: 10: Hoare triple {2805#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {2806#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:37:43,749 INFO L273 TraceCheckUtils]: 11: Hoare triple {2806#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume true; {2806#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:37:43,750 INFO L273 TraceCheckUtils]: 12: Hoare triple {2806#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {2807#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:37:43,753 INFO L273 TraceCheckUtils]: 13: Hoare triple {2807#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume true; {2807#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:37:43,754 INFO L273 TraceCheckUtils]: 14: Hoare triple {2807#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {2808#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:37:43,754 INFO L273 TraceCheckUtils]: 15: Hoare triple {2808#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume true; {2808#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:37:43,755 INFO L273 TraceCheckUtils]: 16: Hoare triple {2808#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {2809#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:37:43,755 INFO L273 TraceCheckUtils]: 17: Hoare triple {2809#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume true; {2809#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:37:43,756 INFO L273 TraceCheckUtils]: 18: Hoare triple {2809#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {2810#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2018-11-14 17:37:43,756 INFO L273 TraceCheckUtils]: 19: Hoare triple {2810#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume true; {2810#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2018-11-14 17:37:43,757 INFO L273 TraceCheckUtils]: 20: Hoare triple {2810#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {2811#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2018-11-14 17:37:43,758 INFO L273 TraceCheckUtils]: 21: Hoare triple {2811#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume true; {2811#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2018-11-14 17:37:43,759 INFO L273 TraceCheckUtils]: 22: Hoare triple {2811#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {2812#(and (<= 7 main_~z~0) (<= main_~z~0 7))} is VALID [2018-11-14 17:37:43,759 INFO L273 TraceCheckUtils]: 23: Hoare triple {2812#(and (<= 7 main_~z~0) (<= main_~z~0 7))} assume true; {2812#(and (<= 7 main_~z~0) (<= main_~z~0 7))} is VALID [2018-11-14 17:37:43,760 INFO L273 TraceCheckUtils]: 24: Hoare triple {2812#(and (<= 7 main_~z~0) (<= main_~z~0 7))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {2813#(and (<= main_~z~0 8) (< 0 (+ (div main_~z~0 4294967296) 1)))} is VALID [2018-11-14 17:37:43,761 INFO L273 TraceCheckUtils]: 25: Hoare triple {2813#(and (<= main_~z~0 8) (< 0 (+ (div main_~z~0 4294967296) 1)))} assume true; {2813#(and (<= main_~z~0 8) (< 0 (+ (div main_~z~0 4294967296) 1)))} is VALID [2018-11-14 17:37:43,762 INFO L273 TraceCheckUtils]: 26: Hoare triple {2813#(and (<= main_~z~0 8) (< 0 (+ (div main_~z~0 4294967296) 1)))} assume !(~z~0 % 4294967296 < 268435455); {2804#false} is VALID [2018-11-14 17:37:43,762 INFO L256 TraceCheckUtils]: 27: Hoare triple {2804#false} call __VERIFIER_assert((if (if ~z~0 % 4294967296 < 0 && ~z~0 % 4294967296 % 4 != 0 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 == 0 then 1 else 0)); {2804#false} is VALID [2018-11-14 17:37:43,763 INFO L273 TraceCheckUtils]: 28: Hoare triple {2804#false} ~cond := #in~cond; {2804#false} is VALID [2018-11-14 17:37:43,763 INFO L273 TraceCheckUtils]: 29: Hoare triple {2804#false} assume ~cond == 0; {2804#false} is VALID [2018-11-14 17:37:43,763 INFO L273 TraceCheckUtils]: 30: Hoare triple {2804#false} assume !false; {2804#false} is VALID [2018-11-14 17:37:43,765 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:37:43,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:37:43,765 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:37:43,774 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:37:43,786 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:37:43,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:37:43,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:43,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:37:43,949 INFO L256 TraceCheckUtils]: 0: Hoare triple {2803#true} call ULTIMATE.init(); {2803#true} is VALID [2018-11-14 17:37:43,949 INFO L273 TraceCheckUtils]: 1: Hoare triple {2803#true} assume true; {2803#true} is VALID [2018-11-14 17:37:43,950 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2803#true} {2803#true} #62#return; {2803#true} is VALID [2018-11-14 17:37:43,950 INFO L256 TraceCheckUtils]: 3: Hoare triple {2803#true} call #t~ret3 := main(); {2803#true} is VALID [2018-11-14 17:37:43,950 INFO L273 TraceCheckUtils]: 4: Hoare triple {2803#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {2803#true} is VALID [2018-11-14 17:37:43,950 INFO L273 TraceCheckUtils]: 5: Hoare triple {2803#true} assume true; {2803#true} is VALID [2018-11-14 17:37:43,950 INFO L273 TraceCheckUtils]: 6: Hoare triple {2803#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {2803#true} is VALID [2018-11-14 17:37:43,950 INFO L273 TraceCheckUtils]: 7: Hoare triple {2803#true} assume true; {2803#true} is VALID [2018-11-14 17:37:43,951 INFO L273 TraceCheckUtils]: 8: Hoare triple {2803#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {2805#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:37:43,951 INFO L273 TraceCheckUtils]: 9: Hoare triple {2805#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume true; {2805#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:37:43,956 INFO L273 TraceCheckUtils]: 10: Hoare triple {2805#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {2806#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:37:43,956 INFO L273 TraceCheckUtils]: 11: Hoare triple {2806#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume true; {2806#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:37:43,957 INFO L273 TraceCheckUtils]: 12: Hoare triple {2806#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {2807#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:37:43,957 INFO L273 TraceCheckUtils]: 13: Hoare triple {2807#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume true; {2807#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:37:43,958 INFO L273 TraceCheckUtils]: 14: Hoare triple {2807#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {2808#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:37:43,958 INFO L273 TraceCheckUtils]: 15: Hoare triple {2808#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume true; {2808#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:37:43,959 INFO L273 TraceCheckUtils]: 16: Hoare triple {2808#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {2809#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:37:43,959 INFO L273 TraceCheckUtils]: 17: Hoare triple {2809#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume true; {2809#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:37:43,960 INFO L273 TraceCheckUtils]: 18: Hoare triple {2809#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {2810#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2018-11-14 17:37:43,961 INFO L273 TraceCheckUtils]: 19: Hoare triple {2810#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume true; {2810#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2018-11-14 17:37:43,962 INFO L273 TraceCheckUtils]: 20: Hoare triple {2810#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {2811#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2018-11-14 17:37:43,963 INFO L273 TraceCheckUtils]: 21: Hoare triple {2811#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume true; {2811#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2018-11-14 17:37:43,964 INFO L273 TraceCheckUtils]: 22: Hoare triple {2811#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {2812#(and (<= 7 main_~z~0) (<= main_~z~0 7))} is VALID [2018-11-14 17:37:43,965 INFO L273 TraceCheckUtils]: 23: Hoare triple {2812#(and (<= 7 main_~z~0) (<= main_~z~0 7))} assume true; {2812#(and (<= 7 main_~z~0) (<= main_~z~0 7))} is VALID [2018-11-14 17:37:43,966 INFO L273 TraceCheckUtils]: 24: Hoare triple {2812#(and (<= 7 main_~z~0) (<= main_~z~0 7))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {2889#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2018-11-14 17:37:43,966 INFO L273 TraceCheckUtils]: 25: Hoare triple {2889#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume true; {2889#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2018-11-14 17:37:43,967 INFO L273 TraceCheckUtils]: 26: Hoare triple {2889#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 < 268435455); {2804#false} is VALID [2018-11-14 17:37:43,967 INFO L256 TraceCheckUtils]: 27: Hoare triple {2804#false} call __VERIFIER_assert((if (if ~z~0 % 4294967296 < 0 && ~z~0 % 4294967296 % 4 != 0 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 == 0 then 1 else 0)); {2804#false} is VALID [2018-11-14 17:37:43,967 INFO L273 TraceCheckUtils]: 28: Hoare triple {2804#false} ~cond := #in~cond; {2804#false} is VALID [2018-11-14 17:37:43,967 INFO L273 TraceCheckUtils]: 29: Hoare triple {2804#false} assume ~cond == 0; {2804#false} is VALID [2018-11-14 17:37:43,968 INFO L273 TraceCheckUtils]: 30: Hoare triple {2804#false} assume !false; {2804#false} is VALID [2018-11-14 17:37:43,969 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:37:43,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:37:43,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-14 17:37:43,990 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-11-14 17:37:43,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:37:43,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 17:37:44,022 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:44,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 17:37:44,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 17:37:44,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:37:44,023 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 12 states. [2018-11-14 17:37:44,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:44,686 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2018-11-14 17:37:44,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 17:37:44,686 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-11-14 17:37:44,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:37:44,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:37:44,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2018-11-14 17:37:44,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:37:44,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2018-11-14 17:37:44,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 70 transitions. [2018-11-14 17:37:44,766 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:44,767 INFO L225 Difference]: With dead ends: 81 [2018-11-14 17:37:44,767 INFO L226 Difference]: Without dead ends: 46 [2018-11-14 17:37:44,768 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:37:44,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-14 17:37:44,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2018-11-14 17:37:44,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:37:44,822 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 44 states. [2018-11-14 17:37:44,822 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 44 states. [2018-11-14 17:37:44,822 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 44 states. [2018-11-14 17:37:44,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:44,823 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-11-14 17:37:44,823 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-14 17:37:44,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:44,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:44,824 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 46 states. [2018-11-14 17:37:44,824 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 46 states. [2018-11-14 17:37:44,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:44,826 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-11-14 17:37:44,826 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-14 17:37:44,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:44,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:44,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:37:44,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:37:44,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 17:37:44,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-11-14 17:37:44,828 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 31 [2018-11-14 17:37:44,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:37:44,828 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-11-14 17:37:44,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 17:37:44,829 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-14 17:37:44,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-14 17:37:44,829 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:37:44,829 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:37:44,830 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:37:44,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:37:44,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1954304712, now seen corresponding path program 9 times [2018-11-14 17:37:44,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:37:44,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:37:44,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:44,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:37:44,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:45,198 INFO L256 TraceCheckUtils]: 0: Hoare triple {3185#true} call ULTIMATE.init(); {3185#true} is VALID [2018-11-14 17:37:45,198 INFO L273 TraceCheckUtils]: 1: Hoare triple {3185#true} assume true; {3185#true} is VALID [2018-11-14 17:37:45,199 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3185#true} {3185#true} #62#return; {3185#true} is VALID [2018-11-14 17:37:45,199 INFO L256 TraceCheckUtils]: 3: Hoare triple {3185#true} call #t~ret3 := main(); {3185#true} is VALID [2018-11-14 17:37:45,199 INFO L273 TraceCheckUtils]: 4: Hoare triple {3185#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {3185#true} is VALID [2018-11-14 17:37:45,199 INFO L273 TraceCheckUtils]: 5: Hoare triple {3185#true} assume true; {3185#true} is VALID [2018-11-14 17:37:45,199 INFO L273 TraceCheckUtils]: 6: Hoare triple {3185#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {3185#true} is VALID [2018-11-14 17:37:45,200 INFO L273 TraceCheckUtils]: 7: Hoare triple {3185#true} assume true; {3185#true} is VALID [2018-11-14 17:37:45,201 INFO L273 TraceCheckUtils]: 8: Hoare triple {3185#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {3187#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:37:45,201 INFO L273 TraceCheckUtils]: 9: Hoare triple {3187#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume true; {3187#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:37:45,202 INFO L273 TraceCheckUtils]: 10: Hoare triple {3187#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {3188#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:37:45,202 INFO L273 TraceCheckUtils]: 11: Hoare triple {3188#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume true; {3188#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:37:45,203 INFO L273 TraceCheckUtils]: 12: Hoare triple {3188#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {3189#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:37:45,204 INFO L273 TraceCheckUtils]: 13: Hoare triple {3189#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume true; {3189#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:37:45,205 INFO L273 TraceCheckUtils]: 14: Hoare triple {3189#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {3190#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:37:45,205 INFO L273 TraceCheckUtils]: 15: Hoare triple {3190#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume true; {3190#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:37:45,206 INFO L273 TraceCheckUtils]: 16: Hoare triple {3190#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {3191#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:37:45,207 INFO L273 TraceCheckUtils]: 17: Hoare triple {3191#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume true; {3191#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:37:45,208 INFO L273 TraceCheckUtils]: 18: Hoare triple {3191#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {3192#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2018-11-14 17:37:45,208 INFO L273 TraceCheckUtils]: 19: Hoare triple {3192#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume true; {3192#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2018-11-14 17:37:45,209 INFO L273 TraceCheckUtils]: 20: Hoare triple {3192#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {3193#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2018-11-14 17:37:45,210 INFO L273 TraceCheckUtils]: 21: Hoare triple {3193#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume true; {3193#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2018-11-14 17:37:45,211 INFO L273 TraceCheckUtils]: 22: Hoare triple {3193#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {3194#(and (<= 7 main_~z~0) (<= main_~z~0 7))} is VALID [2018-11-14 17:37:45,212 INFO L273 TraceCheckUtils]: 23: Hoare triple {3194#(and (<= 7 main_~z~0) (<= main_~z~0 7))} assume true; {3194#(and (<= 7 main_~z~0) (<= main_~z~0 7))} is VALID [2018-11-14 17:37:45,213 INFO L273 TraceCheckUtils]: 24: Hoare triple {3194#(and (<= 7 main_~z~0) (<= main_~z~0 7))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {3195#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2018-11-14 17:37:45,213 INFO L273 TraceCheckUtils]: 25: Hoare triple {3195#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume true; {3195#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2018-11-14 17:37:45,214 INFO L273 TraceCheckUtils]: 26: Hoare triple {3195#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {3196#(and (<= main_~z~0 9) (< 0 (+ (div main_~z~0 4294967296) 1)))} is VALID [2018-11-14 17:37:45,215 INFO L273 TraceCheckUtils]: 27: Hoare triple {3196#(and (<= main_~z~0 9) (< 0 (+ (div main_~z~0 4294967296) 1)))} assume true; {3196#(and (<= main_~z~0 9) (< 0 (+ (div main_~z~0 4294967296) 1)))} is VALID [2018-11-14 17:37:45,216 INFO L273 TraceCheckUtils]: 28: Hoare triple {3196#(and (<= main_~z~0 9) (< 0 (+ (div main_~z~0 4294967296) 1)))} assume !(~z~0 % 4294967296 < 268435455); {3186#false} is VALID [2018-11-14 17:37:45,216 INFO L256 TraceCheckUtils]: 29: Hoare triple {3186#false} call __VERIFIER_assert((if (if ~z~0 % 4294967296 < 0 && ~z~0 % 4294967296 % 4 != 0 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 == 0 then 1 else 0)); {3186#false} is VALID [2018-11-14 17:37:45,216 INFO L273 TraceCheckUtils]: 30: Hoare triple {3186#false} ~cond := #in~cond; {3186#false} is VALID [2018-11-14 17:37:45,217 INFO L273 TraceCheckUtils]: 31: Hoare triple {3186#false} assume ~cond == 0; {3186#false} is VALID [2018-11-14 17:37:45,217 INFO L273 TraceCheckUtils]: 32: Hoare triple {3186#false} assume !false; {3186#false} is VALID [2018-11-14 17:37:45,219 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:37:45,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:37:45,219 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:37:45,229 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:37:45,289 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-14 17:37:45,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:37:45,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:45,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:37:45,388 INFO L256 TraceCheckUtils]: 0: Hoare triple {3185#true} call ULTIMATE.init(); {3185#true} is VALID [2018-11-14 17:37:45,389 INFO L273 TraceCheckUtils]: 1: Hoare triple {3185#true} assume true; {3185#true} is VALID [2018-11-14 17:37:45,389 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3185#true} {3185#true} #62#return; {3185#true} is VALID [2018-11-14 17:37:45,389 INFO L256 TraceCheckUtils]: 3: Hoare triple {3185#true} call #t~ret3 := main(); {3185#true} is VALID [2018-11-14 17:37:45,389 INFO L273 TraceCheckUtils]: 4: Hoare triple {3185#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {3185#true} is VALID [2018-11-14 17:37:45,390 INFO L273 TraceCheckUtils]: 5: Hoare triple {3185#true} assume true; {3185#true} is VALID [2018-11-14 17:37:45,390 INFO L273 TraceCheckUtils]: 6: Hoare triple {3185#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {3185#true} is VALID [2018-11-14 17:37:45,390 INFO L273 TraceCheckUtils]: 7: Hoare triple {3185#true} assume true; {3185#true} is VALID [2018-11-14 17:37:45,391 INFO L273 TraceCheckUtils]: 8: Hoare triple {3185#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {3187#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:37:45,391 INFO L273 TraceCheckUtils]: 9: Hoare triple {3187#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume true; {3187#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:37:45,392 INFO L273 TraceCheckUtils]: 10: Hoare triple {3187#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {3188#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:37:45,392 INFO L273 TraceCheckUtils]: 11: Hoare triple {3188#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume true; {3188#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:37:45,393 INFO L273 TraceCheckUtils]: 12: Hoare triple {3188#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {3189#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:37:45,393 INFO L273 TraceCheckUtils]: 13: Hoare triple {3189#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume true; {3189#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:37:45,394 INFO L273 TraceCheckUtils]: 14: Hoare triple {3189#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {3190#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:37:45,395 INFO L273 TraceCheckUtils]: 15: Hoare triple {3190#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume true; {3190#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:37:45,396 INFO L273 TraceCheckUtils]: 16: Hoare triple {3190#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {3191#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:37:45,397 INFO L273 TraceCheckUtils]: 17: Hoare triple {3191#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume true; {3191#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:37:45,398 INFO L273 TraceCheckUtils]: 18: Hoare triple {3191#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {3192#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2018-11-14 17:37:45,398 INFO L273 TraceCheckUtils]: 19: Hoare triple {3192#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume true; {3192#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2018-11-14 17:37:45,399 INFO L273 TraceCheckUtils]: 20: Hoare triple {3192#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {3193#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2018-11-14 17:37:45,400 INFO L273 TraceCheckUtils]: 21: Hoare triple {3193#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume true; {3193#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2018-11-14 17:37:45,401 INFO L273 TraceCheckUtils]: 22: Hoare triple {3193#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {3194#(and (<= 7 main_~z~0) (<= main_~z~0 7))} is VALID [2018-11-14 17:37:45,401 INFO L273 TraceCheckUtils]: 23: Hoare triple {3194#(and (<= 7 main_~z~0) (<= main_~z~0 7))} assume true; {3194#(and (<= 7 main_~z~0) (<= main_~z~0 7))} is VALID [2018-11-14 17:37:45,402 INFO L273 TraceCheckUtils]: 24: Hoare triple {3194#(and (<= 7 main_~z~0) (<= main_~z~0 7))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {3195#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2018-11-14 17:37:45,403 INFO L273 TraceCheckUtils]: 25: Hoare triple {3195#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume true; {3195#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2018-11-14 17:37:45,404 INFO L273 TraceCheckUtils]: 26: Hoare triple {3195#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {3278#(and (<= main_~z~0 9) (<= 9 main_~z~0))} is VALID [2018-11-14 17:37:45,405 INFO L273 TraceCheckUtils]: 27: Hoare triple {3278#(and (<= main_~z~0 9) (<= 9 main_~z~0))} assume true; {3278#(and (<= main_~z~0 9) (<= 9 main_~z~0))} is VALID [2018-11-14 17:37:45,405 INFO L273 TraceCheckUtils]: 28: Hoare triple {3278#(and (<= main_~z~0 9) (<= 9 main_~z~0))} assume !(~z~0 % 4294967296 < 268435455); {3186#false} is VALID [2018-11-14 17:37:45,406 INFO L256 TraceCheckUtils]: 29: Hoare triple {3186#false} call __VERIFIER_assert((if (if ~z~0 % 4294967296 < 0 && ~z~0 % 4294967296 % 4 != 0 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 == 0 then 1 else 0)); {3186#false} is VALID [2018-11-14 17:37:45,406 INFO L273 TraceCheckUtils]: 30: Hoare triple {3186#false} ~cond := #in~cond; {3186#false} is VALID [2018-11-14 17:37:45,406 INFO L273 TraceCheckUtils]: 31: Hoare triple {3186#false} assume ~cond == 0; {3186#false} is VALID [2018-11-14 17:37:45,406 INFO L273 TraceCheckUtils]: 32: Hoare triple {3186#false} assume !false; {3186#false} is VALID [2018-11-14 17:37:45,409 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:37:45,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:37:45,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-14 17:37:45,429 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-11-14 17:37:45,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:37:45,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-14 17:37:45,469 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:45,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-14 17:37:45,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-14 17:37:45,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-14 17:37:45,470 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 13 states. [2018-11-14 17:37:46,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:46,091 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2018-11-14 17:37:46,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 17:37:46,091 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-11-14 17:37:46,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:37:46,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 17:37:46,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 72 transitions. [2018-11-14 17:37:46,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 17:37:46,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 72 transitions. [2018-11-14 17:37:46,095 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 72 transitions. [2018-11-14 17:37:46,183 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:46,184 INFO L225 Difference]: With dead ends: 85 [2018-11-14 17:37:46,184 INFO L226 Difference]: Without dead ends: 48 [2018-11-14 17:37:46,184 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-14 17:37:46,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-14 17:37:46,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-11-14 17:37:46,223 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:37:46,223 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 46 states. [2018-11-14 17:37:46,223 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 46 states. [2018-11-14 17:37:46,224 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 46 states. [2018-11-14 17:37:46,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:46,226 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-11-14 17:37:46,226 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-11-14 17:37:46,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:46,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:46,227 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 48 states. [2018-11-14 17:37:46,227 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 48 states. [2018-11-14 17:37:46,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:46,228 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-11-14 17:37:46,228 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-11-14 17:37:46,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:46,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:46,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:37:46,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:37:46,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-14 17:37:46,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-11-14 17:37:46,231 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 33 [2018-11-14 17:37:46,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:37:46,231 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-11-14 17:37:46,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-14 17:37:46,231 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-14 17:37:46,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-14 17:37:46,232 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:37:46,232 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:37:46,232 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:37:46,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:37:46,233 INFO L82 PathProgramCache]: Analyzing trace with hash -486660098, now seen corresponding path program 10 times [2018-11-14 17:37:46,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:37:46,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:37:46,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:46,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:37:46,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:46,580 INFO L256 TraceCheckUtils]: 0: Hoare triple {3587#true} call ULTIMATE.init(); {3587#true} is VALID [2018-11-14 17:37:46,580 INFO L273 TraceCheckUtils]: 1: Hoare triple {3587#true} assume true; {3587#true} is VALID [2018-11-14 17:37:46,580 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3587#true} {3587#true} #62#return; {3587#true} is VALID [2018-11-14 17:37:46,581 INFO L256 TraceCheckUtils]: 3: Hoare triple {3587#true} call #t~ret3 := main(); {3587#true} is VALID [2018-11-14 17:37:46,581 INFO L273 TraceCheckUtils]: 4: Hoare triple {3587#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {3587#true} is VALID [2018-11-14 17:37:46,581 INFO L273 TraceCheckUtils]: 5: Hoare triple {3587#true} assume true; {3587#true} is VALID [2018-11-14 17:37:46,582 INFO L273 TraceCheckUtils]: 6: Hoare triple {3587#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {3587#true} is VALID [2018-11-14 17:37:46,582 INFO L273 TraceCheckUtils]: 7: Hoare triple {3587#true} assume true; {3587#true} is VALID [2018-11-14 17:37:46,583 INFO L273 TraceCheckUtils]: 8: Hoare triple {3587#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {3589#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:37:46,583 INFO L273 TraceCheckUtils]: 9: Hoare triple {3589#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume true; {3589#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:37:46,584 INFO L273 TraceCheckUtils]: 10: Hoare triple {3589#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {3590#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:37:46,584 INFO L273 TraceCheckUtils]: 11: Hoare triple {3590#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume true; {3590#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:37:46,585 INFO L273 TraceCheckUtils]: 12: Hoare triple {3590#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {3591#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:37:46,602 INFO L273 TraceCheckUtils]: 13: Hoare triple {3591#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume true; {3591#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:37:46,604 INFO L273 TraceCheckUtils]: 14: Hoare triple {3591#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {3592#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:37:46,604 INFO L273 TraceCheckUtils]: 15: Hoare triple {3592#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume true; {3592#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:37:46,605 INFO L273 TraceCheckUtils]: 16: Hoare triple {3592#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {3593#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:37:46,605 INFO L273 TraceCheckUtils]: 17: Hoare triple {3593#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume true; {3593#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:37:46,606 INFO L273 TraceCheckUtils]: 18: Hoare triple {3593#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {3594#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2018-11-14 17:37:46,606 INFO L273 TraceCheckUtils]: 19: Hoare triple {3594#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume true; {3594#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2018-11-14 17:37:46,607 INFO L273 TraceCheckUtils]: 20: Hoare triple {3594#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {3595#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2018-11-14 17:37:46,608 INFO L273 TraceCheckUtils]: 21: Hoare triple {3595#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume true; {3595#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2018-11-14 17:37:46,609 INFO L273 TraceCheckUtils]: 22: Hoare triple {3595#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {3596#(and (<= 7 main_~z~0) (<= main_~z~0 7))} is VALID [2018-11-14 17:37:46,610 INFO L273 TraceCheckUtils]: 23: Hoare triple {3596#(and (<= 7 main_~z~0) (<= main_~z~0 7))} assume true; {3596#(and (<= 7 main_~z~0) (<= main_~z~0 7))} is VALID [2018-11-14 17:37:46,611 INFO L273 TraceCheckUtils]: 24: Hoare triple {3596#(and (<= 7 main_~z~0) (<= main_~z~0 7))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {3597#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2018-11-14 17:37:46,612 INFO L273 TraceCheckUtils]: 25: Hoare triple {3597#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume true; {3597#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2018-11-14 17:37:46,613 INFO L273 TraceCheckUtils]: 26: Hoare triple {3597#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {3598#(and (<= main_~z~0 9) (<= 9 main_~z~0))} is VALID [2018-11-14 17:37:46,614 INFO L273 TraceCheckUtils]: 27: Hoare triple {3598#(and (<= main_~z~0 9) (<= 9 main_~z~0))} assume true; {3598#(and (<= main_~z~0 9) (<= 9 main_~z~0))} is VALID [2018-11-14 17:37:46,615 INFO L273 TraceCheckUtils]: 28: Hoare triple {3598#(and (<= main_~z~0 9) (<= 9 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {3599#(and (<= main_~z~0 10) (< 0 (+ (div main_~z~0 4294967296) 1)))} is VALID [2018-11-14 17:37:46,616 INFO L273 TraceCheckUtils]: 29: Hoare triple {3599#(and (<= main_~z~0 10) (< 0 (+ (div main_~z~0 4294967296) 1)))} assume true; {3599#(and (<= main_~z~0 10) (< 0 (+ (div main_~z~0 4294967296) 1)))} is VALID [2018-11-14 17:37:46,617 INFO L273 TraceCheckUtils]: 30: Hoare triple {3599#(and (<= main_~z~0 10) (< 0 (+ (div main_~z~0 4294967296) 1)))} assume !(~z~0 % 4294967296 < 268435455); {3588#false} is VALID [2018-11-14 17:37:46,617 INFO L256 TraceCheckUtils]: 31: Hoare triple {3588#false} call __VERIFIER_assert((if (if ~z~0 % 4294967296 < 0 && ~z~0 % 4294967296 % 4 != 0 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 == 0 then 1 else 0)); {3588#false} is VALID [2018-11-14 17:37:46,618 INFO L273 TraceCheckUtils]: 32: Hoare triple {3588#false} ~cond := #in~cond; {3588#false} is VALID [2018-11-14 17:37:46,618 INFO L273 TraceCheckUtils]: 33: Hoare triple {3588#false} assume ~cond == 0; {3588#false} is VALID [2018-11-14 17:37:46,618 INFO L273 TraceCheckUtils]: 34: Hoare triple {3588#false} assume !false; {3588#false} is VALID [2018-11-14 17:37:46,621 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:37:46,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:37:46,621 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:37:46,631 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:37:46,642 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:37:46,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:37:46,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:46,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:37:46,805 INFO L256 TraceCheckUtils]: 0: Hoare triple {3587#true} call ULTIMATE.init(); {3587#true} is VALID [2018-11-14 17:37:46,805 INFO L273 TraceCheckUtils]: 1: Hoare triple {3587#true} assume true; {3587#true} is VALID [2018-11-14 17:37:46,805 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3587#true} {3587#true} #62#return; {3587#true} is VALID [2018-11-14 17:37:46,805 INFO L256 TraceCheckUtils]: 3: Hoare triple {3587#true} call #t~ret3 := main(); {3587#true} is VALID [2018-11-14 17:37:46,806 INFO L273 TraceCheckUtils]: 4: Hoare triple {3587#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {3587#true} is VALID [2018-11-14 17:37:46,806 INFO L273 TraceCheckUtils]: 5: Hoare triple {3587#true} assume true; {3587#true} is VALID [2018-11-14 17:37:46,806 INFO L273 TraceCheckUtils]: 6: Hoare triple {3587#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {3587#true} is VALID [2018-11-14 17:37:46,806 INFO L273 TraceCheckUtils]: 7: Hoare triple {3587#true} assume true; {3587#true} is VALID [2018-11-14 17:37:46,807 INFO L273 TraceCheckUtils]: 8: Hoare triple {3587#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {3589#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:37:46,807 INFO L273 TraceCheckUtils]: 9: Hoare triple {3589#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume true; {3589#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:37:46,808 INFO L273 TraceCheckUtils]: 10: Hoare triple {3589#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {3590#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:37:46,809 INFO L273 TraceCheckUtils]: 11: Hoare triple {3590#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume true; {3590#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:37:46,809 INFO L273 TraceCheckUtils]: 12: Hoare triple {3590#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {3591#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:37:46,810 INFO L273 TraceCheckUtils]: 13: Hoare triple {3591#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume true; {3591#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:37:46,810 INFO L273 TraceCheckUtils]: 14: Hoare triple {3591#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {3592#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:37:46,811 INFO L273 TraceCheckUtils]: 15: Hoare triple {3592#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume true; {3592#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:37:46,812 INFO L273 TraceCheckUtils]: 16: Hoare triple {3592#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {3593#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:37:46,813 INFO L273 TraceCheckUtils]: 17: Hoare triple {3593#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume true; {3593#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:37:46,814 INFO L273 TraceCheckUtils]: 18: Hoare triple {3593#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {3594#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2018-11-14 17:37:46,814 INFO L273 TraceCheckUtils]: 19: Hoare triple {3594#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume true; {3594#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2018-11-14 17:37:46,815 INFO L273 TraceCheckUtils]: 20: Hoare triple {3594#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {3595#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2018-11-14 17:37:46,816 INFO L273 TraceCheckUtils]: 21: Hoare triple {3595#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume true; {3595#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2018-11-14 17:37:46,817 INFO L273 TraceCheckUtils]: 22: Hoare triple {3595#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {3596#(and (<= 7 main_~z~0) (<= main_~z~0 7))} is VALID [2018-11-14 17:37:46,818 INFO L273 TraceCheckUtils]: 23: Hoare triple {3596#(and (<= 7 main_~z~0) (<= main_~z~0 7))} assume true; {3596#(and (<= 7 main_~z~0) (<= main_~z~0 7))} is VALID [2018-11-14 17:37:46,819 INFO L273 TraceCheckUtils]: 24: Hoare triple {3596#(and (<= 7 main_~z~0) (<= main_~z~0 7))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {3597#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2018-11-14 17:37:46,820 INFO L273 TraceCheckUtils]: 25: Hoare triple {3597#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume true; {3597#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2018-11-14 17:37:46,821 INFO L273 TraceCheckUtils]: 26: Hoare triple {3597#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {3598#(and (<= main_~z~0 9) (<= 9 main_~z~0))} is VALID [2018-11-14 17:37:46,821 INFO L273 TraceCheckUtils]: 27: Hoare triple {3598#(and (<= main_~z~0 9) (<= 9 main_~z~0))} assume true; {3598#(and (<= main_~z~0 9) (<= 9 main_~z~0))} is VALID [2018-11-14 17:37:46,822 INFO L273 TraceCheckUtils]: 28: Hoare triple {3598#(and (<= main_~z~0 9) (<= 9 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {3687#(and (<= 10 main_~z~0) (<= main_~z~0 10))} is VALID [2018-11-14 17:37:46,823 INFO L273 TraceCheckUtils]: 29: Hoare triple {3687#(and (<= 10 main_~z~0) (<= main_~z~0 10))} assume true; {3687#(and (<= 10 main_~z~0) (<= main_~z~0 10))} is VALID [2018-11-14 17:37:46,824 INFO L273 TraceCheckUtils]: 30: Hoare triple {3687#(and (<= 10 main_~z~0) (<= main_~z~0 10))} assume !(~z~0 % 4294967296 < 268435455); {3588#false} is VALID [2018-11-14 17:37:46,824 INFO L256 TraceCheckUtils]: 31: Hoare triple {3588#false} call __VERIFIER_assert((if (if ~z~0 % 4294967296 < 0 && ~z~0 % 4294967296 % 4 != 0 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 == 0 then 1 else 0)); {3588#false} is VALID [2018-11-14 17:37:46,824 INFO L273 TraceCheckUtils]: 32: Hoare triple {3588#false} ~cond := #in~cond; {3588#false} is VALID [2018-11-14 17:37:46,825 INFO L273 TraceCheckUtils]: 33: Hoare triple {3588#false} assume ~cond == 0; {3588#false} is VALID [2018-11-14 17:37:46,825 INFO L273 TraceCheckUtils]: 34: Hoare triple {3588#false} assume !false; {3588#false} is VALID [2018-11-14 17:37:46,827 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:37:46,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:37:46,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-14 17:37:46,849 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2018-11-14 17:37:46,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:37:46,849 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 17:37:46,882 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:46,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 17:37:46,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 17:37:46,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-14 17:37:46,883 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 14 states. [2018-11-14 17:37:47,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:47,692 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2018-11-14 17:37:47,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 17:37:47,692 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2018-11-14 17:37:47,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:37:47,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 17:37:47,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2018-11-14 17:37:47,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 17:37:47,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2018-11-14 17:37:47,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 74 transitions. [2018-11-14 17:37:48,146 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 17:37:48,147 INFO L225 Difference]: With dead ends: 89 [2018-11-14 17:37:48,148 INFO L226 Difference]: Without dead ends: 50 [2018-11-14 17:37:48,148 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-14 17:37:48,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-14 17:37:48,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-11-14 17:37:48,176 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:37:48,176 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 48 states. [2018-11-14 17:37:48,176 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 48 states. [2018-11-14 17:37:48,176 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 48 states. [2018-11-14 17:37:48,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:48,178 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-11-14 17:37:48,178 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-14 17:37:48,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:48,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:48,179 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 50 states. [2018-11-14 17:37:48,179 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 50 states. [2018-11-14 17:37:48,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:48,180 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-11-14 17:37:48,181 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-14 17:37:48,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:48,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:48,181 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:37:48,181 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:37:48,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 17:37:48,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-11-14 17:37:48,183 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 35 [2018-11-14 17:37:48,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:37:48,183 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-11-14 17:37:48,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 17:37:48,183 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-11-14 17:37:48,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-14 17:37:48,184 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:37:48,184 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:37:48,184 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:37:48,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:37:48,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1170540868, now seen corresponding path program 11 times [2018-11-14 17:37:48,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:37:48,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:37:48,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:48,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:37:48,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:48,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:48,478 INFO L256 TraceCheckUtils]: 0: Hoare triple {4009#true} call ULTIMATE.init(); {4009#true} is VALID [2018-11-14 17:37:48,478 INFO L273 TraceCheckUtils]: 1: Hoare triple {4009#true} assume true; {4009#true} is VALID [2018-11-14 17:37:48,479 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4009#true} {4009#true} #62#return; {4009#true} is VALID [2018-11-14 17:37:48,479 INFO L256 TraceCheckUtils]: 3: Hoare triple {4009#true} call #t~ret3 := main(); {4009#true} is VALID [2018-11-14 17:37:48,479 INFO L273 TraceCheckUtils]: 4: Hoare triple {4009#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {4009#true} is VALID [2018-11-14 17:37:48,479 INFO L273 TraceCheckUtils]: 5: Hoare triple {4009#true} assume true; {4009#true} is VALID [2018-11-14 17:37:48,479 INFO L273 TraceCheckUtils]: 6: Hoare triple {4009#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {4009#true} is VALID [2018-11-14 17:37:48,480 INFO L273 TraceCheckUtils]: 7: Hoare triple {4009#true} assume true; {4009#true} is VALID [2018-11-14 17:37:48,480 INFO L273 TraceCheckUtils]: 8: Hoare triple {4009#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {4011#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:37:48,481 INFO L273 TraceCheckUtils]: 9: Hoare triple {4011#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume true; {4011#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:37:48,481 INFO L273 TraceCheckUtils]: 10: Hoare triple {4011#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4012#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:37:48,482 INFO L273 TraceCheckUtils]: 11: Hoare triple {4012#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume true; {4012#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:37:48,482 INFO L273 TraceCheckUtils]: 12: Hoare triple {4012#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4013#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:37:48,483 INFO L273 TraceCheckUtils]: 13: Hoare triple {4013#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume true; {4013#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:37:48,484 INFO L273 TraceCheckUtils]: 14: Hoare triple {4013#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4014#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:37:48,484 INFO L273 TraceCheckUtils]: 15: Hoare triple {4014#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume true; {4014#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:37:48,485 INFO L273 TraceCheckUtils]: 16: Hoare triple {4014#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4015#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:37:48,486 INFO L273 TraceCheckUtils]: 17: Hoare triple {4015#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume true; {4015#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:37:48,487 INFO L273 TraceCheckUtils]: 18: Hoare triple {4015#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4016#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2018-11-14 17:37:48,488 INFO L273 TraceCheckUtils]: 19: Hoare triple {4016#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume true; {4016#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2018-11-14 17:37:48,489 INFO L273 TraceCheckUtils]: 20: Hoare triple {4016#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4017#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2018-11-14 17:37:48,489 INFO L273 TraceCheckUtils]: 21: Hoare triple {4017#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume true; {4017#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2018-11-14 17:37:48,490 INFO L273 TraceCheckUtils]: 22: Hoare triple {4017#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4018#(and (<= 7 main_~z~0) (<= main_~z~0 7))} is VALID [2018-11-14 17:37:48,491 INFO L273 TraceCheckUtils]: 23: Hoare triple {4018#(and (<= 7 main_~z~0) (<= main_~z~0 7))} assume true; {4018#(and (<= 7 main_~z~0) (<= main_~z~0 7))} is VALID [2018-11-14 17:37:48,492 INFO L273 TraceCheckUtils]: 24: Hoare triple {4018#(and (<= 7 main_~z~0) (<= main_~z~0 7))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4019#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2018-11-14 17:37:48,493 INFO L273 TraceCheckUtils]: 25: Hoare triple {4019#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume true; {4019#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2018-11-14 17:37:48,494 INFO L273 TraceCheckUtils]: 26: Hoare triple {4019#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4020#(and (<= main_~z~0 9) (<= 9 main_~z~0))} is VALID [2018-11-14 17:37:48,494 INFO L273 TraceCheckUtils]: 27: Hoare triple {4020#(and (<= main_~z~0 9) (<= 9 main_~z~0))} assume true; {4020#(and (<= main_~z~0 9) (<= 9 main_~z~0))} is VALID [2018-11-14 17:37:48,495 INFO L273 TraceCheckUtils]: 28: Hoare triple {4020#(and (<= main_~z~0 9) (<= 9 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4021#(and (<= 10 main_~z~0) (<= main_~z~0 10))} is VALID [2018-11-14 17:37:48,496 INFO L273 TraceCheckUtils]: 29: Hoare triple {4021#(and (<= 10 main_~z~0) (<= main_~z~0 10))} assume true; {4021#(and (<= 10 main_~z~0) (<= main_~z~0 10))} is VALID [2018-11-14 17:37:48,497 INFO L273 TraceCheckUtils]: 30: Hoare triple {4021#(and (<= 10 main_~z~0) (<= main_~z~0 10))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4022#(and (< 0 (+ (div main_~z~0 4294967296) 1)) (<= main_~z~0 11))} is VALID [2018-11-14 17:37:48,498 INFO L273 TraceCheckUtils]: 31: Hoare triple {4022#(and (< 0 (+ (div main_~z~0 4294967296) 1)) (<= main_~z~0 11))} assume true; {4022#(and (< 0 (+ (div main_~z~0 4294967296) 1)) (<= main_~z~0 11))} is VALID [2018-11-14 17:37:48,499 INFO L273 TraceCheckUtils]: 32: Hoare triple {4022#(and (< 0 (+ (div main_~z~0 4294967296) 1)) (<= main_~z~0 11))} assume !(~z~0 % 4294967296 < 268435455); {4010#false} is VALID [2018-11-14 17:37:48,499 INFO L256 TraceCheckUtils]: 33: Hoare triple {4010#false} call __VERIFIER_assert((if (if ~z~0 % 4294967296 < 0 && ~z~0 % 4294967296 % 4 != 0 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 == 0 then 1 else 0)); {4010#false} is VALID [2018-11-14 17:37:48,499 INFO L273 TraceCheckUtils]: 34: Hoare triple {4010#false} ~cond := #in~cond; {4010#false} is VALID [2018-11-14 17:37:48,499 INFO L273 TraceCheckUtils]: 35: Hoare triple {4010#false} assume ~cond == 0; {4010#false} is VALID [2018-11-14 17:37:48,500 INFO L273 TraceCheckUtils]: 36: Hoare triple {4010#false} assume !false; {4010#false} is VALID [2018-11-14 17:37:48,502 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:37:48,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:37:48,502 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:37:48,514 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 17:37:51,564 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-14 17:37:51,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:37:51,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:51,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:37:51,719 INFO L256 TraceCheckUtils]: 0: Hoare triple {4009#true} call ULTIMATE.init(); {4009#true} is VALID [2018-11-14 17:37:51,719 INFO L273 TraceCheckUtils]: 1: Hoare triple {4009#true} assume true; {4009#true} is VALID [2018-11-14 17:37:51,720 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4009#true} {4009#true} #62#return; {4009#true} is VALID [2018-11-14 17:37:51,720 INFO L256 TraceCheckUtils]: 3: Hoare triple {4009#true} call #t~ret3 := main(); {4009#true} is VALID [2018-11-14 17:37:51,720 INFO L273 TraceCheckUtils]: 4: Hoare triple {4009#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {4009#true} is VALID [2018-11-14 17:37:51,720 INFO L273 TraceCheckUtils]: 5: Hoare triple {4009#true} assume true; {4009#true} is VALID [2018-11-14 17:37:51,720 INFO L273 TraceCheckUtils]: 6: Hoare triple {4009#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {4009#true} is VALID [2018-11-14 17:37:51,721 INFO L273 TraceCheckUtils]: 7: Hoare triple {4009#true} assume true; {4009#true} is VALID [2018-11-14 17:37:51,722 INFO L273 TraceCheckUtils]: 8: Hoare triple {4009#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {4011#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:37:51,722 INFO L273 TraceCheckUtils]: 9: Hoare triple {4011#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume true; {4011#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:37:51,723 INFO L273 TraceCheckUtils]: 10: Hoare triple {4011#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4012#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:37:51,724 INFO L273 TraceCheckUtils]: 11: Hoare triple {4012#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume true; {4012#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:37:51,724 INFO L273 TraceCheckUtils]: 12: Hoare triple {4012#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4013#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:37:51,725 INFO L273 TraceCheckUtils]: 13: Hoare triple {4013#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume true; {4013#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:37:51,726 INFO L273 TraceCheckUtils]: 14: Hoare triple {4013#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4014#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:37:51,727 INFO L273 TraceCheckUtils]: 15: Hoare triple {4014#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume true; {4014#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:37:51,728 INFO L273 TraceCheckUtils]: 16: Hoare triple {4014#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4015#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:37:51,728 INFO L273 TraceCheckUtils]: 17: Hoare triple {4015#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume true; {4015#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:37:51,729 INFO L273 TraceCheckUtils]: 18: Hoare triple {4015#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4016#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2018-11-14 17:37:51,730 INFO L273 TraceCheckUtils]: 19: Hoare triple {4016#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume true; {4016#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2018-11-14 17:37:51,731 INFO L273 TraceCheckUtils]: 20: Hoare triple {4016#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4017#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2018-11-14 17:37:51,732 INFO L273 TraceCheckUtils]: 21: Hoare triple {4017#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume true; {4017#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2018-11-14 17:37:51,732 INFO L273 TraceCheckUtils]: 22: Hoare triple {4017#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4018#(and (<= 7 main_~z~0) (<= main_~z~0 7))} is VALID [2018-11-14 17:37:51,733 INFO L273 TraceCheckUtils]: 23: Hoare triple {4018#(and (<= 7 main_~z~0) (<= main_~z~0 7))} assume true; {4018#(and (<= 7 main_~z~0) (<= main_~z~0 7))} is VALID [2018-11-14 17:37:51,734 INFO L273 TraceCheckUtils]: 24: Hoare triple {4018#(and (<= 7 main_~z~0) (<= main_~z~0 7))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4019#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2018-11-14 17:37:51,735 INFO L273 TraceCheckUtils]: 25: Hoare triple {4019#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume true; {4019#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2018-11-14 17:37:51,736 INFO L273 TraceCheckUtils]: 26: Hoare triple {4019#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4020#(and (<= main_~z~0 9) (<= 9 main_~z~0))} is VALID [2018-11-14 17:37:51,737 INFO L273 TraceCheckUtils]: 27: Hoare triple {4020#(and (<= main_~z~0 9) (<= 9 main_~z~0))} assume true; {4020#(and (<= main_~z~0 9) (<= 9 main_~z~0))} is VALID [2018-11-14 17:37:51,738 INFO L273 TraceCheckUtils]: 28: Hoare triple {4020#(and (<= main_~z~0 9) (<= 9 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4021#(and (<= 10 main_~z~0) (<= main_~z~0 10))} is VALID [2018-11-14 17:37:51,739 INFO L273 TraceCheckUtils]: 29: Hoare triple {4021#(and (<= 10 main_~z~0) (<= main_~z~0 10))} assume true; {4021#(and (<= 10 main_~z~0) (<= main_~z~0 10))} is VALID [2018-11-14 17:37:51,740 INFO L273 TraceCheckUtils]: 30: Hoare triple {4021#(and (<= 10 main_~z~0) (<= main_~z~0 10))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4116#(and (<= 11 main_~z~0) (<= main_~z~0 11))} is VALID [2018-11-14 17:37:51,740 INFO L273 TraceCheckUtils]: 31: Hoare triple {4116#(and (<= 11 main_~z~0) (<= main_~z~0 11))} assume true; {4116#(and (<= 11 main_~z~0) (<= main_~z~0 11))} is VALID [2018-11-14 17:37:51,741 INFO L273 TraceCheckUtils]: 32: Hoare triple {4116#(and (<= 11 main_~z~0) (<= main_~z~0 11))} assume !(~z~0 % 4294967296 < 268435455); {4010#false} is VALID [2018-11-14 17:37:51,741 INFO L256 TraceCheckUtils]: 33: Hoare triple {4010#false} call __VERIFIER_assert((if (if ~z~0 % 4294967296 < 0 && ~z~0 % 4294967296 % 4 != 0 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 == 0 then 1 else 0)); {4010#false} is VALID [2018-11-14 17:37:51,742 INFO L273 TraceCheckUtils]: 34: Hoare triple {4010#false} ~cond := #in~cond; {4010#false} is VALID [2018-11-14 17:37:51,742 INFO L273 TraceCheckUtils]: 35: Hoare triple {4010#false} assume ~cond == 0; {4010#false} is VALID [2018-11-14 17:37:51,742 INFO L273 TraceCheckUtils]: 36: Hoare triple {4010#false} assume !false; {4010#false} is VALID [2018-11-14 17:37:51,745 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:37:51,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:37:51,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-14 17:37:51,766 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2018-11-14 17:37:51,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:37:51,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-14 17:37:51,802 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:51,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-14 17:37:51,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-14 17:37:51,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-11-14 17:37:51,804 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 15 states. [2018-11-14 17:37:53,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:53,145 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2018-11-14 17:37:53,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 17:37:53,145 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2018-11-14 17:37:53,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:37:53,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 17:37:53,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 76 transitions. [2018-11-14 17:37:53,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 17:37:53,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 76 transitions. [2018-11-14 17:37:53,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 76 transitions. [2018-11-14 17:37:53,293 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:53,295 INFO L225 Difference]: With dead ends: 93 [2018-11-14 17:37:53,295 INFO L226 Difference]: Without dead ends: 52 [2018-11-14 17:37:53,295 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-11-14 17:37:53,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-14 17:37:53,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-11-14 17:37:53,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:37:53,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 50 states. [2018-11-14 17:37:53,338 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 50 states. [2018-11-14 17:37:53,338 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 50 states. [2018-11-14 17:37:53,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:53,340 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-14 17:37:53,340 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-14 17:37:53,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:53,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:53,341 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 52 states. [2018-11-14 17:37:53,341 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 52 states. [2018-11-14 17:37:53,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:53,343 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-14 17:37:53,343 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-14 17:37:53,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:53,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:53,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:37:53,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:37:53,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-14 17:37:53,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-11-14 17:37:53,345 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 37 [2018-11-14 17:37:53,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:37:53,346 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-11-14 17:37:53,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-14 17:37:53,346 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-14 17:37:53,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-14 17:37:53,346 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:37:53,347 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:37:53,347 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:37:53,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:37:53,347 INFO L82 PathProgramCache]: Analyzing trace with hash 307802378, now seen corresponding path program 12 times [2018-11-14 17:37:53,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:37:53,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:37:53,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:53,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:37:53,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:53,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:54,634 INFO L256 TraceCheckUtils]: 0: Hoare triple {4451#true} call ULTIMATE.init(); {4451#true} is VALID [2018-11-14 17:37:54,634 INFO L273 TraceCheckUtils]: 1: Hoare triple {4451#true} assume true; {4451#true} is VALID [2018-11-14 17:37:54,635 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4451#true} {4451#true} #62#return; {4451#true} is VALID [2018-11-14 17:37:54,635 INFO L256 TraceCheckUtils]: 3: Hoare triple {4451#true} call #t~ret3 := main(); {4451#true} is VALID [2018-11-14 17:37:54,635 INFO L273 TraceCheckUtils]: 4: Hoare triple {4451#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {4451#true} is VALID [2018-11-14 17:37:54,635 INFO L273 TraceCheckUtils]: 5: Hoare triple {4451#true} assume true; {4451#true} is VALID [2018-11-14 17:37:54,635 INFO L273 TraceCheckUtils]: 6: Hoare triple {4451#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {4451#true} is VALID [2018-11-14 17:37:54,636 INFO L273 TraceCheckUtils]: 7: Hoare triple {4451#true} assume true; {4451#true} is VALID [2018-11-14 17:37:54,637 INFO L273 TraceCheckUtils]: 8: Hoare triple {4451#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {4453#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:37:54,637 INFO L273 TraceCheckUtils]: 9: Hoare triple {4453#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume true; {4453#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:37:54,638 INFO L273 TraceCheckUtils]: 10: Hoare triple {4453#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4454#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:37:54,638 INFO L273 TraceCheckUtils]: 11: Hoare triple {4454#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume true; {4454#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:37:54,639 INFO L273 TraceCheckUtils]: 12: Hoare triple {4454#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4455#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:37:54,639 INFO L273 TraceCheckUtils]: 13: Hoare triple {4455#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume true; {4455#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:37:54,640 INFO L273 TraceCheckUtils]: 14: Hoare triple {4455#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4456#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:37:54,640 INFO L273 TraceCheckUtils]: 15: Hoare triple {4456#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume true; {4456#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:37:54,641 INFO L273 TraceCheckUtils]: 16: Hoare triple {4456#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4457#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:37:54,642 INFO L273 TraceCheckUtils]: 17: Hoare triple {4457#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume true; {4457#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:37:54,643 INFO L273 TraceCheckUtils]: 18: Hoare triple {4457#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4458#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2018-11-14 17:37:54,661 INFO L273 TraceCheckUtils]: 19: Hoare triple {4458#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume true; {4458#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2018-11-14 17:37:54,670 INFO L273 TraceCheckUtils]: 20: Hoare triple {4458#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4459#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2018-11-14 17:37:54,682 INFO L273 TraceCheckUtils]: 21: Hoare triple {4459#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume true; {4459#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2018-11-14 17:37:54,683 INFO L273 TraceCheckUtils]: 22: Hoare triple {4459#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4460#(and (<= 7 main_~z~0) (<= main_~z~0 7))} is VALID [2018-11-14 17:37:54,683 INFO L273 TraceCheckUtils]: 23: Hoare triple {4460#(and (<= 7 main_~z~0) (<= main_~z~0 7))} assume true; {4460#(and (<= 7 main_~z~0) (<= main_~z~0 7))} is VALID [2018-11-14 17:37:54,684 INFO L273 TraceCheckUtils]: 24: Hoare triple {4460#(and (<= 7 main_~z~0) (<= main_~z~0 7))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4461#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2018-11-14 17:37:54,684 INFO L273 TraceCheckUtils]: 25: Hoare triple {4461#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume true; {4461#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2018-11-14 17:37:54,685 INFO L273 TraceCheckUtils]: 26: Hoare triple {4461#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4462#(and (<= main_~z~0 9) (<= 9 main_~z~0))} is VALID [2018-11-14 17:37:54,686 INFO L273 TraceCheckUtils]: 27: Hoare triple {4462#(and (<= main_~z~0 9) (<= 9 main_~z~0))} assume true; {4462#(and (<= main_~z~0 9) (<= 9 main_~z~0))} is VALID [2018-11-14 17:37:54,687 INFO L273 TraceCheckUtils]: 28: Hoare triple {4462#(and (<= main_~z~0 9) (<= 9 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4463#(and (<= 10 main_~z~0) (<= main_~z~0 10))} is VALID [2018-11-14 17:37:54,687 INFO L273 TraceCheckUtils]: 29: Hoare triple {4463#(and (<= 10 main_~z~0) (<= main_~z~0 10))} assume true; {4463#(and (<= 10 main_~z~0) (<= main_~z~0 10))} is VALID [2018-11-14 17:37:54,688 INFO L273 TraceCheckUtils]: 30: Hoare triple {4463#(and (<= 10 main_~z~0) (<= main_~z~0 10))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4464#(and (<= 11 main_~z~0) (<= main_~z~0 11))} is VALID [2018-11-14 17:37:54,689 INFO L273 TraceCheckUtils]: 31: Hoare triple {4464#(and (<= 11 main_~z~0) (<= main_~z~0 11))} assume true; {4464#(and (<= 11 main_~z~0) (<= main_~z~0 11))} is VALID [2018-11-14 17:37:54,690 INFO L273 TraceCheckUtils]: 32: Hoare triple {4464#(and (<= 11 main_~z~0) (<= main_~z~0 11))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4465#(and (<= main_~z~0 12) (< 0 (+ (div main_~z~0 4294967296) 1)))} is VALID [2018-11-14 17:37:54,691 INFO L273 TraceCheckUtils]: 33: Hoare triple {4465#(and (<= main_~z~0 12) (< 0 (+ (div main_~z~0 4294967296) 1)))} assume true; {4465#(and (<= main_~z~0 12) (< 0 (+ (div main_~z~0 4294967296) 1)))} is VALID [2018-11-14 17:37:54,691 INFO L273 TraceCheckUtils]: 34: Hoare triple {4465#(and (<= main_~z~0 12) (< 0 (+ (div main_~z~0 4294967296) 1)))} assume !(~z~0 % 4294967296 < 268435455); {4452#false} is VALID [2018-11-14 17:37:54,692 INFO L256 TraceCheckUtils]: 35: Hoare triple {4452#false} call __VERIFIER_assert((if (if ~z~0 % 4294967296 < 0 && ~z~0 % 4294967296 % 4 != 0 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 == 0 then 1 else 0)); {4452#false} is VALID [2018-11-14 17:37:54,692 INFO L273 TraceCheckUtils]: 36: Hoare triple {4452#false} ~cond := #in~cond; {4452#false} is VALID [2018-11-14 17:37:54,692 INFO L273 TraceCheckUtils]: 37: Hoare triple {4452#false} assume ~cond == 0; {4452#false} is VALID [2018-11-14 17:37:54,692 INFO L273 TraceCheckUtils]: 38: Hoare triple {4452#false} assume !false; {4452#false} is VALID [2018-11-14 17:37:54,695 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:37:54,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:37:54,695 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:37:54,704 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 17:38:06,809 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-14 17:38:06,809 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:38:06,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:38:06,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:38:07,004 INFO L256 TraceCheckUtils]: 0: Hoare triple {4451#true} call ULTIMATE.init(); {4451#true} is VALID [2018-11-14 17:38:07,004 INFO L273 TraceCheckUtils]: 1: Hoare triple {4451#true} assume true; {4451#true} is VALID [2018-11-14 17:38:07,004 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4451#true} {4451#true} #62#return; {4451#true} is VALID [2018-11-14 17:38:07,004 INFO L256 TraceCheckUtils]: 3: Hoare triple {4451#true} call #t~ret3 := main(); {4451#true} is VALID [2018-11-14 17:38:07,004 INFO L273 TraceCheckUtils]: 4: Hoare triple {4451#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {4451#true} is VALID [2018-11-14 17:38:07,004 INFO L273 TraceCheckUtils]: 5: Hoare triple {4451#true} assume true; {4451#true} is VALID [2018-11-14 17:38:07,005 INFO L273 TraceCheckUtils]: 6: Hoare triple {4451#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {4451#true} is VALID [2018-11-14 17:38:07,005 INFO L273 TraceCheckUtils]: 7: Hoare triple {4451#true} assume true; {4451#true} is VALID [2018-11-14 17:38:07,005 INFO L273 TraceCheckUtils]: 8: Hoare triple {4451#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {4453#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:38:07,005 INFO L273 TraceCheckUtils]: 9: Hoare triple {4453#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume true; {4453#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:38:07,006 INFO L273 TraceCheckUtils]: 10: Hoare triple {4453#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4454#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:38:07,007 INFO L273 TraceCheckUtils]: 11: Hoare triple {4454#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume true; {4454#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:38:07,007 INFO L273 TraceCheckUtils]: 12: Hoare triple {4454#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4455#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:38:07,007 INFO L273 TraceCheckUtils]: 13: Hoare triple {4455#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume true; {4455#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:38:07,008 INFO L273 TraceCheckUtils]: 14: Hoare triple {4455#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4456#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:38:07,009 INFO L273 TraceCheckUtils]: 15: Hoare triple {4456#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume true; {4456#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:38:07,010 INFO L273 TraceCheckUtils]: 16: Hoare triple {4456#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4457#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:38:07,010 INFO L273 TraceCheckUtils]: 17: Hoare triple {4457#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume true; {4457#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:38:07,011 INFO L273 TraceCheckUtils]: 18: Hoare triple {4457#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4458#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2018-11-14 17:38:07,012 INFO L273 TraceCheckUtils]: 19: Hoare triple {4458#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume true; {4458#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2018-11-14 17:38:07,013 INFO L273 TraceCheckUtils]: 20: Hoare triple {4458#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4459#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2018-11-14 17:38:07,013 INFO L273 TraceCheckUtils]: 21: Hoare triple {4459#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume true; {4459#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2018-11-14 17:38:07,014 INFO L273 TraceCheckUtils]: 22: Hoare triple {4459#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4460#(and (<= 7 main_~z~0) (<= main_~z~0 7))} is VALID [2018-11-14 17:38:07,015 INFO L273 TraceCheckUtils]: 23: Hoare triple {4460#(and (<= 7 main_~z~0) (<= main_~z~0 7))} assume true; {4460#(and (<= 7 main_~z~0) (<= main_~z~0 7))} is VALID [2018-11-14 17:38:07,016 INFO L273 TraceCheckUtils]: 24: Hoare triple {4460#(and (<= 7 main_~z~0) (<= main_~z~0 7))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4461#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2018-11-14 17:38:07,016 INFO L273 TraceCheckUtils]: 25: Hoare triple {4461#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume true; {4461#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2018-11-14 17:38:07,017 INFO L273 TraceCheckUtils]: 26: Hoare triple {4461#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4462#(and (<= main_~z~0 9) (<= 9 main_~z~0))} is VALID [2018-11-14 17:38:07,018 INFO L273 TraceCheckUtils]: 27: Hoare triple {4462#(and (<= main_~z~0 9) (<= 9 main_~z~0))} assume true; {4462#(and (<= main_~z~0 9) (<= 9 main_~z~0))} is VALID [2018-11-14 17:38:07,019 INFO L273 TraceCheckUtils]: 28: Hoare triple {4462#(and (<= main_~z~0 9) (<= 9 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4463#(and (<= 10 main_~z~0) (<= main_~z~0 10))} is VALID [2018-11-14 17:38:07,020 INFO L273 TraceCheckUtils]: 29: Hoare triple {4463#(and (<= 10 main_~z~0) (<= main_~z~0 10))} assume true; {4463#(and (<= 10 main_~z~0) (<= main_~z~0 10))} is VALID [2018-11-14 17:38:07,021 INFO L273 TraceCheckUtils]: 30: Hoare triple {4463#(and (<= 10 main_~z~0) (<= main_~z~0 10))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4464#(and (<= 11 main_~z~0) (<= main_~z~0 11))} is VALID [2018-11-14 17:38:07,021 INFO L273 TraceCheckUtils]: 31: Hoare triple {4464#(and (<= 11 main_~z~0) (<= main_~z~0 11))} assume true; {4464#(and (<= 11 main_~z~0) (<= main_~z~0 11))} is VALID [2018-11-14 17:38:07,022 INFO L273 TraceCheckUtils]: 32: Hoare triple {4464#(and (<= 11 main_~z~0) (<= main_~z~0 11))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4565#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2018-11-14 17:38:07,023 INFO L273 TraceCheckUtils]: 33: Hoare triple {4565#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume true; {4565#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2018-11-14 17:38:07,024 INFO L273 TraceCheckUtils]: 34: Hoare triple {4565#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 < 268435455); {4452#false} is VALID [2018-11-14 17:38:07,024 INFO L256 TraceCheckUtils]: 35: Hoare triple {4452#false} call __VERIFIER_assert((if (if ~z~0 % 4294967296 < 0 && ~z~0 % 4294967296 % 4 != 0 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 == 0 then 1 else 0)); {4452#false} is VALID [2018-11-14 17:38:07,024 INFO L273 TraceCheckUtils]: 36: Hoare triple {4452#false} ~cond := #in~cond; {4452#false} is VALID [2018-11-14 17:38:07,024 INFO L273 TraceCheckUtils]: 37: Hoare triple {4452#false} assume ~cond == 0; {4452#false} is VALID [2018-11-14 17:38:07,024 INFO L273 TraceCheckUtils]: 38: Hoare triple {4452#false} assume !false; {4452#false} is VALID [2018-11-14 17:38:07,027 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:38:07,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:38:07,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-14 17:38:07,048 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2018-11-14 17:38:07,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:38:07,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 17:38:07,086 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:38:07,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 17:38:07,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 17:38:07,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-11-14 17:38:07,088 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 16 states. [2018-11-14 17:38:08,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:38:08,061 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2018-11-14 17:38:08,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-14 17:38:08,061 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2018-11-14 17:38:08,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:38:08,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 17:38:08,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 78 transitions. [2018-11-14 17:38:08,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 17:38:08,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 78 transitions. [2018-11-14 17:38:08,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 78 transitions. [2018-11-14 17:38:08,142 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:38:08,144 INFO L225 Difference]: With dead ends: 97 [2018-11-14 17:38:08,144 INFO L226 Difference]: Without dead ends: 54 [2018-11-14 17:38:08,145 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-11-14 17:38:08,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-14 17:38:08,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-11-14 17:38:08,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:38:08,402 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 52 states. [2018-11-14 17:38:08,402 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 52 states. [2018-11-14 17:38:08,402 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 52 states. [2018-11-14 17:38:08,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:38:08,403 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-11-14 17:38:08,403 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-14 17:38:08,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:38:08,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:38:08,404 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 54 states. [2018-11-14 17:38:08,404 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 54 states. [2018-11-14 17:38:08,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:38:08,405 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-11-14 17:38:08,405 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-14 17:38:08,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:38:08,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:38:08,405 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:38:08,405 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:38:08,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-14 17:38:08,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-11-14 17:38:08,407 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 39 [2018-11-14 17:38:08,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:38:08,407 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-11-14 17:38:08,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 17:38:08,407 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-14 17:38:08,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-14 17:38:08,408 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:38:08,408 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:38:08,408 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:38:08,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:38:08,409 INFO L82 PathProgramCache]: Analyzing trace with hash 144801616, now seen corresponding path program 13 times [2018-11-14 17:38:08,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:38:08,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:38:08,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:38:08,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:38:08,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:38:08,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:38:09,079 INFO L256 TraceCheckUtils]: 0: Hoare triple {4913#true} call ULTIMATE.init(); {4913#true} is VALID [2018-11-14 17:38:09,079 INFO L273 TraceCheckUtils]: 1: Hoare triple {4913#true} assume true; {4913#true} is VALID [2018-11-14 17:38:09,079 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4913#true} {4913#true} #62#return; {4913#true} is VALID [2018-11-14 17:38:09,079 INFO L256 TraceCheckUtils]: 3: Hoare triple {4913#true} call #t~ret3 := main(); {4913#true} is VALID [2018-11-14 17:38:09,080 INFO L273 TraceCheckUtils]: 4: Hoare triple {4913#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {4913#true} is VALID [2018-11-14 17:38:09,080 INFO L273 TraceCheckUtils]: 5: Hoare triple {4913#true} assume true; {4913#true} is VALID [2018-11-14 17:38:09,080 INFO L273 TraceCheckUtils]: 6: Hoare triple {4913#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {4913#true} is VALID [2018-11-14 17:38:09,080 INFO L273 TraceCheckUtils]: 7: Hoare triple {4913#true} assume true; {4913#true} is VALID [2018-11-14 17:38:09,081 INFO L273 TraceCheckUtils]: 8: Hoare triple {4913#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {4915#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:38:09,081 INFO L273 TraceCheckUtils]: 9: Hoare triple {4915#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume true; {4915#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:38:09,082 INFO L273 TraceCheckUtils]: 10: Hoare triple {4915#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4916#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:38:09,083 INFO L273 TraceCheckUtils]: 11: Hoare triple {4916#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume true; {4916#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:38:09,084 INFO L273 TraceCheckUtils]: 12: Hoare triple {4916#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4917#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:38:09,084 INFO L273 TraceCheckUtils]: 13: Hoare triple {4917#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume true; {4917#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:38:09,085 INFO L273 TraceCheckUtils]: 14: Hoare triple {4917#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4918#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:38:09,086 INFO L273 TraceCheckUtils]: 15: Hoare triple {4918#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume true; {4918#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:38:09,087 INFO L273 TraceCheckUtils]: 16: Hoare triple {4918#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4919#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:38:09,088 INFO L273 TraceCheckUtils]: 17: Hoare triple {4919#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume true; {4919#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:38:09,088 INFO L273 TraceCheckUtils]: 18: Hoare triple {4919#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4920#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2018-11-14 17:38:09,089 INFO L273 TraceCheckUtils]: 19: Hoare triple {4920#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume true; {4920#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2018-11-14 17:38:09,090 INFO L273 TraceCheckUtils]: 20: Hoare triple {4920#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4921#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2018-11-14 17:38:09,091 INFO L273 TraceCheckUtils]: 21: Hoare triple {4921#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume true; {4921#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2018-11-14 17:38:09,092 INFO L273 TraceCheckUtils]: 22: Hoare triple {4921#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4922#(and (<= 7 main_~z~0) (<= main_~z~0 7))} is VALID [2018-11-14 17:38:09,092 INFO L273 TraceCheckUtils]: 23: Hoare triple {4922#(and (<= 7 main_~z~0) (<= main_~z~0 7))} assume true; {4922#(and (<= 7 main_~z~0) (<= main_~z~0 7))} is VALID [2018-11-14 17:38:09,093 INFO L273 TraceCheckUtils]: 24: Hoare triple {4922#(and (<= 7 main_~z~0) (<= main_~z~0 7))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4923#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2018-11-14 17:38:09,094 INFO L273 TraceCheckUtils]: 25: Hoare triple {4923#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume true; {4923#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2018-11-14 17:38:09,095 INFO L273 TraceCheckUtils]: 26: Hoare triple {4923#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4924#(and (<= main_~z~0 9) (<= 9 main_~z~0))} is VALID [2018-11-14 17:38:09,095 INFO L273 TraceCheckUtils]: 27: Hoare triple {4924#(and (<= main_~z~0 9) (<= 9 main_~z~0))} assume true; {4924#(and (<= main_~z~0 9) (<= 9 main_~z~0))} is VALID [2018-11-14 17:38:09,096 INFO L273 TraceCheckUtils]: 28: Hoare triple {4924#(and (<= main_~z~0 9) (<= 9 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4925#(and (<= 10 main_~z~0) (<= main_~z~0 10))} is VALID [2018-11-14 17:38:09,097 INFO L273 TraceCheckUtils]: 29: Hoare triple {4925#(and (<= 10 main_~z~0) (<= main_~z~0 10))} assume true; {4925#(and (<= 10 main_~z~0) (<= main_~z~0 10))} is VALID [2018-11-14 17:38:09,098 INFO L273 TraceCheckUtils]: 30: Hoare triple {4925#(and (<= 10 main_~z~0) (<= main_~z~0 10))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4926#(and (<= 11 main_~z~0) (<= main_~z~0 11))} is VALID [2018-11-14 17:38:09,098 INFO L273 TraceCheckUtils]: 31: Hoare triple {4926#(and (<= 11 main_~z~0) (<= main_~z~0 11))} assume true; {4926#(and (<= 11 main_~z~0) (<= main_~z~0 11))} is VALID [2018-11-14 17:38:09,099 INFO L273 TraceCheckUtils]: 32: Hoare triple {4926#(and (<= 11 main_~z~0) (<= main_~z~0 11))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4927#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2018-11-14 17:38:09,100 INFO L273 TraceCheckUtils]: 33: Hoare triple {4927#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume true; {4927#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2018-11-14 17:38:09,101 INFO L273 TraceCheckUtils]: 34: Hoare triple {4927#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4928#(and (<= main_~z~0 13) (< 0 (+ (div main_~z~0 4294967296) 1)))} is VALID [2018-11-14 17:38:09,102 INFO L273 TraceCheckUtils]: 35: Hoare triple {4928#(and (<= main_~z~0 13) (< 0 (+ (div main_~z~0 4294967296) 1)))} assume true; {4928#(and (<= main_~z~0 13) (< 0 (+ (div main_~z~0 4294967296) 1)))} is VALID [2018-11-14 17:38:09,103 INFO L273 TraceCheckUtils]: 36: Hoare triple {4928#(and (<= main_~z~0 13) (< 0 (+ (div main_~z~0 4294967296) 1)))} assume !(~z~0 % 4294967296 < 268435455); {4914#false} is VALID [2018-11-14 17:38:09,103 INFO L256 TraceCheckUtils]: 37: Hoare triple {4914#false} call __VERIFIER_assert((if (if ~z~0 % 4294967296 < 0 && ~z~0 % 4294967296 % 4 != 0 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 == 0 then 1 else 0)); {4914#false} is VALID [2018-11-14 17:38:09,103 INFO L273 TraceCheckUtils]: 38: Hoare triple {4914#false} ~cond := #in~cond; {4914#false} is VALID [2018-11-14 17:38:09,103 INFO L273 TraceCheckUtils]: 39: Hoare triple {4914#false} assume ~cond == 0; {4914#false} is VALID [2018-11-14 17:38:09,103 INFO L273 TraceCheckUtils]: 40: Hoare triple {4914#false} assume !false; {4914#false} is VALID [2018-11-14 17:38:09,107 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:38:09,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:38:09,107 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:38:09,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:38:09,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:38:09,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:38:09,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:38:09,296 INFO L256 TraceCheckUtils]: 0: Hoare triple {4913#true} call ULTIMATE.init(); {4913#true} is VALID [2018-11-14 17:38:09,296 INFO L273 TraceCheckUtils]: 1: Hoare triple {4913#true} assume true; {4913#true} is VALID [2018-11-14 17:38:09,297 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4913#true} {4913#true} #62#return; {4913#true} is VALID [2018-11-14 17:38:09,297 INFO L256 TraceCheckUtils]: 3: Hoare triple {4913#true} call #t~ret3 := main(); {4913#true} is VALID [2018-11-14 17:38:09,297 INFO L273 TraceCheckUtils]: 4: Hoare triple {4913#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {4913#true} is VALID [2018-11-14 17:38:09,297 INFO L273 TraceCheckUtils]: 5: Hoare triple {4913#true} assume true; {4913#true} is VALID [2018-11-14 17:38:09,297 INFO L273 TraceCheckUtils]: 6: Hoare triple {4913#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {4913#true} is VALID [2018-11-14 17:38:09,297 INFO L273 TraceCheckUtils]: 7: Hoare triple {4913#true} assume true; {4913#true} is VALID [2018-11-14 17:38:09,298 INFO L273 TraceCheckUtils]: 8: Hoare triple {4913#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {4915#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:38:09,298 INFO L273 TraceCheckUtils]: 9: Hoare triple {4915#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume true; {4915#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:38:09,299 INFO L273 TraceCheckUtils]: 10: Hoare triple {4915#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4916#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:38:09,299 INFO L273 TraceCheckUtils]: 11: Hoare triple {4916#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume true; {4916#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:38:09,300 INFO L273 TraceCheckUtils]: 12: Hoare triple {4916#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4917#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:38:09,300 INFO L273 TraceCheckUtils]: 13: Hoare triple {4917#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume true; {4917#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:38:09,301 INFO L273 TraceCheckUtils]: 14: Hoare triple {4917#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4918#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:38:09,320 INFO L273 TraceCheckUtils]: 15: Hoare triple {4918#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume true; {4918#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:38:09,334 INFO L273 TraceCheckUtils]: 16: Hoare triple {4918#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4919#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:38:09,343 INFO L273 TraceCheckUtils]: 17: Hoare triple {4919#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume true; {4919#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:38:09,356 INFO L273 TraceCheckUtils]: 18: Hoare triple {4919#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4920#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2018-11-14 17:38:09,365 INFO L273 TraceCheckUtils]: 19: Hoare triple {4920#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume true; {4920#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2018-11-14 17:38:09,377 INFO L273 TraceCheckUtils]: 20: Hoare triple {4920#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4921#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2018-11-14 17:38:09,390 INFO L273 TraceCheckUtils]: 21: Hoare triple {4921#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume true; {4921#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2018-11-14 17:38:09,406 INFO L273 TraceCheckUtils]: 22: Hoare triple {4921#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4922#(and (<= 7 main_~z~0) (<= main_~z~0 7))} is VALID [2018-11-14 17:38:09,410 INFO L273 TraceCheckUtils]: 23: Hoare triple {4922#(and (<= 7 main_~z~0) (<= main_~z~0 7))} assume true; {4922#(and (<= 7 main_~z~0) (<= main_~z~0 7))} is VALID [2018-11-14 17:38:09,410 INFO L273 TraceCheckUtils]: 24: Hoare triple {4922#(and (<= 7 main_~z~0) (<= main_~z~0 7))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4923#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2018-11-14 17:38:09,412 INFO L273 TraceCheckUtils]: 25: Hoare triple {4923#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume true; {4923#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2018-11-14 17:38:09,412 INFO L273 TraceCheckUtils]: 26: Hoare triple {4923#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4924#(and (<= main_~z~0 9) (<= 9 main_~z~0))} is VALID [2018-11-14 17:38:09,414 INFO L273 TraceCheckUtils]: 27: Hoare triple {4924#(and (<= main_~z~0 9) (<= 9 main_~z~0))} assume true; {4924#(and (<= main_~z~0 9) (<= 9 main_~z~0))} is VALID [2018-11-14 17:38:09,415 INFO L273 TraceCheckUtils]: 28: Hoare triple {4924#(and (<= main_~z~0 9) (<= 9 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4925#(and (<= 10 main_~z~0) (<= main_~z~0 10))} is VALID [2018-11-14 17:38:09,416 INFO L273 TraceCheckUtils]: 29: Hoare triple {4925#(and (<= 10 main_~z~0) (<= main_~z~0 10))} assume true; {4925#(and (<= 10 main_~z~0) (<= main_~z~0 10))} is VALID [2018-11-14 17:38:09,417 INFO L273 TraceCheckUtils]: 30: Hoare triple {4925#(and (<= 10 main_~z~0) (<= main_~z~0 10))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4926#(and (<= 11 main_~z~0) (<= main_~z~0 11))} is VALID [2018-11-14 17:38:09,418 INFO L273 TraceCheckUtils]: 31: Hoare triple {4926#(and (<= 11 main_~z~0) (<= main_~z~0 11))} assume true; {4926#(and (<= 11 main_~z~0) (<= main_~z~0 11))} is VALID [2018-11-14 17:38:09,419 INFO L273 TraceCheckUtils]: 32: Hoare triple {4926#(and (<= 11 main_~z~0) (<= main_~z~0 11))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {4927#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2018-11-14 17:38:09,420 INFO L273 TraceCheckUtils]: 33: Hoare triple {4927#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume true; {4927#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2018-11-14 17:38:09,421 INFO L273 TraceCheckUtils]: 34: Hoare triple {4927#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5034#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2018-11-14 17:38:09,421 INFO L273 TraceCheckUtils]: 35: Hoare triple {5034#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume true; {5034#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2018-11-14 17:38:09,422 INFO L273 TraceCheckUtils]: 36: Hoare triple {5034#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !(~z~0 % 4294967296 < 268435455); {4914#false} is VALID [2018-11-14 17:38:09,422 INFO L256 TraceCheckUtils]: 37: Hoare triple {4914#false} call __VERIFIER_assert((if (if ~z~0 % 4294967296 < 0 && ~z~0 % 4294967296 % 4 != 0 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 == 0 then 1 else 0)); {4914#false} is VALID [2018-11-14 17:38:09,422 INFO L273 TraceCheckUtils]: 38: Hoare triple {4914#false} ~cond := #in~cond; {4914#false} is VALID [2018-11-14 17:38:09,423 INFO L273 TraceCheckUtils]: 39: Hoare triple {4914#false} assume ~cond == 0; {4914#false} is VALID [2018-11-14 17:38:09,423 INFO L273 TraceCheckUtils]: 40: Hoare triple {4914#false} assume !false; {4914#false} is VALID [2018-11-14 17:38:09,426 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:38:09,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:38:09,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-14 17:38:09,446 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2018-11-14 17:38:09,446 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:38:09,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-14 17:38:09,488 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:38:09,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-14 17:38:09,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-14 17:38:09,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-14 17:38:09,489 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 17 states. [2018-11-14 17:38:10,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:38:10,384 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2018-11-14 17:38:10,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 17:38:10,385 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2018-11-14 17:38:10,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:38:10,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 17:38:10,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 80 transitions. [2018-11-14 17:38:10,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 17:38:10,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 80 transitions. [2018-11-14 17:38:10,389 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 80 transitions. [2018-11-14 17:38:10,784 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:38:10,785 INFO L225 Difference]: With dead ends: 101 [2018-11-14 17:38:10,785 INFO L226 Difference]: Without dead ends: 56 [2018-11-14 17:38:10,786 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-14 17:38:10,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-14 17:38:10,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2018-11-14 17:38:10,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:38:10,826 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 54 states. [2018-11-14 17:38:10,826 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 54 states. [2018-11-14 17:38:10,826 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 54 states. [2018-11-14 17:38:10,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:38:10,827 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2018-11-14 17:38:10,827 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-11-14 17:38:10,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:38:10,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:38:10,828 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 56 states. [2018-11-14 17:38:10,828 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 56 states. [2018-11-14 17:38:10,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:38:10,830 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2018-11-14 17:38:10,830 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-11-14 17:38:10,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:38:10,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:38:10,830 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:38:10,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:38:10,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-14 17:38:10,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-11-14 17:38:10,832 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 41 [2018-11-14 17:38:10,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:38:10,833 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-11-14 17:38:10,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-14 17:38:10,833 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-14 17:38:10,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-14 17:38:10,833 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:38:10,834 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:38:10,834 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:38:10,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:38:10,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1880108010, now seen corresponding path program 14 times [2018-11-14 17:38:10,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:38:10,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:38:10,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:38:10,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:38:10,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:38:10,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:38:11,472 INFO L256 TraceCheckUtils]: 0: Hoare triple {5395#true} call ULTIMATE.init(); {5395#true} is VALID [2018-11-14 17:38:11,472 INFO L273 TraceCheckUtils]: 1: Hoare triple {5395#true} assume true; {5395#true} is VALID [2018-11-14 17:38:11,473 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5395#true} {5395#true} #62#return; {5395#true} is VALID [2018-11-14 17:38:11,473 INFO L256 TraceCheckUtils]: 3: Hoare triple {5395#true} call #t~ret3 := main(); {5395#true} is VALID [2018-11-14 17:38:11,473 INFO L273 TraceCheckUtils]: 4: Hoare triple {5395#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {5395#true} is VALID [2018-11-14 17:38:11,473 INFO L273 TraceCheckUtils]: 5: Hoare triple {5395#true} assume true; {5395#true} is VALID [2018-11-14 17:38:11,474 INFO L273 TraceCheckUtils]: 6: Hoare triple {5395#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {5395#true} is VALID [2018-11-14 17:38:11,474 INFO L273 TraceCheckUtils]: 7: Hoare triple {5395#true} assume true; {5395#true} is VALID [2018-11-14 17:38:11,474 INFO L273 TraceCheckUtils]: 8: Hoare triple {5395#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {5397#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:38:11,475 INFO L273 TraceCheckUtils]: 9: Hoare triple {5397#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume true; {5397#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:38:11,475 INFO L273 TraceCheckUtils]: 10: Hoare triple {5397#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5398#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:38:11,476 INFO L273 TraceCheckUtils]: 11: Hoare triple {5398#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume true; {5398#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:38:11,476 INFO L273 TraceCheckUtils]: 12: Hoare triple {5398#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5399#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:38:11,477 INFO L273 TraceCheckUtils]: 13: Hoare triple {5399#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume true; {5399#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:38:11,477 INFO L273 TraceCheckUtils]: 14: Hoare triple {5399#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5400#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:38:11,478 INFO L273 TraceCheckUtils]: 15: Hoare triple {5400#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume true; {5400#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:38:11,479 INFO L273 TraceCheckUtils]: 16: Hoare triple {5400#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5401#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:38:11,480 INFO L273 TraceCheckUtils]: 17: Hoare triple {5401#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume true; {5401#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:38:11,481 INFO L273 TraceCheckUtils]: 18: Hoare triple {5401#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5402#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2018-11-14 17:38:11,481 INFO L273 TraceCheckUtils]: 19: Hoare triple {5402#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume true; {5402#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2018-11-14 17:38:11,482 INFO L273 TraceCheckUtils]: 20: Hoare triple {5402#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5403#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2018-11-14 17:38:11,483 INFO L273 TraceCheckUtils]: 21: Hoare triple {5403#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume true; {5403#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2018-11-14 17:38:11,484 INFO L273 TraceCheckUtils]: 22: Hoare triple {5403#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5404#(and (<= 7 main_~z~0) (<= main_~z~0 7))} is VALID [2018-11-14 17:38:11,484 INFO L273 TraceCheckUtils]: 23: Hoare triple {5404#(and (<= 7 main_~z~0) (<= main_~z~0 7))} assume true; {5404#(and (<= 7 main_~z~0) (<= main_~z~0 7))} is VALID [2018-11-14 17:38:11,485 INFO L273 TraceCheckUtils]: 24: Hoare triple {5404#(and (<= 7 main_~z~0) (<= main_~z~0 7))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5405#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2018-11-14 17:38:11,486 INFO L273 TraceCheckUtils]: 25: Hoare triple {5405#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume true; {5405#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2018-11-14 17:38:11,487 INFO L273 TraceCheckUtils]: 26: Hoare triple {5405#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5406#(and (<= main_~z~0 9) (<= 9 main_~z~0))} is VALID [2018-11-14 17:38:11,488 INFO L273 TraceCheckUtils]: 27: Hoare triple {5406#(and (<= main_~z~0 9) (<= 9 main_~z~0))} assume true; {5406#(and (<= main_~z~0 9) (<= 9 main_~z~0))} is VALID [2018-11-14 17:38:11,489 INFO L273 TraceCheckUtils]: 28: Hoare triple {5406#(and (<= main_~z~0 9) (<= 9 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5407#(and (<= 10 main_~z~0) (<= main_~z~0 10))} is VALID [2018-11-14 17:38:11,489 INFO L273 TraceCheckUtils]: 29: Hoare triple {5407#(and (<= 10 main_~z~0) (<= main_~z~0 10))} assume true; {5407#(and (<= 10 main_~z~0) (<= main_~z~0 10))} is VALID [2018-11-14 17:38:11,490 INFO L273 TraceCheckUtils]: 30: Hoare triple {5407#(and (<= 10 main_~z~0) (<= main_~z~0 10))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5408#(and (<= 11 main_~z~0) (<= main_~z~0 11))} is VALID [2018-11-14 17:38:11,491 INFO L273 TraceCheckUtils]: 31: Hoare triple {5408#(and (<= 11 main_~z~0) (<= main_~z~0 11))} assume true; {5408#(and (<= 11 main_~z~0) (<= main_~z~0 11))} is VALID [2018-11-14 17:38:11,492 INFO L273 TraceCheckUtils]: 32: Hoare triple {5408#(and (<= 11 main_~z~0) (<= main_~z~0 11))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5409#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2018-11-14 17:38:11,493 INFO L273 TraceCheckUtils]: 33: Hoare triple {5409#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume true; {5409#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2018-11-14 17:38:11,494 INFO L273 TraceCheckUtils]: 34: Hoare triple {5409#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5410#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2018-11-14 17:38:11,494 INFO L273 TraceCheckUtils]: 35: Hoare triple {5410#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume true; {5410#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2018-11-14 17:38:11,495 INFO L273 TraceCheckUtils]: 36: Hoare triple {5410#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5411#(and (<= main_~z~0 14) (< 0 (+ (div main_~z~0 4294967296) 1)))} is VALID [2018-11-14 17:38:11,496 INFO L273 TraceCheckUtils]: 37: Hoare triple {5411#(and (<= main_~z~0 14) (< 0 (+ (div main_~z~0 4294967296) 1)))} assume true; {5411#(and (<= main_~z~0 14) (< 0 (+ (div main_~z~0 4294967296) 1)))} is VALID [2018-11-14 17:38:11,497 INFO L273 TraceCheckUtils]: 38: Hoare triple {5411#(and (<= main_~z~0 14) (< 0 (+ (div main_~z~0 4294967296) 1)))} assume !(~z~0 % 4294967296 < 268435455); {5396#false} is VALID [2018-11-14 17:38:11,497 INFO L256 TraceCheckUtils]: 39: Hoare triple {5396#false} call __VERIFIER_assert((if (if ~z~0 % 4294967296 < 0 && ~z~0 % 4294967296 % 4 != 0 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 == 0 then 1 else 0)); {5396#false} is VALID [2018-11-14 17:38:11,497 INFO L273 TraceCheckUtils]: 40: Hoare triple {5396#false} ~cond := #in~cond; {5396#false} is VALID [2018-11-14 17:38:11,498 INFO L273 TraceCheckUtils]: 41: Hoare triple {5396#false} assume ~cond == 0; {5396#false} is VALID [2018-11-14 17:38:11,498 INFO L273 TraceCheckUtils]: 42: Hoare triple {5396#false} assume !false; {5396#false} is VALID [2018-11-14 17:38:11,501 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:38:11,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:38:11,501 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:38:11,512 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:38:11,541 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:38:11,541 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:38:11,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:38:11,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:38:11,778 INFO L256 TraceCheckUtils]: 0: Hoare triple {5395#true} call ULTIMATE.init(); {5395#true} is VALID [2018-11-14 17:38:11,778 INFO L273 TraceCheckUtils]: 1: Hoare triple {5395#true} assume true; {5395#true} is VALID [2018-11-14 17:38:11,779 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5395#true} {5395#true} #62#return; {5395#true} is VALID [2018-11-14 17:38:11,779 INFO L256 TraceCheckUtils]: 3: Hoare triple {5395#true} call #t~ret3 := main(); {5395#true} is VALID [2018-11-14 17:38:11,779 INFO L273 TraceCheckUtils]: 4: Hoare triple {5395#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {5395#true} is VALID [2018-11-14 17:38:11,779 INFO L273 TraceCheckUtils]: 5: Hoare triple {5395#true} assume true; {5395#true} is VALID [2018-11-14 17:38:11,779 INFO L273 TraceCheckUtils]: 6: Hoare triple {5395#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {5395#true} is VALID [2018-11-14 17:38:11,779 INFO L273 TraceCheckUtils]: 7: Hoare triple {5395#true} assume true; {5395#true} is VALID [2018-11-14 17:38:11,780 INFO L273 TraceCheckUtils]: 8: Hoare triple {5395#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {5397#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:38:11,780 INFO L273 TraceCheckUtils]: 9: Hoare triple {5397#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume true; {5397#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:38:11,781 INFO L273 TraceCheckUtils]: 10: Hoare triple {5397#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5398#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:38:11,781 INFO L273 TraceCheckUtils]: 11: Hoare triple {5398#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume true; {5398#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:38:11,782 INFO L273 TraceCheckUtils]: 12: Hoare triple {5398#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5399#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:38:11,782 INFO L273 TraceCheckUtils]: 13: Hoare triple {5399#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume true; {5399#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:38:11,783 INFO L273 TraceCheckUtils]: 14: Hoare triple {5399#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5400#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:38:11,784 INFO L273 TraceCheckUtils]: 15: Hoare triple {5400#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume true; {5400#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:38:11,785 INFO L273 TraceCheckUtils]: 16: Hoare triple {5400#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5401#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:38:11,785 INFO L273 TraceCheckUtils]: 17: Hoare triple {5401#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume true; {5401#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:38:11,786 INFO L273 TraceCheckUtils]: 18: Hoare triple {5401#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5402#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2018-11-14 17:38:11,787 INFO L273 TraceCheckUtils]: 19: Hoare triple {5402#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume true; {5402#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2018-11-14 17:38:11,788 INFO L273 TraceCheckUtils]: 20: Hoare triple {5402#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5403#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2018-11-14 17:38:11,788 INFO L273 TraceCheckUtils]: 21: Hoare triple {5403#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume true; {5403#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2018-11-14 17:38:11,789 INFO L273 TraceCheckUtils]: 22: Hoare triple {5403#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5404#(and (<= 7 main_~z~0) (<= main_~z~0 7))} is VALID [2018-11-14 17:38:11,790 INFO L273 TraceCheckUtils]: 23: Hoare triple {5404#(and (<= 7 main_~z~0) (<= main_~z~0 7))} assume true; {5404#(and (<= 7 main_~z~0) (<= main_~z~0 7))} is VALID [2018-11-14 17:38:11,791 INFO L273 TraceCheckUtils]: 24: Hoare triple {5404#(and (<= 7 main_~z~0) (<= main_~z~0 7))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5405#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2018-11-14 17:38:11,791 INFO L273 TraceCheckUtils]: 25: Hoare triple {5405#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume true; {5405#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2018-11-14 17:38:11,792 INFO L273 TraceCheckUtils]: 26: Hoare triple {5405#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5406#(and (<= main_~z~0 9) (<= 9 main_~z~0))} is VALID [2018-11-14 17:38:11,793 INFO L273 TraceCheckUtils]: 27: Hoare triple {5406#(and (<= main_~z~0 9) (<= 9 main_~z~0))} assume true; {5406#(and (<= main_~z~0 9) (<= 9 main_~z~0))} is VALID [2018-11-14 17:38:11,794 INFO L273 TraceCheckUtils]: 28: Hoare triple {5406#(and (<= main_~z~0 9) (<= 9 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5407#(and (<= 10 main_~z~0) (<= main_~z~0 10))} is VALID [2018-11-14 17:38:11,794 INFO L273 TraceCheckUtils]: 29: Hoare triple {5407#(and (<= 10 main_~z~0) (<= main_~z~0 10))} assume true; {5407#(and (<= 10 main_~z~0) (<= main_~z~0 10))} is VALID [2018-11-14 17:38:11,795 INFO L273 TraceCheckUtils]: 30: Hoare triple {5407#(and (<= 10 main_~z~0) (<= main_~z~0 10))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5408#(and (<= 11 main_~z~0) (<= main_~z~0 11))} is VALID [2018-11-14 17:38:11,796 INFO L273 TraceCheckUtils]: 31: Hoare triple {5408#(and (<= 11 main_~z~0) (<= main_~z~0 11))} assume true; {5408#(and (<= 11 main_~z~0) (<= main_~z~0 11))} is VALID [2018-11-14 17:38:11,797 INFO L273 TraceCheckUtils]: 32: Hoare triple {5408#(and (<= 11 main_~z~0) (<= main_~z~0 11))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5409#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2018-11-14 17:38:11,798 INFO L273 TraceCheckUtils]: 33: Hoare triple {5409#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume true; {5409#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2018-11-14 17:38:11,798 INFO L273 TraceCheckUtils]: 34: Hoare triple {5409#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5410#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2018-11-14 17:38:11,799 INFO L273 TraceCheckUtils]: 35: Hoare triple {5410#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume true; {5410#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2018-11-14 17:38:11,800 INFO L273 TraceCheckUtils]: 36: Hoare triple {5410#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5523#(and (<= main_~z~0 14) (<= 14 main_~z~0))} is VALID [2018-11-14 17:38:11,801 INFO L273 TraceCheckUtils]: 37: Hoare triple {5523#(and (<= main_~z~0 14) (<= 14 main_~z~0))} assume true; {5523#(and (<= main_~z~0 14) (<= 14 main_~z~0))} is VALID [2018-11-14 17:38:11,801 INFO L273 TraceCheckUtils]: 38: Hoare triple {5523#(and (<= main_~z~0 14) (<= 14 main_~z~0))} assume !(~z~0 % 4294967296 < 268435455); {5396#false} is VALID [2018-11-14 17:38:11,802 INFO L256 TraceCheckUtils]: 39: Hoare triple {5396#false} call __VERIFIER_assert((if (if ~z~0 % 4294967296 < 0 && ~z~0 % 4294967296 % 4 != 0 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 == 0 then 1 else 0)); {5396#false} is VALID [2018-11-14 17:38:11,802 INFO L273 TraceCheckUtils]: 40: Hoare triple {5396#false} ~cond := #in~cond; {5396#false} is VALID [2018-11-14 17:38:11,802 INFO L273 TraceCheckUtils]: 41: Hoare triple {5396#false} assume ~cond == 0; {5396#false} is VALID [2018-11-14 17:38:11,802 INFO L273 TraceCheckUtils]: 42: Hoare triple {5396#false} assume !false; {5396#false} is VALID [2018-11-14 17:38:11,805 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:38:11,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:38:11,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-14 17:38:11,825 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 43 [2018-11-14 17:38:11,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:38:11,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 17:38:11,876 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 17:38:11,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 17:38:11,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 17:38:11,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-11-14 17:38:11,877 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 18 states. [2018-11-14 17:38:13,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:38:13,687 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2018-11-14 17:38:13,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-14 17:38:13,687 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 43 [2018-11-14 17:38:13,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:38:13,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 17:38:13,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2018-11-14 17:38:13,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 17:38:13,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2018-11-14 17:38:13,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 82 transitions. [2018-11-14 17:38:14,662 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:38:14,664 INFO L225 Difference]: With dead ends: 105 [2018-11-14 17:38:14,664 INFO L226 Difference]: Without dead ends: 58 [2018-11-14 17:38:14,664 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-11-14 17:38:14,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-14 17:38:15,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-11-14 17:38:15,037 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:38:15,037 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 56 states. [2018-11-14 17:38:15,038 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 56 states. [2018-11-14 17:38:15,038 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 56 states. [2018-11-14 17:38:15,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:38:15,039 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-11-14 17:38:15,040 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-11-14 17:38:15,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:38:15,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:38:15,040 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 58 states. [2018-11-14 17:38:15,040 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 58 states. [2018-11-14 17:38:15,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:38:15,041 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-11-14 17:38:15,041 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-11-14 17:38:15,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:38:15,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:38:15,042 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:38:15,042 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:38:15,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-14 17:38:15,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-11-14 17:38:15,043 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 43 [2018-11-14 17:38:15,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:38:15,043 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-11-14 17:38:15,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 17:38:15,044 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-11-14 17:38:15,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-14 17:38:15,044 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:38:15,044 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:38:15,045 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:38:15,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:38:15,045 INFO L82 PathProgramCache]: Analyzing trace with hash 2096893788, now seen corresponding path program 15 times [2018-11-14 17:38:15,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:38:15,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:38:15,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:38:15,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:38:15,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:38:15,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:38:15,681 INFO L256 TraceCheckUtils]: 0: Hoare triple {5897#true} call ULTIMATE.init(); {5897#true} is VALID [2018-11-14 17:38:15,681 INFO L273 TraceCheckUtils]: 1: Hoare triple {5897#true} assume true; {5897#true} is VALID [2018-11-14 17:38:15,681 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5897#true} {5897#true} #62#return; {5897#true} is VALID [2018-11-14 17:38:15,682 INFO L256 TraceCheckUtils]: 3: Hoare triple {5897#true} call #t~ret3 := main(); {5897#true} is VALID [2018-11-14 17:38:15,682 INFO L273 TraceCheckUtils]: 4: Hoare triple {5897#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {5897#true} is VALID [2018-11-14 17:38:15,682 INFO L273 TraceCheckUtils]: 5: Hoare triple {5897#true} assume true; {5897#true} is VALID [2018-11-14 17:38:15,682 INFO L273 TraceCheckUtils]: 6: Hoare triple {5897#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {5897#true} is VALID [2018-11-14 17:38:15,682 INFO L273 TraceCheckUtils]: 7: Hoare triple {5897#true} assume true; {5897#true} is VALID [2018-11-14 17:38:15,683 INFO L273 TraceCheckUtils]: 8: Hoare triple {5897#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {5899#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:38:15,683 INFO L273 TraceCheckUtils]: 9: Hoare triple {5899#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume true; {5899#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:38:15,684 INFO L273 TraceCheckUtils]: 10: Hoare triple {5899#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5900#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:38:15,684 INFO L273 TraceCheckUtils]: 11: Hoare triple {5900#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume true; {5900#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:38:15,685 INFO L273 TraceCheckUtils]: 12: Hoare triple {5900#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5901#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:38:15,685 INFO L273 TraceCheckUtils]: 13: Hoare triple {5901#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume true; {5901#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:38:15,686 INFO L273 TraceCheckUtils]: 14: Hoare triple {5901#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5902#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:38:15,687 INFO L273 TraceCheckUtils]: 15: Hoare triple {5902#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume true; {5902#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:38:15,687 INFO L273 TraceCheckUtils]: 16: Hoare triple {5902#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5903#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:38:15,688 INFO L273 TraceCheckUtils]: 17: Hoare triple {5903#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume true; {5903#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:38:15,689 INFO L273 TraceCheckUtils]: 18: Hoare triple {5903#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5904#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2018-11-14 17:38:15,690 INFO L273 TraceCheckUtils]: 19: Hoare triple {5904#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume true; {5904#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2018-11-14 17:38:15,691 INFO L273 TraceCheckUtils]: 20: Hoare triple {5904#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5905#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2018-11-14 17:38:15,691 INFO L273 TraceCheckUtils]: 21: Hoare triple {5905#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume true; {5905#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2018-11-14 17:38:15,692 INFO L273 TraceCheckUtils]: 22: Hoare triple {5905#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5906#(and (<= 7 main_~z~0) (<= main_~z~0 7))} is VALID [2018-11-14 17:38:15,693 INFO L273 TraceCheckUtils]: 23: Hoare triple {5906#(and (<= 7 main_~z~0) (<= main_~z~0 7))} assume true; {5906#(and (<= 7 main_~z~0) (<= main_~z~0 7))} is VALID [2018-11-14 17:38:15,694 INFO L273 TraceCheckUtils]: 24: Hoare triple {5906#(and (<= 7 main_~z~0) (<= main_~z~0 7))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5907#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2018-11-14 17:38:15,694 INFO L273 TraceCheckUtils]: 25: Hoare triple {5907#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume true; {5907#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2018-11-14 17:38:15,695 INFO L273 TraceCheckUtils]: 26: Hoare triple {5907#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5908#(and (<= main_~z~0 9) (<= 9 main_~z~0))} is VALID [2018-11-14 17:38:15,696 INFO L273 TraceCheckUtils]: 27: Hoare triple {5908#(and (<= main_~z~0 9) (<= 9 main_~z~0))} assume true; {5908#(and (<= main_~z~0 9) (<= 9 main_~z~0))} is VALID [2018-11-14 17:38:15,697 INFO L273 TraceCheckUtils]: 28: Hoare triple {5908#(and (<= main_~z~0 9) (<= 9 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5909#(and (<= 10 main_~z~0) (<= main_~z~0 10))} is VALID [2018-11-14 17:38:15,697 INFO L273 TraceCheckUtils]: 29: Hoare triple {5909#(and (<= 10 main_~z~0) (<= main_~z~0 10))} assume true; {5909#(and (<= 10 main_~z~0) (<= main_~z~0 10))} is VALID [2018-11-14 17:38:15,698 INFO L273 TraceCheckUtils]: 30: Hoare triple {5909#(and (<= 10 main_~z~0) (<= main_~z~0 10))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5910#(and (<= 11 main_~z~0) (<= main_~z~0 11))} is VALID [2018-11-14 17:38:15,699 INFO L273 TraceCheckUtils]: 31: Hoare triple {5910#(and (<= 11 main_~z~0) (<= main_~z~0 11))} assume true; {5910#(and (<= 11 main_~z~0) (<= main_~z~0 11))} is VALID [2018-11-14 17:38:15,700 INFO L273 TraceCheckUtils]: 32: Hoare triple {5910#(and (<= 11 main_~z~0) (<= main_~z~0 11))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5911#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2018-11-14 17:38:15,701 INFO L273 TraceCheckUtils]: 33: Hoare triple {5911#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume true; {5911#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2018-11-14 17:38:15,701 INFO L273 TraceCheckUtils]: 34: Hoare triple {5911#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5912#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2018-11-14 17:38:15,702 INFO L273 TraceCheckUtils]: 35: Hoare triple {5912#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume true; {5912#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2018-11-14 17:38:15,703 INFO L273 TraceCheckUtils]: 36: Hoare triple {5912#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5913#(and (<= main_~z~0 14) (<= 14 main_~z~0))} is VALID [2018-11-14 17:38:15,704 INFO L273 TraceCheckUtils]: 37: Hoare triple {5913#(and (<= main_~z~0 14) (<= 14 main_~z~0))} assume true; {5913#(and (<= main_~z~0 14) (<= 14 main_~z~0))} is VALID [2018-11-14 17:38:15,705 INFO L273 TraceCheckUtils]: 38: Hoare triple {5913#(and (<= main_~z~0 14) (<= 14 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5914#(and (<= main_~z~0 15) (< 0 (+ (div main_~z~0 4294967296) 1)))} is VALID [2018-11-14 17:38:15,705 INFO L273 TraceCheckUtils]: 39: Hoare triple {5914#(and (<= main_~z~0 15) (< 0 (+ (div main_~z~0 4294967296) 1)))} assume true; {5914#(and (<= main_~z~0 15) (< 0 (+ (div main_~z~0 4294967296) 1)))} is VALID [2018-11-14 17:38:15,706 INFO L273 TraceCheckUtils]: 40: Hoare triple {5914#(and (<= main_~z~0 15) (< 0 (+ (div main_~z~0 4294967296) 1)))} assume !(~z~0 % 4294967296 < 268435455); {5898#false} is VALID [2018-11-14 17:38:15,706 INFO L256 TraceCheckUtils]: 41: Hoare triple {5898#false} call __VERIFIER_assert((if (if ~z~0 % 4294967296 < 0 && ~z~0 % 4294967296 % 4 != 0 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 == 0 then 1 else 0)); {5898#false} is VALID [2018-11-14 17:38:15,707 INFO L273 TraceCheckUtils]: 42: Hoare triple {5898#false} ~cond := #in~cond; {5898#false} is VALID [2018-11-14 17:38:15,707 INFO L273 TraceCheckUtils]: 43: Hoare triple {5898#false} assume ~cond == 0; {5898#false} is VALID [2018-11-14 17:38:15,707 INFO L273 TraceCheckUtils]: 44: Hoare triple {5898#false} assume !false; {5898#false} is VALID [2018-11-14 17:38:15,711 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:38:15,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:38:15,712 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:38:15,727 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:38:55,432 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-14 17:38:55,432 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:38:55,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:38:55,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:38:55,664 INFO L256 TraceCheckUtils]: 0: Hoare triple {5897#true} call ULTIMATE.init(); {5897#true} is VALID [2018-11-14 17:38:55,665 INFO L273 TraceCheckUtils]: 1: Hoare triple {5897#true} assume true; {5897#true} is VALID [2018-11-14 17:38:55,665 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5897#true} {5897#true} #62#return; {5897#true} is VALID [2018-11-14 17:38:55,665 INFO L256 TraceCheckUtils]: 3: Hoare triple {5897#true} call #t~ret3 := main(); {5897#true} is VALID [2018-11-14 17:38:55,665 INFO L273 TraceCheckUtils]: 4: Hoare triple {5897#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {5897#true} is VALID [2018-11-14 17:38:55,666 INFO L273 TraceCheckUtils]: 5: Hoare triple {5897#true} assume true; {5897#true} is VALID [2018-11-14 17:38:55,666 INFO L273 TraceCheckUtils]: 6: Hoare triple {5897#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {5897#true} is VALID [2018-11-14 17:38:55,666 INFO L273 TraceCheckUtils]: 7: Hoare triple {5897#true} assume true; {5897#true} is VALID [2018-11-14 17:38:55,667 INFO L273 TraceCheckUtils]: 8: Hoare triple {5897#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {5899#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:38:55,667 INFO L273 TraceCheckUtils]: 9: Hoare triple {5899#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume true; {5899#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:38:55,668 INFO L273 TraceCheckUtils]: 10: Hoare triple {5899#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5900#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:38:55,668 INFO L273 TraceCheckUtils]: 11: Hoare triple {5900#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume true; {5900#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:38:55,669 INFO L273 TraceCheckUtils]: 12: Hoare triple {5900#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5901#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:38:55,669 INFO L273 TraceCheckUtils]: 13: Hoare triple {5901#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume true; {5901#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:38:55,670 INFO L273 TraceCheckUtils]: 14: Hoare triple {5901#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5902#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:38:55,671 INFO L273 TraceCheckUtils]: 15: Hoare triple {5902#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume true; {5902#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:38:55,672 INFO L273 TraceCheckUtils]: 16: Hoare triple {5902#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5903#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:38:55,672 INFO L273 TraceCheckUtils]: 17: Hoare triple {5903#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume true; {5903#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:38:55,673 INFO L273 TraceCheckUtils]: 18: Hoare triple {5903#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5904#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2018-11-14 17:38:55,674 INFO L273 TraceCheckUtils]: 19: Hoare triple {5904#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume true; {5904#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2018-11-14 17:38:55,675 INFO L273 TraceCheckUtils]: 20: Hoare triple {5904#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5905#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2018-11-14 17:38:55,676 INFO L273 TraceCheckUtils]: 21: Hoare triple {5905#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume true; {5905#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2018-11-14 17:38:55,677 INFO L273 TraceCheckUtils]: 22: Hoare triple {5905#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5906#(and (<= 7 main_~z~0) (<= main_~z~0 7))} is VALID [2018-11-14 17:38:55,677 INFO L273 TraceCheckUtils]: 23: Hoare triple {5906#(and (<= 7 main_~z~0) (<= main_~z~0 7))} assume true; {5906#(and (<= 7 main_~z~0) (<= main_~z~0 7))} is VALID [2018-11-14 17:38:55,678 INFO L273 TraceCheckUtils]: 24: Hoare triple {5906#(and (<= 7 main_~z~0) (<= main_~z~0 7))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5907#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2018-11-14 17:38:55,679 INFO L273 TraceCheckUtils]: 25: Hoare triple {5907#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume true; {5907#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2018-11-14 17:38:55,680 INFO L273 TraceCheckUtils]: 26: Hoare triple {5907#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5908#(and (<= main_~z~0 9) (<= 9 main_~z~0))} is VALID [2018-11-14 17:38:55,681 INFO L273 TraceCheckUtils]: 27: Hoare triple {5908#(and (<= main_~z~0 9) (<= 9 main_~z~0))} assume true; {5908#(and (<= main_~z~0 9) (<= 9 main_~z~0))} is VALID [2018-11-14 17:38:55,682 INFO L273 TraceCheckUtils]: 28: Hoare triple {5908#(and (<= main_~z~0 9) (<= 9 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5909#(and (<= 10 main_~z~0) (<= main_~z~0 10))} is VALID [2018-11-14 17:38:55,682 INFO L273 TraceCheckUtils]: 29: Hoare triple {5909#(and (<= 10 main_~z~0) (<= main_~z~0 10))} assume true; {5909#(and (<= 10 main_~z~0) (<= main_~z~0 10))} is VALID [2018-11-14 17:38:55,683 INFO L273 TraceCheckUtils]: 30: Hoare triple {5909#(and (<= 10 main_~z~0) (<= main_~z~0 10))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5910#(and (<= 11 main_~z~0) (<= main_~z~0 11))} is VALID [2018-11-14 17:38:55,684 INFO L273 TraceCheckUtils]: 31: Hoare triple {5910#(and (<= 11 main_~z~0) (<= main_~z~0 11))} assume true; {5910#(and (<= 11 main_~z~0) (<= main_~z~0 11))} is VALID [2018-11-14 17:38:55,685 INFO L273 TraceCheckUtils]: 32: Hoare triple {5910#(and (<= 11 main_~z~0) (<= main_~z~0 11))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5911#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2018-11-14 17:38:55,685 INFO L273 TraceCheckUtils]: 33: Hoare triple {5911#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume true; {5911#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2018-11-14 17:38:55,686 INFO L273 TraceCheckUtils]: 34: Hoare triple {5911#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5912#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2018-11-14 17:38:55,687 INFO L273 TraceCheckUtils]: 35: Hoare triple {5912#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume true; {5912#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2018-11-14 17:38:55,688 INFO L273 TraceCheckUtils]: 36: Hoare triple {5912#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {5913#(and (<= main_~z~0 14) (<= 14 main_~z~0))} is VALID [2018-11-14 17:38:55,689 INFO L273 TraceCheckUtils]: 37: Hoare triple {5913#(and (<= main_~z~0 14) (<= 14 main_~z~0))} assume true; {5913#(and (<= main_~z~0 14) (<= 14 main_~z~0))} is VALID [2018-11-14 17:38:55,690 INFO L273 TraceCheckUtils]: 38: Hoare triple {5913#(and (<= main_~z~0 14) (<= 14 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6032#(and (<= 15 main_~z~0) (<= main_~z~0 15))} is VALID [2018-11-14 17:38:55,690 INFO L273 TraceCheckUtils]: 39: Hoare triple {6032#(and (<= 15 main_~z~0) (<= main_~z~0 15))} assume true; {6032#(and (<= 15 main_~z~0) (<= main_~z~0 15))} is VALID [2018-11-14 17:38:55,691 INFO L273 TraceCheckUtils]: 40: Hoare triple {6032#(and (<= 15 main_~z~0) (<= main_~z~0 15))} assume !(~z~0 % 4294967296 < 268435455); {5898#false} is VALID [2018-11-14 17:38:55,691 INFO L256 TraceCheckUtils]: 41: Hoare triple {5898#false} call __VERIFIER_assert((if (if ~z~0 % 4294967296 < 0 && ~z~0 % 4294967296 % 4 != 0 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 == 0 then 1 else 0)); {5898#false} is VALID [2018-11-14 17:38:55,692 INFO L273 TraceCheckUtils]: 42: Hoare triple {5898#false} ~cond := #in~cond; {5898#false} is VALID [2018-11-14 17:38:55,692 INFO L273 TraceCheckUtils]: 43: Hoare triple {5898#false} assume ~cond == 0; {5898#false} is VALID [2018-11-14 17:38:55,692 INFO L273 TraceCheckUtils]: 44: Hoare triple {5898#false} assume !false; {5898#false} is VALID [2018-11-14 17:38:55,695 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:38:55,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:38:55,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-14 17:38:55,699 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2018-11-14 17:38:55,699 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:38:55,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-14 17:38:55,745 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:38:55,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-14 17:38:55,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-14 17:38:55,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-11-14 17:38:55,747 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 19 states. [2018-11-14 17:38:57,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:38:57,089 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2018-11-14 17:38:57,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-14 17:38:57,089 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2018-11-14 17:38:57,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:38:57,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 17:38:57,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 84 transitions. [2018-11-14 17:38:57,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 17:38:57,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 84 transitions. [2018-11-14 17:38:57,093 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 84 transitions. [2018-11-14 17:38:57,448 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:38:57,449 INFO L225 Difference]: With dead ends: 109 [2018-11-14 17:38:57,449 INFO L226 Difference]: Without dead ends: 60 [2018-11-14 17:38:57,450 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-11-14 17:38:57,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-14 17:38:57,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-11-14 17:38:57,484 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:38:57,484 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 58 states. [2018-11-14 17:38:57,484 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 58 states. [2018-11-14 17:38:57,484 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 58 states. [2018-11-14 17:38:57,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:38:57,485 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-11-14 17:38:57,485 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-11-14 17:38:57,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:38:57,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:38:57,486 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 60 states. [2018-11-14 17:38:57,486 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 60 states. [2018-11-14 17:38:57,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:38:57,487 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-11-14 17:38:57,487 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-11-14 17:38:57,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:38:57,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:38:57,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:38:57,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:38:57,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-14 17:38:57,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2018-11-14 17:38:57,489 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 45 [2018-11-14 17:38:57,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:38:57,489 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2018-11-14 17:38:57,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-14 17:38:57,489 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-11-14 17:38:57,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-14 17:38:57,490 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:38:57,490 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:38:57,490 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:38:57,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:38:57,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1474728226, now seen corresponding path program 16 times [2018-11-14 17:38:57,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:38:57,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:38:57,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:38:57,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:38:57,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:38:57,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:38:57,852 INFO L256 TraceCheckUtils]: 0: Hoare triple {6419#true} call ULTIMATE.init(); {6419#true} is VALID [2018-11-14 17:38:57,852 INFO L273 TraceCheckUtils]: 1: Hoare triple {6419#true} assume true; {6419#true} is VALID [2018-11-14 17:38:57,852 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6419#true} {6419#true} #62#return; {6419#true} is VALID [2018-11-14 17:38:57,852 INFO L256 TraceCheckUtils]: 3: Hoare triple {6419#true} call #t~ret3 := main(); {6419#true} is VALID [2018-11-14 17:38:57,852 INFO L273 TraceCheckUtils]: 4: Hoare triple {6419#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {6419#true} is VALID [2018-11-14 17:38:57,852 INFO L273 TraceCheckUtils]: 5: Hoare triple {6419#true} assume true; {6419#true} is VALID [2018-11-14 17:38:57,853 INFO L273 TraceCheckUtils]: 6: Hoare triple {6419#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {6419#true} is VALID [2018-11-14 17:38:57,853 INFO L273 TraceCheckUtils]: 7: Hoare triple {6419#true} assume true; {6419#true} is VALID [2018-11-14 17:38:57,853 INFO L273 TraceCheckUtils]: 8: Hoare triple {6419#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {6421#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:38:57,853 INFO L273 TraceCheckUtils]: 9: Hoare triple {6421#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume true; {6421#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:38:57,854 INFO L273 TraceCheckUtils]: 10: Hoare triple {6421#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6422#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:38:57,854 INFO L273 TraceCheckUtils]: 11: Hoare triple {6422#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume true; {6422#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:38:57,855 INFO L273 TraceCheckUtils]: 12: Hoare triple {6422#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6423#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:38:57,855 INFO L273 TraceCheckUtils]: 13: Hoare triple {6423#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume true; {6423#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:38:57,856 INFO L273 TraceCheckUtils]: 14: Hoare triple {6423#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6424#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:38:57,856 INFO L273 TraceCheckUtils]: 15: Hoare triple {6424#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume true; {6424#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:38:57,857 INFO L273 TraceCheckUtils]: 16: Hoare triple {6424#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6425#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:38:57,858 INFO L273 TraceCheckUtils]: 17: Hoare triple {6425#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume true; {6425#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:38:57,859 INFO L273 TraceCheckUtils]: 18: Hoare triple {6425#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6426#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2018-11-14 17:38:57,859 INFO L273 TraceCheckUtils]: 19: Hoare triple {6426#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume true; {6426#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2018-11-14 17:38:57,860 INFO L273 TraceCheckUtils]: 20: Hoare triple {6426#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6427#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2018-11-14 17:38:57,861 INFO L273 TraceCheckUtils]: 21: Hoare triple {6427#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume true; {6427#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2018-11-14 17:38:57,862 INFO L273 TraceCheckUtils]: 22: Hoare triple {6427#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6428#(and (<= 7 main_~z~0) (<= main_~z~0 7))} is VALID [2018-11-14 17:38:57,863 INFO L273 TraceCheckUtils]: 23: Hoare triple {6428#(and (<= 7 main_~z~0) (<= main_~z~0 7))} assume true; {6428#(and (<= 7 main_~z~0) (<= main_~z~0 7))} is VALID [2018-11-14 17:38:57,864 INFO L273 TraceCheckUtils]: 24: Hoare triple {6428#(and (<= 7 main_~z~0) (<= main_~z~0 7))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6429#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2018-11-14 17:38:57,864 INFO L273 TraceCheckUtils]: 25: Hoare triple {6429#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume true; {6429#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2018-11-14 17:38:57,865 INFO L273 TraceCheckUtils]: 26: Hoare triple {6429#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6430#(and (<= main_~z~0 9) (<= 9 main_~z~0))} is VALID [2018-11-14 17:38:57,866 INFO L273 TraceCheckUtils]: 27: Hoare triple {6430#(and (<= main_~z~0 9) (<= 9 main_~z~0))} assume true; {6430#(and (<= main_~z~0 9) (<= 9 main_~z~0))} is VALID [2018-11-14 17:38:57,867 INFO L273 TraceCheckUtils]: 28: Hoare triple {6430#(and (<= main_~z~0 9) (<= 9 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6431#(and (<= 10 main_~z~0) (<= main_~z~0 10))} is VALID [2018-11-14 17:38:57,867 INFO L273 TraceCheckUtils]: 29: Hoare triple {6431#(and (<= 10 main_~z~0) (<= main_~z~0 10))} assume true; {6431#(and (<= 10 main_~z~0) (<= main_~z~0 10))} is VALID [2018-11-14 17:38:57,868 INFO L273 TraceCheckUtils]: 30: Hoare triple {6431#(and (<= 10 main_~z~0) (<= main_~z~0 10))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6432#(and (<= 11 main_~z~0) (<= main_~z~0 11))} is VALID [2018-11-14 17:38:57,869 INFO L273 TraceCheckUtils]: 31: Hoare triple {6432#(and (<= 11 main_~z~0) (<= main_~z~0 11))} assume true; {6432#(and (<= 11 main_~z~0) (<= main_~z~0 11))} is VALID [2018-11-14 17:38:57,870 INFO L273 TraceCheckUtils]: 32: Hoare triple {6432#(and (<= 11 main_~z~0) (<= main_~z~0 11))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6433#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2018-11-14 17:38:57,871 INFO L273 TraceCheckUtils]: 33: Hoare triple {6433#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume true; {6433#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2018-11-14 17:38:57,872 INFO L273 TraceCheckUtils]: 34: Hoare triple {6433#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6434#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2018-11-14 17:38:57,872 INFO L273 TraceCheckUtils]: 35: Hoare triple {6434#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume true; {6434#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2018-11-14 17:38:57,873 INFO L273 TraceCheckUtils]: 36: Hoare triple {6434#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6435#(and (<= main_~z~0 14) (<= 14 main_~z~0))} is VALID [2018-11-14 17:38:57,874 INFO L273 TraceCheckUtils]: 37: Hoare triple {6435#(and (<= main_~z~0 14) (<= 14 main_~z~0))} assume true; {6435#(and (<= main_~z~0 14) (<= 14 main_~z~0))} is VALID [2018-11-14 17:38:57,875 INFO L273 TraceCheckUtils]: 38: Hoare triple {6435#(and (<= main_~z~0 14) (<= 14 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6436#(and (<= 15 main_~z~0) (<= main_~z~0 15))} is VALID [2018-11-14 17:38:57,876 INFO L273 TraceCheckUtils]: 39: Hoare triple {6436#(and (<= 15 main_~z~0) (<= main_~z~0 15))} assume true; {6436#(and (<= 15 main_~z~0) (<= main_~z~0 15))} is VALID [2018-11-14 17:38:57,877 INFO L273 TraceCheckUtils]: 40: Hoare triple {6436#(and (<= 15 main_~z~0) (<= main_~z~0 15))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6437#(and (<= main_~z~0 16) (< 0 (+ (div main_~z~0 4294967296) 1)))} is VALID [2018-11-14 17:38:57,878 INFO L273 TraceCheckUtils]: 41: Hoare triple {6437#(and (<= main_~z~0 16) (< 0 (+ (div main_~z~0 4294967296) 1)))} assume true; {6437#(and (<= main_~z~0 16) (< 0 (+ (div main_~z~0 4294967296) 1)))} is VALID [2018-11-14 17:38:57,878 INFO L273 TraceCheckUtils]: 42: Hoare triple {6437#(and (<= main_~z~0 16) (< 0 (+ (div main_~z~0 4294967296) 1)))} assume !(~z~0 % 4294967296 < 268435455); {6420#false} is VALID [2018-11-14 17:38:57,879 INFO L256 TraceCheckUtils]: 43: Hoare triple {6420#false} call __VERIFIER_assert((if (if ~z~0 % 4294967296 < 0 && ~z~0 % 4294967296 % 4 != 0 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 == 0 then 1 else 0)); {6420#false} is VALID [2018-11-14 17:38:57,879 INFO L273 TraceCheckUtils]: 44: Hoare triple {6420#false} ~cond := #in~cond; {6420#false} is VALID [2018-11-14 17:38:57,879 INFO L273 TraceCheckUtils]: 45: Hoare triple {6420#false} assume ~cond == 0; {6420#false} is VALID [2018-11-14 17:38:57,879 INFO L273 TraceCheckUtils]: 46: Hoare triple {6420#false} assume !false; {6420#false} is VALID [2018-11-14 17:38:57,884 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:38:57,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:38:57,884 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:38:57,892 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:38:57,906 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:38:57,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:38:57,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:38:57,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:38:58,100 INFO L256 TraceCheckUtils]: 0: Hoare triple {6419#true} call ULTIMATE.init(); {6419#true} is VALID [2018-11-14 17:38:58,100 INFO L273 TraceCheckUtils]: 1: Hoare triple {6419#true} assume true; {6419#true} is VALID [2018-11-14 17:38:58,100 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6419#true} {6419#true} #62#return; {6419#true} is VALID [2018-11-14 17:38:58,100 INFO L256 TraceCheckUtils]: 3: Hoare triple {6419#true} call #t~ret3 := main(); {6419#true} is VALID [2018-11-14 17:38:58,101 INFO L273 TraceCheckUtils]: 4: Hoare triple {6419#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {6419#true} is VALID [2018-11-14 17:38:58,101 INFO L273 TraceCheckUtils]: 5: Hoare triple {6419#true} assume true; {6419#true} is VALID [2018-11-14 17:38:58,101 INFO L273 TraceCheckUtils]: 6: Hoare triple {6419#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {6419#true} is VALID [2018-11-14 17:38:58,101 INFO L273 TraceCheckUtils]: 7: Hoare triple {6419#true} assume true; {6419#true} is VALID [2018-11-14 17:38:58,101 INFO L273 TraceCheckUtils]: 8: Hoare triple {6419#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {6421#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:38:58,102 INFO L273 TraceCheckUtils]: 9: Hoare triple {6421#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume true; {6421#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:38:58,102 INFO L273 TraceCheckUtils]: 10: Hoare triple {6421#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6422#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:38:58,103 INFO L273 TraceCheckUtils]: 11: Hoare triple {6422#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume true; {6422#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:38:58,103 INFO L273 TraceCheckUtils]: 12: Hoare triple {6422#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6423#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:38:58,104 INFO L273 TraceCheckUtils]: 13: Hoare triple {6423#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume true; {6423#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:38:58,105 INFO L273 TraceCheckUtils]: 14: Hoare triple {6423#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6424#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:38:58,105 INFO L273 TraceCheckUtils]: 15: Hoare triple {6424#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume true; {6424#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:38:58,106 INFO L273 TraceCheckUtils]: 16: Hoare triple {6424#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6425#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:38:58,107 INFO L273 TraceCheckUtils]: 17: Hoare triple {6425#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume true; {6425#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:38:58,108 INFO L273 TraceCheckUtils]: 18: Hoare triple {6425#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6426#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2018-11-14 17:38:58,108 INFO L273 TraceCheckUtils]: 19: Hoare triple {6426#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume true; {6426#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2018-11-14 17:38:58,109 INFO L273 TraceCheckUtils]: 20: Hoare triple {6426#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6427#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2018-11-14 17:38:58,110 INFO L273 TraceCheckUtils]: 21: Hoare triple {6427#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume true; {6427#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2018-11-14 17:38:58,111 INFO L273 TraceCheckUtils]: 22: Hoare triple {6427#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6428#(and (<= 7 main_~z~0) (<= main_~z~0 7))} is VALID [2018-11-14 17:38:58,111 INFO L273 TraceCheckUtils]: 23: Hoare triple {6428#(and (<= 7 main_~z~0) (<= main_~z~0 7))} assume true; {6428#(and (<= 7 main_~z~0) (<= main_~z~0 7))} is VALID [2018-11-14 17:38:58,112 INFO L273 TraceCheckUtils]: 24: Hoare triple {6428#(and (<= 7 main_~z~0) (<= main_~z~0 7))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6429#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2018-11-14 17:38:58,113 INFO L273 TraceCheckUtils]: 25: Hoare triple {6429#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume true; {6429#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2018-11-14 17:38:58,114 INFO L273 TraceCheckUtils]: 26: Hoare triple {6429#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6430#(and (<= main_~z~0 9) (<= 9 main_~z~0))} is VALID [2018-11-14 17:38:58,114 INFO L273 TraceCheckUtils]: 27: Hoare triple {6430#(and (<= main_~z~0 9) (<= 9 main_~z~0))} assume true; {6430#(and (<= main_~z~0 9) (<= 9 main_~z~0))} is VALID [2018-11-14 17:38:58,115 INFO L273 TraceCheckUtils]: 28: Hoare triple {6430#(and (<= main_~z~0 9) (<= 9 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6431#(and (<= 10 main_~z~0) (<= main_~z~0 10))} is VALID [2018-11-14 17:38:58,116 INFO L273 TraceCheckUtils]: 29: Hoare triple {6431#(and (<= 10 main_~z~0) (<= main_~z~0 10))} assume true; {6431#(and (<= 10 main_~z~0) (<= main_~z~0 10))} is VALID [2018-11-14 17:38:58,117 INFO L273 TraceCheckUtils]: 30: Hoare triple {6431#(and (<= 10 main_~z~0) (<= main_~z~0 10))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6432#(and (<= 11 main_~z~0) (<= main_~z~0 11))} is VALID [2018-11-14 17:38:58,117 INFO L273 TraceCheckUtils]: 31: Hoare triple {6432#(and (<= 11 main_~z~0) (<= main_~z~0 11))} assume true; {6432#(and (<= 11 main_~z~0) (<= main_~z~0 11))} is VALID [2018-11-14 17:38:58,118 INFO L273 TraceCheckUtils]: 32: Hoare triple {6432#(and (<= 11 main_~z~0) (<= main_~z~0 11))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6433#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2018-11-14 17:38:58,119 INFO L273 TraceCheckUtils]: 33: Hoare triple {6433#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume true; {6433#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2018-11-14 17:38:58,120 INFO L273 TraceCheckUtils]: 34: Hoare triple {6433#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6434#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2018-11-14 17:38:58,120 INFO L273 TraceCheckUtils]: 35: Hoare triple {6434#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume true; {6434#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2018-11-14 17:38:58,121 INFO L273 TraceCheckUtils]: 36: Hoare triple {6434#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6435#(and (<= main_~z~0 14) (<= 14 main_~z~0))} is VALID [2018-11-14 17:38:58,122 INFO L273 TraceCheckUtils]: 37: Hoare triple {6435#(and (<= main_~z~0 14) (<= 14 main_~z~0))} assume true; {6435#(and (<= main_~z~0 14) (<= 14 main_~z~0))} is VALID [2018-11-14 17:38:58,123 INFO L273 TraceCheckUtils]: 38: Hoare triple {6435#(and (<= main_~z~0 14) (<= 14 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6436#(and (<= 15 main_~z~0) (<= main_~z~0 15))} is VALID [2018-11-14 17:38:58,123 INFO L273 TraceCheckUtils]: 39: Hoare triple {6436#(and (<= 15 main_~z~0) (<= main_~z~0 15))} assume true; {6436#(and (<= 15 main_~z~0) (<= main_~z~0 15))} is VALID [2018-11-14 17:38:58,124 INFO L273 TraceCheckUtils]: 40: Hoare triple {6436#(and (<= 15 main_~z~0) (<= main_~z~0 15))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6561#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2018-11-14 17:38:58,125 INFO L273 TraceCheckUtils]: 41: Hoare triple {6561#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume true; {6561#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2018-11-14 17:38:58,126 INFO L273 TraceCheckUtils]: 42: Hoare triple {6561#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !(~z~0 % 4294967296 < 268435455); {6420#false} is VALID [2018-11-14 17:38:58,126 INFO L256 TraceCheckUtils]: 43: Hoare triple {6420#false} call __VERIFIER_assert((if (if ~z~0 % 4294967296 < 0 && ~z~0 % 4294967296 % 4 != 0 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 == 0 then 1 else 0)); {6420#false} is VALID [2018-11-14 17:38:58,126 INFO L273 TraceCheckUtils]: 44: Hoare triple {6420#false} ~cond := #in~cond; {6420#false} is VALID [2018-11-14 17:38:58,126 INFO L273 TraceCheckUtils]: 45: Hoare triple {6420#false} assume ~cond == 0; {6420#false} is VALID [2018-11-14 17:38:58,126 INFO L273 TraceCheckUtils]: 46: Hoare triple {6420#false} assume !false; {6420#false} is VALID [2018-11-14 17:38:58,130 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:38:58,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:38:58,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-14 17:38:58,150 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2018-11-14 17:38:58,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:38:58,151 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-14 17:38:58,198 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:38:58,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-14 17:38:58,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-14 17:38:58,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-11-14 17:38:58,199 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 20 states. [2018-11-14 17:38:59,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:38:59,411 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2018-11-14 17:38:59,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-14 17:38:59,412 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2018-11-14 17:38:59,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:38:59,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 17:38:59,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 86 transitions. [2018-11-14 17:38:59,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 17:38:59,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 86 transitions. [2018-11-14 17:38:59,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 86 transitions. [2018-11-14 17:38:59,901 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:38:59,903 INFO L225 Difference]: With dead ends: 113 [2018-11-14 17:38:59,903 INFO L226 Difference]: Without dead ends: 62 [2018-11-14 17:38:59,903 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-11-14 17:38:59,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-14 17:39:00,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-11-14 17:39:00,044 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:39:00,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 60 states. [2018-11-14 17:39:00,045 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 60 states. [2018-11-14 17:39:00,045 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 60 states. [2018-11-14 17:39:00,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:39:00,047 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-11-14 17:39:00,047 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-11-14 17:39:00,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:39:00,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:39:00,047 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 62 states. [2018-11-14 17:39:00,048 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 62 states. [2018-11-14 17:39:00,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:39:00,049 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-11-14 17:39:00,049 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-11-14 17:39:00,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:39:00,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:39:00,050 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:39:00,050 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:39:00,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-14 17:39:00,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-11-14 17:39:00,052 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 47 [2018-11-14 17:39:00,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:39:00,052 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-11-14 17:39:00,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-14 17:39:00,052 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-11-14 17:39:00,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-14 17:39:00,053 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:39:00,053 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:39:00,053 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:39:00,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:39:00,054 INFO L82 PathProgramCache]: Analyzing trace with hash 574077288, now seen corresponding path program 17 times [2018-11-14 17:39:00,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:39:00,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:39:00,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:39:00,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:39:00,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:39:00,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:39:01,068 INFO L256 TraceCheckUtils]: 0: Hoare triple {6961#true} call ULTIMATE.init(); {6961#true} is VALID [2018-11-14 17:39:01,068 INFO L273 TraceCheckUtils]: 1: Hoare triple {6961#true} assume true; {6961#true} is VALID [2018-11-14 17:39:01,069 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6961#true} {6961#true} #62#return; {6961#true} is VALID [2018-11-14 17:39:01,069 INFO L256 TraceCheckUtils]: 3: Hoare triple {6961#true} call #t~ret3 := main(); {6961#true} is VALID [2018-11-14 17:39:01,069 INFO L273 TraceCheckUtils]: 4: Hoare triple {6961#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {6961#true} is VALID [2018-11-14 17:39:01,069 INFO L273 TraceCheckUtils]: 5: Hoare triple {6961#true} assume true; {6961#true} is VALID [2018-11-14 17:39:01,070 INFO L273 TraceCheckUtils]: 6: Hoare triple {6961#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {6961#true} is VALID [2018-11-14 17:39:01,070 INFO L273 TraceCheckUtils]: 7: Hoare triple {6961#true} assume true; {6961#true} is VALID [2018-11-14 17:39:01,070 INFO L273 TraceCheckUtils]: 8: Hoare triple {6961#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {6963#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:39:01,071 INFO L273 TraceCheckUtils]: 9: Hoare triple {6963#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume true; {6963#(and (<= 0 main_~z~0) (<= main_~z~0 0))} is VALID [2018-11-14 17:39:01,071 INFO L273 TraceCheckUtils]: 10: Hoare triple {6963#(and (<= 0 main_~z~0) (<= main_~z~0 0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6964#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:39:01,072 INFO L273 TraceCheckUtils]: 11: Hoare triple {6964#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume true; {6964#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2018-11-14 17:39:01,072 INFO L273 TraceCheckUtils]: 12: Hoare triple {6964#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6965#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:39:01,073 INFO L273 TraceCheckUtils]: 13: Hoare triple {6965#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume true; {6965#(and (<= 2 main_~z~0) (<= main_~z~0 2))} is VALID [2018-11-14 17:39:01,073 INFO L273 TraceCheckUtils]: 14: Hoare triple {6965#(and (<= 2 main_~z~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6966#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:39:01,074 INFO L273 TraceCheckUtils]: 15: Hoare triple {6966#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume true; {6966#(and (<= 3 main_~z~0) (<= main_~z~0 3))} is VALID [2018-11-14 17:39:01,075 INFO L273 TraceCheckUtils]: 16: Hoare triple {6966#(and (<= 3 main_~z~0) (<= main_~z~0 3))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6967#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:39:01,075 INFO L273 TraceCheckUtils]: 17: Hoare triple {6967#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume true; {6967#(and (<= main_~z~0 4) (<= 4 main_~z~0))} is VALID [2018-11-14 17:39:01,076 INFO L273 TraceCheckUtils]: 18: Hoare triple {6967#(and (<= main_~z~0 4) (<= 4 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6968#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2018-11-14 17:39:01,077 INFO L273 TraceCheckUtils]: 19: Hoare triple {6968#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume true; {6968#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2018-11-14 17:39:01,078 INFO L273 TraceCheckUtils]: 20: Hoare triple {6968#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6969#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2018-11-14 17:39:01,078 INFO L273 TraceCheckUtils]: 21: Hoare triple {6969#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume true; {6969#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2018-11-14 17:39:01,079 INFO L273 TraceCheckUtils]: 22: Hoare triple {6969#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6970#(and (<= 7 main_~z~0) (<= main_~z~0 7))} is VALID [2018-11-14 17:39:01,080 INFO L273 TraceCheckUtils]: 23: Hoare triple {6970#(and (<= 7 main_~z~0) (<= main_~z~0 7))} assume true; {6970#(and (<= 7 main_~z~0) (<= main_~z~0 7))} is VALID [2018-11-14 17:39:01,081 INFO L273 TraceCheckUtils]: 24: Hoare triple {6970#(and (<= 7 main_~z~0) (<= main_~z~0 7))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6971#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2018-11-14 17:39:01,081 INFO L273 TraceCheckUtils]: 25: Hoare triple {6971#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume true; {6971#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2018-11-14 17:39:01,082 INFO L273 TraceCheckUtils]: 26: Hoare triple {6971#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6972#(and (<= main_~z~0 9) (<= 9 main_~z~0))} is VALID [2018-11-14 17:39:01,083 INFO L273 TraceCheckUtils]: 27: Hoare triple {6972#(and (<= main_~z~0 9) (<= 9 main_~z~0))} assume true; {6972#(and (<= main_~z~0 9) (<= 9 main_~z~0))} is VALID [2018-11-14 17:39:01,084 INFO L273 TraceCheckUtils]: 28: Hoare triple {6972#(and (<= main_~z~0 9) (<= 9 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6973#(and (<= 10 main_~z~0) (<= main_~z~0 10))} is VALID [2018-11-14 17:39:01,084 INFO L273 TraceCheckUtils]: 29: Hoare triple {6973#(and (<= 10 main_~z~0) (<= main_~z~0 10))} assume true; {6973#(and (<= 10 main_~z~0) (<= main_~z~0 10))} is VALID [2018-11-14 17:39:01,085 INFO L273 TraceCheckUtils]: 30: Hoare triple {6973#(and (<= 10 main_~z~0) (<= main_~z~0 10))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6974#(and (<= 11 main_~z~0) (<= main_~z~0 11))} is VALID [2018-11-14 17:39:01,105 INFO L273 TraceCheckUtils]: 31: Hoare triple {6974#(and (<= 11 main_~z~0) (<= main_~z~0 11))} assume true; {6974#(and (<= 11 main_~z~0) (<= main_~z~0 11))} is VALID [2018-11-14 17:39:01,125 INFO L273 TraceCheckUtils]: 32: Hoare triple {6974#(and (<= 11 main_~z~0) (<= main_~z~0 11))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6975#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2018-11-14 17:39:01,127 INFO L273 TraceCheckUtils]: 33: Hoare triple {6975#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume true; {6975#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2018-11-14 17:39:01,128 INFO L273 TraceCheckUtils]: 34: Hoare triple {6975#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6976#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2018-11-14 17:39:01,128 INFO L273 TraceCheckUtils]: 35: Hoare triple {6976#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume true; {6976#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2018-11-14 17:39:01,129 INFO L273 TraceCheckUtils]: 36: Hoare triple {6976#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6977#(and (<= main_~z~0 14) (<= 14 main_~z~0))} is VALID [2018-11-14 17:39:01,129 INFO L273 TraceCheckUtils]: 37: Hoare triple {6977#(and (<= main_~z~0 14) (<= 14 main_~z~0))} assume true; {6977#(and (<= main_~z~0 14) (<= 14 main_~z~0))} is VALID [2018-11-14 17:39:01,130 INFO L273 TraceCheckUtils]: 38: Hoare triple {6977#(and (<= main_~z~0 14) (<= 14 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6978#(and (<= 15 main_~z~0) (<= main_~z~0 15))} is VALID [2018-11-14 17:39:01,130 INFO L273 TraceCheckUtils]: 39: Hoare triple {6978#(and (<= 15 main_~z~0) (<= main_~z~0 15))} assume true; {6978#(and (<= 15 main_~z~0) (<= main_~z~0 15))} is VALID [2018-11-14 17:39:01,131 INFO L273 TraceCheckUtils]: 40: Hoare triple {6978#(and (<= 15 main_~z~0) (<= main_~z~0 15))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6979#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2018-11-14 17:39:01,132 INFO L273 TraceCheckUtils]: 41: Hoare triple {6979#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume true; {6979#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2018-11-14 17:39:01,133 INFO L273 TraceCheckUtils]: 42: Hoare triple {6979#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post0 := ~z~0;~z~0 := #t~post0 + 1;havoc #t~post0; {6980#(and (<= main_~z~0 17) (< 0 (+ (div main_~z~0 4294967296) 1)))} is VALID [2018-11-14 17:39:01,134 INFO L273 TraceCheckUtils]: 43: Hoare triple {6980#(and (<= main_~z~0 17) (< 0 (+ (div main_~z~0 4294967296) 1)))} assume true; {6980#(and (<= main_~z~0 17) (< 0 (+ (div main_~z~0 4294967296) 1)))} is VALID [2018-11-14 17:39:01,134 INFO L273 TraceCheckUtils]: 44: Hoare triple {6980#(and (<= main_~z~0 17) (< 0 (+ (div main_~z~0 4294967296) 1)))} assume !(~z~0 % 4294967296 < 268435455); {6962#false} is VALID [2018-11-14 17:39:01,135 INFO L256 TraceCheckUtils]: 45: Hoare triple {6962#false} call __VERIFIER_assert((if (if ~z~0 % 4294967296 < 0 && ~z~0 % 4294967296 % 4 != 0 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 == 0 then 1 else 0)); {6962#false} is VALID [2018-11-14 17:39:01,135 INFO L273 TraceCheckUtils]: 46: Hoare triple {6962#false} ~cond := #in~cond; {6962#false} is VALID [2018-11-14 17:39:01,135 INFO L273 TraceCheckUtils]: 47: Hoare triple {6962#false} assume ~cond == 0; {6962#false} is VALID [2018-11-14 17:39:01,135 INFO L273 TraceCheckUtils]: 48: Hoare triple {6962#false} assume !false; {6962#false} is VALID [2018-11-14 17:39:01,139 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:39:01,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:39:01,139 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:39:01,148 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1