java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loop-acceleration/diamond_false-unreach-call1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:27:30,872 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:27:30,874 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:27:30,887 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:27:30,887 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:27:30,888 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:27:30,889 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:27:30,892 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:27:30,894 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:27:30,895 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:27:30,898 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:27:30,898 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:27:30,899 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:27:30,900 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:27:30,907 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:27:30,908 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:27:30,911 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:27:30,914 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:27:30,919 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:27:30,924 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:27:30,925 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:27:30,930 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:27:30,935 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:27:30,935 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:27:30,935 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:27:30,939 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:27:30,940 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:27:30,941 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:27:30,941 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:27:30,947 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:27:30,947 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:27:30,949 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:27:30,949 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:27:30,951 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:27:30,952 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:27:30,955 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:27:30,955 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:27:30,989 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:27:30,990 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:27:30,991 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:27:30,991 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:27:30,991 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:27:30,992 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:27:30,992 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:27:30,992 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:27:30,992 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:27:30,992 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:27:30,993 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:27:30,994 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:27:30,994 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:27:30,994 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:27:30,994 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:27:30,994 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:27:30,995 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:27:30,995 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:27:30,995 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:27:30,995 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:27:30,995 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:27:30,997 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:27:30,997 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:27:30,997 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:27:30,997 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:27:30,998 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:27:30,998 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:27:30,998 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:27:30,998 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:27:30,998 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:27:30,998 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:27:30,999 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:27:30,999 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:27:31,056 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:27:31,069 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:27:31,073 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:27:31,075 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:27:31,075 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:27:31,076 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/diamond_false-unreach-call1.i [2018-11-23 11:27:31,136 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f77a3d77e/63ace54781c44195ac83a3044d06b3e5/FLAG19875e8c7 [2018-11-23 11:27:31,579 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:27:31,580 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_false-unreach-call1.i [2018-11-23 11:27:31,587 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f77a3d77e/63ace54781c44195ac83a3044d06b3e5/FLAG19875e8c7 [2018-11-23 11:27:31,926 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f77a3d77e/63ace54781c44195ac83a3044d06b3e5 [2018-11-23 11:27:31,935 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:27:31,937 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:27:31,938 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:27:31,938 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:27:31,942 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:27:31,943 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:27:31" (1/1) ... [2018-11-23 11:27:31,947 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79fd86bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:27:31, skipping insertion in model container [2018-11-23 11:27:31,947 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:27:31" (1/1) ... [2018-11-23 11:27:31,958 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:27:31,980 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:27:32,236 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:27:32,244 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:27:32,268 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:27:32,290 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:27:32,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:27:32 WrapperNode [2018-11-23 11:27:32,291 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:27:32,292 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:27:32,293 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:27:32,293 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:27:32,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:27:32" (1/1) ... [2018-11-23 11:27:32,314 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:27:32" (1/1) ... [2018-11-23 11:27:32,325 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:27:32,326 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:27:32,326 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:27:32,327 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:27:32,340 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:27:32" (1/1) ... [2018-11-23 11:27:32,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:27:32" (1/1) ... [2018-11-23 11:27:32,343 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:27:32" (1/1) ... [2018-11-23 11:27:32,343 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:27:32" (1/1) ... [2018-11-23 11:27:32,353 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:27:32" (1/1) ... [2018-11-23 11:27:32,361 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:27:32" (1/1) ... [2018-11-23 11:27:32,362 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:27:32" (1/1) ... [2018-11-23 11:27:32,366 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:27:32,367 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:27:32,367 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:27:32,367 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:27:32,368 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:27:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:27:32,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:27:32,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:27:32,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:27:32,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:27:32,507 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:27:32,507 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:27:32,507 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:27:32,507 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:27:32,969 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:27:32,970 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 11:27:32,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:27:32 BoogieIcfgContainer [2018-11-23 11:27:32,971 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:27:32,972 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:27:32,972 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:27:32,976 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:27:32,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:27:31" (1/3) ... [2018-11-23 11:27:32,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59206260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:27:32, skipping insertion in model container [2018-11-23 11:27:32,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:27:32" (2/3) ... [2018-11-23 11:27:32,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59206260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:27:32, skipping insertion in model container [2018-11-23 11:27:32,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:27:32" (3/3) ... [2018-11-23 11:27:32,980 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond_false-unreach-call1.i [2018-11-23 11:27:32,990 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:27:32,998 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:27:33,016 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:27:33,050 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:27:33,050 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:27:33,051 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:27:33,051 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:27:33,051 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:27:33,052 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:27:33,052 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:27:33,052 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:27:33,052 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:27:33,071 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-11-23 11:27:33,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 11:27:33,079 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:27:33,080 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:27:33,083 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:27:33,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:27:33,089 INFO L82 PathProgramCache]: Analyzing trace with hash -721501374, now seen corresponding path program 1 times [2018-11-23 11:27:33,093 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:27:33,093 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:27:33,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:27:33,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:27:33,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:27:33,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:27:33,250 INFO L256 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {21#true} is VALID [2018-11-23 11:27:33,253 INFO L273 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2018-11-23 11:27:33,254 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #37#return; {21#true} is VALID [2018-11-23 11:27:33,255 INFO L256 TraceCheckUtils]: 3: Hoare triple {21#true} call #t~ret2 := main(); {21#true} is VALID [2018-11-23 11:27:33,255 INFO L273 TraceCheckUtils]: 4: Hoare triple {21#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {21#true} is VALID [2018-11-23 11:27:33,259 INFO L273 TraceCheckUtils]: 5: Hoare triple {21#true} assume !true; {22#false} is VALID [2018-11-23 11:27:33,259 INFO L256 TraceCheckUtils]: 6: Hoare triple {22#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {22#false} is VALID [2018-11-23 11:27:33,260 INFO L273 TraceCheckUtils]: 7: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2018-11-23 11:27:33,260 INFO L273 TraceCheckUtils]: 8: Hoare triple {22#false} assume 0bv32 == ~cond; {22#false} is VALID [2018-11-23 11:27:33,260 INFO L273 TraceCheckUtils]: 9: Hoare triple {22#false} assume !false; {22#false} is VALID [2018-11-23 11:27:33,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:27:33,264 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:27:33,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:27:33,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:27:33,278 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 11:27:33,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:27:33,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:27:33,323 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:27:33,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:27:33,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:27:33,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:27:33,336 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-23 11:27:33,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:33,426 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-23 11:27:33,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:27:33,426 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 11:27:33,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:27:33,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:27:33,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 33 transitions. [2018-11-23 11:27:33,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:27:33,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 33 transitions. [2018-11-23 11:27:33,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 33 transitions. [2018-11-23 11:27:33,737 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:27:33,751 INFO L225 Difference]: With dead ends: 29 [2018-11-23 11:27:33,751 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 11:27:33,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 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-23 11:27:33,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 11:27:33,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 11:27:33,831 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:27:33,831 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-23 11:27:33,832 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 11:27:33,832 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 11:27:33,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:33,835 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2018-11-23 11:27:33,836 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-11-23 11:27:33,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:27:33,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:27:33,836 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 11:27:33,837 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 11:27:33,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:33,840 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2018-11-23 11:27:33,840 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-11-23 11:27:33,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:27:33,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:27:33,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:27:33,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:27:33,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:27:33,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-11-23 11:27:33,845 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2018-11-23 11:27:33,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:27:33,845 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-11-23 11:27:33,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:27:33,846 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-11-23 11:27:33,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 11:27:33,846 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:27:33,847 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:27:33,847 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:27:33,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:27:33,848 INFO L82 PathProgramCache]: Analyzing trace with hash -730736584, now seen corresponding path program 1 times [2018-11-23 11:27:33,848 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:27:33,848 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:27:33,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:27:33,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:27:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:27:33,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:27:33,976 INFO L256 TraceCheckUtils]: 0: Hoare triple {133#true} call ULTIMATE.init(); {133#true} is VALID [2018-11-23 11:27:33,976 INFO L273 TraceCheckUtils]: 1: Hoare triple {133#true} assume true; {133#true} is VALID [2018-11-23 11:27:33,977 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {133#true} {133#true} #37#return; {133#true} is VALID [2018-11-23 11:27:33,977 INFO L256 TraceCheckUtils]: 3: Hoare triple {133#true} call #t~ret2 := main(); {133#true} is VALID [2018-11-23 11:27:33,978 INFO L273 TraceCheckUtils]: 4: Hoare triple {133#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {150#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:27:33,978 INFO L273 TraceCheckUtils]: 5: Hoare triple {150#(= main_~x~0 (_ bv0 32))} assume !~bvult32(~x~0, 99bv32); {134#false} is VALID [2018-11-23 11:27:33,979 INFO L256 TraceCheckUtils]: 6: Hoare triple {134#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {134#false} is VALID [2018-11-23 11:27:33,979 INFO L273 TraceCheckUtils]: 7: Hoare triple {134#false} ~cond := #in~cond; {134#false} is VALID [2018-11-23 11:27:33,979 INFO L273 TraceCheckUtils]: 8: Hoare triple {134#false} assume 0bv32 == ~cond; {134#false} is VALID [2018-11-23 11:27:33,980 INFO L273 TraceCheckUtils]: 9: Hoare triple {134#false} assume !false; {134#false} is VALID [2018-11-23 11:27:33,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:27:33,981 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:27:33,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:27:33,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:27:33,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 11:27:33,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:27:33,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:27:34,026 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:27:34,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:27:34,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:27:34,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:27:34,027 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 3 states. [2018-11-23 11:27:34,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:34,130 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-23 11:27:34,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:27:34,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 11:27:34,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:27:34,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:27:34,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2018-11-23 11:27:34,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:27:34,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2018-11-23 11:27:34,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 21 transitions. [2018-11-23 11:27:34,272 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:27:34,273 INFO L225 Difference]: With dead ends: 19 [2018-11-23 11:27:34,274 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 11:27:34,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:27:34,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 11:27:34,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-11-23 11:27:34,291 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:27:34,291 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 13 states. [2018-11-23 11:27:34,291 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 13 states. [2018-11-23 11:27:34,291 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 13 states. [2018-11-23 11:27:34,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:34,293 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2018-11-23 11:27:34,294 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-11-23 11:27:34,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:27:34,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:27:34,294 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 14 states. [2018-11-23 11:27:34,295 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 14 states. [2018-11-23 11:27:34,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:34,296 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2018-11-23 11:27:34,297 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-11-23 11:27:34,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:27:34,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:27:34,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:27:34,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:27:34,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:27:34,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-11-23 11:27:34,299 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-11-23 11:27:34,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:27:34,299 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-23 11:27:34,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:27:34,300 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-23 11:27:34,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 11:27:34,300 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:27:34,300 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:27:34,301 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:27:34,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:27:34,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1082855947, now seen corresponding path program 1 times [2018-11-23 11:27:34,301 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:27:34,302 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:27:34,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:27:34,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:27:34,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:27:34,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:27:34,402 INFO L256 TraceCheckUtils]: 0: Hoare triple {243#true} call ULTIMATE.init(); {243#true} is VALID [2018-11-23 11:27:34,403 INFO L273 TraceCheckUtils]: 1: Hoare triple {243#true} assume true; {243#true} is VALID [2018-11-23 11:27:34,404 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {243#true} {243#true} #37#return; {243#true} is VALID [2018-11-23 11:27:34,404 INFO L256 TraceCheckUtils]: 3: Hoare triple {243#true} call #t~ret2 := main(); {243#true} is VALID [2018-11-23 11:27:34,414 INFO L273 TraceCheckUtils]: 4: Hoare triple {243#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {260#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:27:34,415 INFO L273 TraceCheckUtils]: 5: Hoare triple {260#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {260#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:27:34,423 INFO L273 TraceCheckUtils]: 6: Hoare triple {260#(= main_~x~0 (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {267#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:34,424 INFO L273 TraceCheckUtils]: 7: Hoare triple {267#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvult32(~x~0, 99bv32); {244#false} is VALID [2018-11-23 11:27:34,424 INFO L256 TraceCheckUtils]: 8: Hoare triple {244#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {244#false} is VALID [2018-11-23 11:27:34,424 INFO L273 TraceCheckUtils]: 9: Hoare triple {244#false} ~cond := #in~cond; {244#false} is VALID [2018-11-23 11:27:34,424 INFO L273 TraceCheckUtils]: 10: Hoare triple {244#false} assume 0bv32 == ~cond; {244#false} is VALID [2018-11-23 11:27:34,425 INFO L273 TraceCheckUtils]: 11: Hoare triple {244#false} assume !false; {244#false} is VALID [2018-11-23 11:27:34,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:27:34,426 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:27:34,531 INFO L273 TraceCheckUtils]: 11: Hoare triple {244#false} assume !false; {244#false} is VALID [2018-11-23 11:27:34,531 INFO L273 TraceCheckUtils]: 10: Hoare triple {244#false} assume 0bv32 == ~cond; {244#false} is VALID [2018-11-23 11:27:34,532 INFO L273 TraceCheckUtils]: 9: Hoare triple {244#false} ~cond := #in~cond; {244#false} is VALID [2018-11-23 11:27:34,532 INFO L256 TraceCheckUtils]: 8: Hoare triple {244#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {244#false} is VALID [2018-11-23 11:27:34,533 INFO L273 TraceCheckUtils]: 7: Hoare triple {295#(bvult main_~x~0 (_ bv99 32))} assume !~bvult32(~x~0, 99bv32); {244#false} is VALID [2018-11-23 11:27:34,533 INFO L273 TraceCheckUtils]: 6: Hoare triple {299#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {295#(bvult main_~x~0 (_ bv99 32))} is VALID [2018-11-23 11:27:34,535 INFO L273 TraceCheckUtils]: 5: Hoare triple {299#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {299#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))} is VALID [2018-11-23 11:27:34,537 INFO L273 TraceCheckUtils]: 4: Hoare triple {243#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {299#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))} is VALID [2018-11-23 11:27:34,537 INFO L256 TraceCheckUtils]: 3: Hoare triple {243#true} call #t~ret2 := main(); {243#true} is VALID [2018-11-23 11:27:34,537 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {243#true} {243#true} #37#return; {243#true} is VALID [2018-11-23 11:27:34,537 INFO L273 TraceCheckUtils]: 1: Hoare triple {243#true} assume true; {243#true} is VALID [2018-11-23 11:27:34,538 INFO L256 TraceCheckUtils]: 0: Hoare triple {243#true} call ULTIMATE.init(); {243#true} is VALID [2018-11-23 11:27:34,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:27:34,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:27:34,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 11:27:34,548 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-23 11:27:34,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:27:34,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:27:34,707 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:27:34,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:27:34,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:27:34,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:27:34,709 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 6 states. [2018-11-23 11:27:35,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:35,271 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2018-11-23 11:27:35,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:27:35,272 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-23 11:27:35,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:27:35,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:27:35,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2018-11-23 11:27:35,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:27:35,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2018-11-23 11:27:35,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 30 transitions. [2018-11-23 11:27:35,330 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-23 11:27:35,332 INFO L225 Difference]: With dead ends: 24 [2018-11-23 11:27:35,333 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 11:27:35,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:27:35,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 11:27:35,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 11:27:35,360 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:27:35,361 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-23 11:27:35,361 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 11:27:35,361 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 11:27:35,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:35,363 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2018-11-23 11:27:35,364 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2018-11-23 11:27:35,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:27:35,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:27:35,364 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 11:27:35,365 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 11:27:35,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:35,367 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2018-11-23 11:27:35,367 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2018-11-23 11:27:35,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:27:35,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:27:35,368 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:27:35,368 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:27:35,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:27:35,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2018-11-23 11:27:35,371 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 12 [2018-11-23 11:27:35,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:27:35,371 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-11-23 11:27:35,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:27:35,371 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2018-11-23 11:27:35,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:27:35,372 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:27:35,372 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:27:35,372 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:27:35,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:27:35,373 INFO L82 PathProgramCache]: Analyzing trace with hash -919235730, now seen corresponding path program 1 times [2018-11-23 11:27:35,373 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:27:35,373 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:27:35,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:27:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:27:35,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:27:35,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:27:35,511 INFO L256 TraceCheckUtils]: 0: Hoare triple {427#true} call ULTIMATE.init(); {427#true} is VALID [2018-11-23 11:27:35,511 INFO L273 TraceCheckUtils]: 1: Hoare triple {427#true} assume true; {427#true} is VALID [2018-11-23 11:27:35,512 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {427#true} {427#true} #37#return; {427#true} is VALID [2018-11-23 11:27:35,512 INFO L256 TraceCheckUtils]: 3: Hoare triple {427#true} call #t~ret2 := main(); {427#true} is VALID [2018-11-23 11:27:35,513 INFO L273 TraceCheckUtils]: 4: Hoare triple {427#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {444#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:27:35,514 INFO L273 TraceCheckUtils]: 5: Hoare triple {444#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {444#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:27:35,516 INFO L273 TraceCheckUtils]: 6: Hoare triple {444#(= main_~x~0 (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {451#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:35,522 INFO L273 TraceCheckUtils]: 7: Hoare triple {451#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {451#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:35,523 INFO L273 TraceCheckUtils]: 8: Hoare triple {451#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {458#(= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:35,524 INFO L273 TraceCheckUtils]: 9: Hoare triple {458#(= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} assume !~bvult32(~x~0, 99bv32); {428#false} is VALID [2018-11-23 11:27:35,524 INFO L256 TraceCheckUtils]: 10: Hoare triple {428#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {428#false} is VALID [2018-11-23 11:27:35,524 INFO L273 TraceCheckUtils]: 11: Hoare triple {428#false} ~cond := #in~cond; {428#false} is VALID [2018-11-23 11:27:35,525 INFO L273 TraceCheckUtils]: 12: Hoare triple {428#false} assume 0bv32 == ~cond; {428#false} is VALID [2018-11-23 11:27:35,525 INFO L273 TraceCheckUtils]: 13: Hoare triple {428#false} assume !false; {428#false} is VALID [2018-11-23 11:27:35,526 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:27:35,526 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:27:35,646 INFO L273 TraceCheckUtils]: 13: Hoare triple {428#false} assume !false; {428#false} is VALID [2018-11-23 11:27:35,646 INFO L273 TraceCheckUtils]: 12: Hoare triple {428#false} assume 0bv32 == ~cond; {428#false} is VALID [2018-11-23 11:27:35,647 INFO L273 TraceCheckUtils]: 11: Hoare triple {428#false} ~cond := #in~cond; {428#false} is VALID [2018-11-23 11:27:35,647 INFO L256 TraceCheckUtils]: 10: Hoare triple {428#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {428#false} is VALID [2018-11-23 11:27:35,649 INFO L273 TraceCheckUtils]: 9: Hoare triple {486#(bvult main_~x~0 (_ bv99 32))} assume !~bvult32(~x~0, 99bv32); {428#false} is VALID [2018-11-23 11:27:35,651 INFO L273 TraceCheckUtils]: 8: Hoare triple {490#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {486#(bvult main_~x~0 (_ bv99 32))} is VALID [2018-11-23 11:27:35,652 INFO L273 TraceCheckUtils]: 7: Hoare triple {490#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {490#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} is VALID [2018-11-23 11:27:35,671 INFO L273 TraceCheckUtils]: 6: Hoare triple {497#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {490#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} is VALID [2018-11-23 11:27:35,672 INFO L273 TraceCheckUtils]: 5: Hoare triple {497#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {497#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} is VALID [2018-11-23 11:27:35,673 INFO L273 TraceCheckUtils]: 4: Hoare triple {427#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {497#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} is VALID [2018-11-23 11:27:35,673 INFO L256 TraceCheckUtils]: 3: Hoare triple {427#true} call #t~ret2 := main(); {427#true} is VALID [2018-11-23 11:27:35,673 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {427#true} {427#true} #37#return; {427#true} is VALID [2018-11-23 11:27:35,674 INFO L273 TraceCheckUtils]: 1: Hoare triple {427#true} assume true; {427#true} is VALID [2018-11-23 11:27:35,674 INFO L256 TraceCheckUtils]: 0: Hoare triple {427#true} call ULTIMATE.init(); {427#true} is VALID [2018-11-23 11:27:35,675 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:27:35,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:27:35,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 11:27:35,677 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-11-23 11:27:35,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:27:35,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:27:35,716 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:27:35,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:27:35,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:27:35,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:27:35,717 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 8 states. [2018-11-23 11:27:36,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:36,197 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2018-11-23 11:27:36,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:27:36,197 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-11-23 11:27:36,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:27:36,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:27:36,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2018-11-23 11:27:36,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:27:36,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2018-11-23 11:27:36,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 37 transitions. [2018-11-23 11:27:36,286 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:27:36,288 INFO L225 Difference]: With dead ends: 34 [2018-11-23 11:27:36,289 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 11:27:36,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:27:36,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 11:27:36,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2018-11-23 11:27:36,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:27:36,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 23 states. [2018-11-23 11:27:36,324 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 23 states. [2018-11-23 11:27:36,324 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 23 states. [2018-11-23 11:27:36,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:36,327 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2018-11-23 11:27:36,327 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2018-11-23 11:27:36,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:27:36,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:27:36,328 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 29 states. [2018-11-23 11:27:36,328 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 29 states. [2018-11-23 11:27:36,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:36,331 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2018-11-23 11:27:36,331 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2018-11-23 11:27:36,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:27:36,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:27:36,332 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:27:36,332 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:27:36,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:27:36,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2018-11-23 11:27:36,335 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 14 [2018-11-23 11:27:36,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:27:36,335 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-11-23 11:27:36,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:27:36,336 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2018-11-23 11:27:36,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 11:27:36,336 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:27:36,337 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:27:36,337 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:27:36,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:27:36,337 INFO L82 PathProgramCache]: Analyzing trace with hash 662342572, now seen corresponding path program 2 times [2018-11-23 11:27:36,338 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:27:36,340 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:27:36,361 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:27:36,394 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:27:36,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:27:36,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:27:36,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:27:36,595 INFO L256 TraceCheckUtils]: 0: Hoare triple {669#true} call ULTIMATE.init(); {669#true} is VALID [2018-11-23 11:27:36,596 INFO L273 TraceCheckUtils]: 1: Hoare triple {669#true} assume true; {669#true} is VALID [2018-11-23 11:27:36,597 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {669#true} {669#true} #37#return; {669#true} is VALID [2018-11-23 11:27:36,597 INFO L256 TraceCheckUtils]: 3: Hoare triple {669#true} call #t~ret2 := main(); {669#true} is VALID [2018-11-23 11:27:36,604 INFO L273 TraceCheckUtils]: 4: Hoare triple {669#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {686#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:27:36,605 INFO L273 TraceCheckUtils]: 5: Hoare triple {686#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {686#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:27:36,605 INFO L273 TraceCheckUtils]: 6: Hoare triple {686#(= main_~x~0 (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {693#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:36,606 INFO L273 TraceCheckUtils]: 7: Hoare triple {693#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {693#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:36,606 INFO L273 TraceCheckUtils]: 8: Hoare triple {693#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {700#(= (_ bv2 32) main_~x~0)} is VALID [2018-11-23 11:27:36,607 INFO L273 TraceCheckUtils]: 9: Hoare triple {700#(= (_ bv2 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {700#(= (_ bv2 32) main_~x~0)} is VALID [2018-11-23 11:27:36,608 INFO L273 TraceCheckUtils]: 10: Hoare triple {700#(= (_ bv2 32) main_~x~0)} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {707#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:36,609 INFO L273 TraceCheckUtils]: 11: Hoare triple {707#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {707#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:36,610 INFO L273 TraceCheckUtils]: 12: Hoare triple {707#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {714#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-23 11:27:36,611 INFO L273 TraceCheckUtils]: 13: Hoare triple {714#(= (_ bv4 32) main_~x~0)} assume !~bvult32(~x~0, 99bv32); {670#false} is VALID [2018-11-23 11:27:36,611 INFO L256 TraceCheckUtils]: 14: Hoare triple {670#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {670#false} is VALID [2018-11-23 11:27:36,612 INFO L273 TraceCheckUtils]: 15: Hoare triple {670#false} ~cond := #in~cond; {670#false} is VALID [2018-11-23 11:27:36,613 INFO L273 TraceCheckUtils]: 16: Hoare triple {670#false} assume 0bv32 == ~cond; {670#false} is VALID [2018-11-23 11:27:36,613 INFO L273 TraceCheckUtils]: 17: Hoare triple {670#false} assume !false; {670#false} is VALID [2018-11-23 11:27:36,614 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:27:36,615 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:27:36,807 INFO L273 TraceCheckUtils]: 17: Hoare triple {670#false} assume !false; {670#false} is VALID [2018-11-23 11:27:36,807 INFO L273 TraceCheckUtils]: 16: Hoare triple {670#false} assume 0bv32 == ~cond; {670#false} is VALID [2018-11-23 11:27:36,808 INFO L273 TraceCheckUtils]: 15: Hoare triple {670#false} ~cond := #in~cond; {670#false} is VALID [2018-11-23 11:27:36,808 INFO L256 TraceCheckUtils]: 14: Hoare triple {670#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {670#false} is VALID [2018-11-23 11:27:36,808 INFO L273 TraceCheckUtils]: 13: Hoare triple {742#(bvult main_~x~0 (_ bv99 32))} assume !~bvult32(~x~0, 99bv32); {670#false} is VALID [2018-11-23 11:27:36,809 INFO L273 TraceCheckUtils]: 12: Hoare triple {746#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {742#(bvult main_~x~0 (_ bv99 32))} is VALID [2018-11-23 11:27:36,810 INFO L273 TraceCheckUtils]: 11: Hoare triple {746#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {746#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))} is VALID [2018-11-23 11:27:36,814 INFO L273 TraceCheckUtils]: 10: Hoare triple {753#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {746#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))} is VALID [2018-11-23 11:27:36,814 INFO L273 TraceCheckUtils]: 9: Hoare triple {753#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {753#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} is VALID [2018-11-23 11:27:36,818 INFO L273 TraceCheckUtils]: 8: Hoare triple {760#(bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {753#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} is VALID [2018-11-23 11:27:36,823 INFO L273 TraceCheckUtils]: 7: Hoare triple {760#(bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {760#(bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32))} is VALID [2018-11-23 11:27:36,828 INFO L273 TraceCheckUtils]: 6: Hoare triple {767#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {760#(bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32))} is VALID [2018-11-23 11:27:36,829 INFO L273 TraceCheckUtils]: 5: Hoare triple {767#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {767#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} is VALID [2018-11-23 11:27:36,830 INFO L273 TraceCheckUtils]: 4: Hoare triple {669#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {767#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} is VALID [2018-11-23 11:27:36,830 INFO L256 TraceCheckUtils]: 3: Hoare triple {669#true} call #t~ret2 := main(); {669#true} is VALID [2018-11-23 11:27:36,830 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {669#true} {669#true} #37#return; {669#true} is VALID [2018-11-23 11:27:36,831 INFO L273 TraceCheckUtils]: 1: Hoare triple {669#true} assume true; {669#true} is VALID [2018-11-23 11:27:36,831 INFO L256 TraceCheckUtils]: 0: Hoare triple {669#true} call ULTIMATE.init(); {669#true} is VALID [2018-11-23 11:27:36,832 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:27:36,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:27:36,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 11:27:36,837 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-11-23 11:27:36,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:27:36,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:27:36,900 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-23 11:27:36,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:27:36,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:27:36,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:27:36,902 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand 12 states. [2018-11-23 11:27:37,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:37,995 INFO L93 Difference]: Finished difference Result 60 states and 84 transitions. [2018-11-23 11:27:37,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:27:37,996 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-11-23 11:27:37,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:27:37,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:27:38,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 51 transitions. [2018-11-23 11:27:38,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:27:38,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 51 transitions. [2018-11-23 11:27:38,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 51 transitions. [2018-11-23 11:27:38,103 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:27:38,105 INFO L225 Difference]: With dead ends: 60 [2018-11-23 11:27:38,105 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 11:27:38,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:27:38,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 11:27:38,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 31. [2018-11-23 11:27:38,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:27:38,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 31 states. [2018-11-23 11:27:38,147 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 31 states. [2018-11-23 11:27:38,147 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 31 states. [2018-11-23 11:27:38,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:38,151 INFO L93 Difference]: Finished difference Result 55 states and 74 transitions. [2018-11-23 11:27:38,151 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 74 transitions. [2018-11-23 11:27:38,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:27:38,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:27:38,153 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 55 states. [2018-11-23 11:27:38,153 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 55 states. [2018-11-23 11:27:38,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:38,156 INFO L93 Difference]: Finished difference Result 55 states and 74 transitions. [2018-11-23 11:27:38,156 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 74 transitions. [2018-11-23 11:27:38,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:27:38,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:27:38,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:27:38,158 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:27:38,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 11:27:38,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2018-11-23 11:27:38,160 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 18 [2018-11-23 11:27:38,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:27:38,160 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2018-11-23 11:27:38,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:27:38,161 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2018-11-23 11:27:38,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:27:38,162 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:27:38,162 INFO L402 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:27:38,162 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:27:38,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:27:38,162 INFO L82 PathProgramCache]: Analyzing trace with hash 204360414, now seen corresponding path program 1 times [2018-11-23 11:27:38,163 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:27:38,163 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:27:38,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:27:38,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:27:38,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:27:38,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:27:38,264 INFO L256 TraceCheckUtils]: 0: Hoare triple {1048#true} call ULTIMATE.init(); {1048#true} is VALID [2018-11-23 11:27:38,264 INFO L273 TraceCheckUtils]: 1: Hoare triple {1048#true} assume true; {1048#true} is VALID [2018-11-23 11:27:38,265 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1048#true} {1048#true} #37#return; {1048#true} is VALID [2018-11-23 11:27:38,265 INFO L256 TraceCheckUtils]: 3: Hoare triple {1048#true} call #t~ret2 := main(); {1048#true} is VALID [2018-11-23 11:27:38,265 INFO L273 TraceCheckUtils]: 4: Hoare triple {1048#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {1048#true} is VALID [2018-11-23 11:27:38,265 INFO L273 TraceCheckUtils]: 5: Hoare triple {1048#true} assume !!~bvult32(~x~0, 99bv32); {1048#true} is VALID [2018-11-23 11:27:38,266 INFO L273 TraceCheckUtils]: 6: Hoare triple {1048#true} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1071#(= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:38,267 INFO L273 TraceCheckUtils]: 7: Hoare triple {1071#(= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {1071#(= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:38,267 INFO L273 TraceCheckUtils]: 8: Hoare triple {1071#(= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {1049#false} is VALID [2018-11-23 11:27:38,267 INFO L273 TraceCheckUtils]: 9: Hoare triple {1049#false} assume !!~bvult32(~x~0, 99bv32); {1049#false} is VALID [2018-11-23 11:27:38,268 INFO L273 TraceCheckUtils]: 10: Hoare triple {1049#false} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {1049#false} is VALID [2018-11-23 11:27:38,268 INFO L273 TraceCheckUtils]: 11: Hoare triple {1049#false} assume !!~bvult32(~x~0, 99bv32); {1049#false} is VALID [2018-11-23 11:27:38,268 INFO L273 TraceCheckUtils]: 12: Hoare triple {1049#false} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1049#false} is VALID [2018-11-23 11:27:38,268 INFO L273 TraceCheckUtils]: 13: Hoare triple {1049#false} assume !!~bvult32(~x~0, 99bv32); {1049#false} is VALID [2018-11-23 11:27:38,269 INFO L273 TraceCheckUtils]: 14: Hoare triple {1049#false} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {1049#false} is VALID [2018-11-23 11:27:38,269 INFO L273 TraceCheckUtils]: 15: Hoare triple {1049#false} assume !!~bvult32(~x~0, 99bv32); {1049#false} is VALID [2018-11-23 11:27:38,269 INFO L273 TraceCheckUtils]: 16: Hoare triple {1049#false} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {1049#false} is VALID [2018-11-23 11:27:38,269 INFO L273 TraceCheckUtils]: 17: Hoare triple {1049#false} assume !~bvult32(~x~0, 99bv32); {1049#false} is VALID [2018-11-23 11:27:38,270 INFO L256 TraceCheckUtils]: 18: Hoare triple {1049#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {1049#false} is VALID [2018-11-23 11:27:38,270 INFO L273 TraceCheckUtils]: 19: Hoare triple {1049#false} ~cond := #in~cond; {1049#false} is VALID [2018-11-23 11:27:38,270 INFO L273 TraceCheckUtils]: 20: Hoare triple {1049#false} assume 0bv32 == ~cond; {1049#false} is VALID [2018-11-23 11:27:38,271 INFO L273 TraceCheckUtils]: 21: Hoare triple {1049#false} assume !false; {1049#false} is VALID [2018-11-23 11:27:38,272 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 11:27:38,272 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:27:38,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:27:38,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:27:38,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 11:27:38,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:27:38,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:27:38,306 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:27:38,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:27:38,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:27:38,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:27:38,308 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand 3 states. [2018-11-23 11:27:38,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:38,402 INFO L93 Difference]: Finished difference Result 63 states and 86 transitions. [2018-11-23 11:27:38,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:27:38,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 11:27:38,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:27:38,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:27:38,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2018-11-23 11:27:38,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:27:38,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2018-11-23 11:27:38,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 26 transitions. [2018-11-23 11:27:38,455 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-23 11:27:38,458 INFO L225 Difference]: With dead ends: 63 [2018-11-23 11:27:38,458 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 11:27:38,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:27:38,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 11:27:38,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-11-23 11:27:38,616 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:27:38,616 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 42 states. [2018-11-23 11:27:38,616 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 42 states. [2018-11-23 11:27:38,617 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 42 states. [2018-11-23 11:27:38,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:38,619 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2018-11-23 11:27:38,619 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2018-11-23 11:27:38,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:27:38,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:27:38,620 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 43 states. [2018-11-23 11:27:38,621 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 43 states. [2018-11-23 11:27:38,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:38,623 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2018-11-23 11:27:38,623 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2018-11-23 11:27:38,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:27:38,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:27:38,624 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:27:38,624 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:27:38,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:27:38,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2018-11-23 11:27:38,627 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 22 [2018-11-23 11:27:38,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:27:38,627 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2018-11-23 11:27:38,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:27:38,627 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-11-23 11:27:38,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:27:38,628 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:27:38,628 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:27:38,629 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:27:38,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:27:38,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1266993252, now seen corresponding path program 2 times [2018-11-23 11:27:38,630 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:27:38,630 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:27:38,649 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:27:38,668 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:27:38,668 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:27:38,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:27:38,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:27:38,738 INFO L256 TraceCheckUtils]: 0: Hoare triple {1364#true} call ULTIMATE.init(); {1364#true} is VALID [2018-11-23 11:27:38,738 INFO L273 TraceCheckUtils]: 1: Hoare triple {1364#true} assume true; {1364#true} is VALID [2018-11-23 11:27:38,739 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1364#true} {1364#true} #37#return; {1364#true} is VALID [2018-11-23 11:27:38,739 INFO L256 TraceCheckUtils]: 3: Hoare triple {1364#true} call #t~ret2 := main(); {1364#true} is VALID [2018-11-23 11:27:38,739 INFO L273 TraceCheckUtils]: 4: Hoare triple {1364#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {1364#true} is VALID [2018-11-23 11:27:38,739 INFO L273 TraceCheckUtils]: 5: Hoare triple {1364#true} assume !!~bvult32(~x~0, 99bv32); {1364#true} is VALID [2018-11-23 11:27:38,740 INFO L273 TraceCheckUtils]: 6: Hoare triple {1364#true} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {1387#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 11:27:38,741 INFO L273 TraceCheckUtils]: 7: Hoare triple {1387#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume !!~bvult32(~x~0, 99bv32); {1387#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 11:27:38,741 INFO L273 TraceCheckUtils]: 8: Hoare triple {1387#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {1387#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 11:27:38,743 INFO L273 TraceCheckUtils]: 9: Hoare triple {1387#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume !!~bvult32(~x~0, 99bv32); {1387#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 11:27:38,743 INFO L273 TraceCheckUtils]: 10: Hoare triple {1387#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {1387#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 11:27:38,745 INFO L273 TraceCheckUtils]: 11: Hoare triple {1387#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume !!~bvult32(~x~0, 99bv32); {1387#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 11:27:38,745 INFO L273 TraceCheckUtils]: 12: Hoare triple {1387#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {1387#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 11:27:38,747 INFO L273 TraceCheckUtils]: 13: Hoare triple {1387#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume !!~bvult32(~x~0, 99bv32); {1387#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 11:27:38,747 INFO L273 TraceCheckUtils]: 14: Hoare triple {1387#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {1387#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 11:27:38,749 INFO L273 TraceCheckUtils]: 15: Hoare triple {1387#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume !!~bvult32(~x~0, 99bv32); {1387#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-23 11:27:38,749 INFO L273 TraceCheckUtils]: 16: Hoare triple {1387#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1365#false} is VALID [2018-11-23 11:27:38,750 INFO L273 TraceCheckUtils]: 17: Hoare triple {1365#false} assume !~bvult32(~x~0, 99bv32); {1365#false} is VALID [2018-11-23 11:27:38,750 INFO L256 TraceCheckUtils]: 18: Hoare triple {1365#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {1365#false} is VALID [2018-11-23 11:27:38,750 INFO L273 TraceCheckUtils]: 19: Hoare triple {1365#false} ~cond := #in~cond; {1365#false} is VALID [2018-11-23 11:27:38,750 INFO L273 TraceCheckUtils]: 20: Hoare triple {1365#false} assume 0bv32 == ~cond; {1365#false} is VALID [2018-11-23 11:27:38,751 INFO L273 TraceCheckUtils]: 21: Hoare triple {1365#false} assume !false; {1365#false} is VALID [2018-11-23 11:27:38,752 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-23 11:27:38,752 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:27:38,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:27:38,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:27:38,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 11:27:38,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:27:38,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:27:38,821 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-23 11:27:38,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:27:38,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:27:38,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:27:38,822 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 3 states. [2018-11-23 11:27:39,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:39,003 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2018-11-23 11:27:39,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:27:39,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 11:27:39,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:27:39,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:27:39,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-11-23 11:27:39,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:27:39,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-11-23 11:27:39,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 25 transitions. [2018-11-23 11:27:39,042 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:27:39,045 INFO L225 Difference]: With dead ends: 63 [2018-11-23 11:27:39,047 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 11:27:39,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:27:39,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 11:27:39,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-11-23 11:27:39,125 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:27:39,125 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 42 states. [2018-11-23 11:27:39,125 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 42 states. [2018-11-23 11:27:39,125 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 42 states. [2018-11-23 11:27:39,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:39,128 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-11-23 11:27:39,129 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-11-23 11:27:39,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:27:39,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:27:39,131 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 43 states. [2018-11-23 11:27:39,131 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 43 states. [2018-11-23 11:27:39,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:39,134 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-11-23 11:27:39,134 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-11-23 11:27:39,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:27:39,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:27:39,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:27:39,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:27:39,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:27:39,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-11-23 11:27:39,137 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 22 [2018-11-23 11:27:39,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:27:39,138 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-11-23 11:27:39,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:27:39,138 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-11-23 11:27:39,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:27:39,139 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:27:39,139 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:27:39,139 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:27:39,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:27:39,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1209734950, now seen corresponding path program 2 times [2018-11-23 11:27:39,140 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:27:39,140 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:27:39,159 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:27:39,188 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:27:39,189 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:27:39,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:27:39,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:27:39,414 INFO L256 TraceCheckUtils]: 0: Hoare triple {1680#true} call ULTIMATE.init(); {1680#true} is VALID [2018-11-23 11:27:39,414 INFO L273 TraceCheckUtils]: 1: Hoare triple {1680#true} assume true; {1680#true} is VALID [2018-11-23 11:27:39,414 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1680#true} {1680#true} #37#return; {1680#true} is VALID [2018-11-23 11:27:39,415 INFO L256 TraceCheckUtils]: 3: Hoare triple {1680#true} call #t~ret2 := main(); {1680#true} is VALID [2018-11-23 11:27:39,416 INFO L273 TraceCheckUtils]: 4: Hoare triple {1680#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {1697#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:27:39,416 INFO L273 TraceCheckUtils]: 5: Hoare triple {1697#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {1697#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:27:39,418 INFO L273 TraceCheckUtils]: 6: Hoare triple {1697#(= main_~x~0 (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {1704#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:39,418 INFO L273 TraceCheckUtils]: 7: Hoare triple {1704#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {1704#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:39,419 INFO L273 TraceCheckUtils]: 8: Hoare triple {1704#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {1711#(= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:39,420 INFO L273 TraceCheckUtils]: 9: Hoare triple {1711#(= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {1711#(= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:39,421 INFO L273 TraceCheckUtils]: 10: Hoare triple {1711#(= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {1718#(= (_ bv6 32) main_~x~0)} is VALID [2018-11-23 11:27:39,422 INFO L273 TraceCheckUtils]: 11: Hoare triple {1718#(= (_ bv6 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {1718#(= (_ bv6 32) main_~x~0)} is VALID [2018-11-23 11:27:39,423 INFO L273 TraceCheckUtils]: 12: Hoare triple {1718#(= (_ bv6 32) main_~x~0)} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {1725#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:39,424 INFO L273 TraceCheckUtils]: 13: Hoare triple {1725#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {1725#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:39,425 INFO L273 TraceCheckUtils]: 14: Hoare triple {1725#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {1732#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:39,427 INFO L273 TraceCheckUtils]: 15: Hoare triple {1732#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {1732#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:39,428 INFO L273 TraceCheckUtils]: 16: Hoare triple {1732#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {1739#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:39,429 INFO L273 TraceCheckUtils]: 17: Hoare triple {1739#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} assume !~bvult32(~x~0, 99bv32); {1681#false} is VALID [2018-11-23 11:27:39,429 INFO L256 TraceCheckUtils]: 18: Hoare triple {1681#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {1681#false} is VALID [2018-11-23 11:27:39,429 INFO L273 TraceCheckUtils]: 19: Hoare triple {1681#false} ~cond := #in~cond; {1681#false} is VALID [2018-11-23 11:27:39,429 INFO L273 TraceCheckUtils]: 20: Hoare triple {1681#false} assume 0bv32 == ~cond; {1681#false} is VALID [2018-11-23 11:27:39,430 INFO L273 TraceCheckUtils]: 21: Hoare triple {1681#false} assume !false; {1681#false} is VALID [2018-11-23 11:27:39,431 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:27:39,431 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:27:39,650 INFO L273 TraceCheckUtils]: 21: Hoare triple {1681#false} assume !false; {1681#false} is VALID [2018-11-23 11:27:39,651 INFO L273 TraceCheckUtils]: 20: Hoare triple {1681#false} assume 0bv32 == ~cond; {1681#false} is VALID [2018-11-23 11:27:39,651 INFO L273 TraceCheckUtils]: 19: Hoare triple {1681#false} ~cond := #in~cond; {1681#false} is VALID [2018-11-23 11:27:39,651 INFO L256 TraceCheckUtils]: 18: Hoare triple {1681#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {1681#false} is VALID [2018-11-23 11:27:39,652 INFO L273 TraceCheckUtils]: 17: Hoare triple {1767#(bvult main_~x~0 (_ bv99 32))} assume !~bvult32(~x~0, 99bv32); {1681#false} is VALID [2018-11-23 11:27:39,653 INFO L273 TraceCheckUtils]: 16: Hoare triple {1771#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {1767#(bvult main_~x~0 (_ bv99 32))} is VALID [2018-11-23 11:27:39,654 INFO L273 TraceCheckUtils]: 15: Hoare triple {1771#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {1771#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} is VALID [2018-11-23 11:27:39,659 INFO L273 TraceCheckUtils]: 14: Hoare triple {1778#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {1771#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} is VALID [2018-11-23 11:27:39,659 INFO L273 TraceCheckUtils]: 13: Hoare triple {1778#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {1778#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} is VALID [2018-11-23 11:27:39,663 INFO L273 TraceCheckUtils]: 12: Hoare triple {1785#(bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {1778#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} is VALID [2018-11-23 11:27:39,663 INFO L273 TraceCheckUtils]: 11: Hoare triple {1785#(bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {1785#(bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))} is VALID [2018-11-23 11:27:39,668 INFO L273 TraceCheckUtils]: 10: Hoare triple {1792#(bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {1785#(bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))} is VALID [2018-11-23 11:27:39,668 INFO L273 TraceCheckUtils]: 9: Hoare triple {1792#(bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {1792#(bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))} is VALID [2018-11-23 11:27:39,673 INFO L273 TraceCheckUtils]: 8: Hoare triple {1799#(bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {1792#(bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))} is VALID [2018-11-23 11:27:39,674 INFO L273 TraceCheckUtils]: 7: Hoare triple {1799#(bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {1799#(bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))} is VALID [2018-11-23 11:27:39,691 INFO L273 TraceCheckUtils]: 6: Hoare triple {1806#(bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {1799#(bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))} is VALID [2018-11-23 11:27:39,692 INFO L273 TraceCheckUtils]: 5: Hoare triple {1806#(bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {1806#(bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))} is VALID [2018-11-23 11:27:39,692 INFO L273 TraceCheckUtils]: 4: Hoare triple {1680#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {1806#(bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))} is VALID [2018-11-23 11:27:39,692 INFO L256 TraceCheckUtils]: 3: Hoare triple {1680#true} call #t~ret2 := main(); {1680#true} is VALID [2018-11-23 11:27:39,693 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1680#true} {1680#true} #37#return; {1680#true} is VALID [2018-11-23 11:27:39,693 INFO L273 TraceCheckUtils]: 1: Hoare triple {1680#true} assume true; {1680#true} is VALID [2018-11-23 11:27:39,693 INFO L256 TraceCheckUtils]: 0: Hoare triple {1680#true} call ULTIMATE.init(); {1680#true} is VALID [2018-11-23 11:27:39,694 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:27:39,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:27:39,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-23 11:27:39,697 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2018-11-23 11:27:39,697 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:27:39,697 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 11:27:39,764 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-23 11:27:39,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 11:27:39,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 11:27:39,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:27:39,766 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 16 states. [2018-11-23 11:27:41,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:41,302 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2018-11-23 11:27:41,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:27:41,303 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2018-11-23 11:27:41,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:27:41,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:27:41,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 59 transitions. [2018-11-23 11:27:41,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:27:41,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 59 transitions. [2018-11-23 11:27:41,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 59 transitions. [2018-11-23 11:27:41,449 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:27:41,451 INFO L225 Difference]: With dead ends: 63 [2018-11-23 11:27:41,451 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 11:27:41,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=174, Invalid=288, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:27:41,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 11:27:41,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-23 11:27:41,586 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:27:41,587 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 58 states. [2018-11-23 11:27:41,587 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-23 11:27:41,587 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-23 11:27:41,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:41,589 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2018-11-23 11:27:41,589 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-11-23 11:27:41,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:27:41,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:27:41,590 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-23 11:27:41,590 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-23 11:27:41,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:41,595 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2018-11-23 11:27:41,595 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-11-23 11:27:41,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:27:41,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:27:41,596 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:27:41,596 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:27:41,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 11:27:41,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-11-23 11:27:41,598 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 22 [2018-11-23 11:27:41,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:27:41,599 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-11-23 11:27:41,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 11:27:41,599 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-11-23 11:27:41,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 11:27:41,600 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:27:41,600 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:27:41,600 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:27:41,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:27:41,601 INFO L82 PathProgramCache]: Analyzing trace with hash 500598618, now seen corresponding path program 3 times [2018-11-23 11:27:41,603 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:27:41,603 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:27:41,629 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:27:41,771 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-23 11:27:41,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:27:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:27:41,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:27:42,032 INFO L256 TraceCheckUtils]: 0: Hoare triple {2140#true} call ULTIMATE.init(); {2140#true} is VALID [2018-11-23 11:27:42,032 INFO L273 TraceCheckUtils]: 1: Hoare triple {2140#true} assume true; {2140#true} is VALID [2018-11-23 11:27:42,032 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2140#true} {2140#true} #37#return; {2140#true} is VALID [2018-11-23 11:27:42,032 INFO L256 TraceCheckUtils]: 3: Hoare triple {2140#true} call #t~ret2 := main(); {2140#true} is VALID [2018-11-23 11:27:42,041 INFO L273 TraceCheckUtils]: 4: Hoare triple {2140#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {2157#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:27:42,042 INFO L273 TraceCheckUtils]: 5: Hoare triple {2157#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {2157#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:27:42,042 INFO L273 TraceCheckUtils]: 6: Hoare triple {2157#(= main_~x~0 (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2164#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:42,050 INFO L273 TraceCheckUtils]: 7: Hoare triple {2164#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {2164#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:42,051 INFO L273 TraceCheckUtils]: 8: Hoare triple {2164#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2171#(= (_ bv2 32) main_~x~0)} is VALID [2018-11-23 11:27:42,051 INFO L273 TraceCheckUtils]: 9: Hoare triple {2171#(= (_ bv2 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {2171#(= (_ bv2 32) main_~x~0)} is VALID [2018-11-23 11:27:42,052 INFO L273 TraceCheckUtils]: 10: Hoare triple {2171#(= (_ bv2 32) main_~x~0)} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2178#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:42,052 INFO L273 TraceCheckUtils]: 11: Hoare triple {2178#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {2178#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:42,052 INFO L273 TraceCheckUtils]: 12: Hoare triple {2178#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2185#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-23 11:27:42,053 INFO L273 TraceCheckUtils]: 13: Hoare triple {2185#(= (_ bv4 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {2185#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-23 11:27:42,054 INFO L273 TraceCheckUtils]: 14: Hoare triple {2185#(= (_ bv4 32) main_~x~0)} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2192#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:42,054 INFO L273 TraceCheckUtils]: 15: Hoare triple {2192#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {2192#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:42,055 INFO L273 TraceCheckUtils]: 16: Hoare triple {2192#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2199#(= (_ bv6 32) main_~x~0)} is VALID [2018-11-23 11:27:42,061 INFO L273 TraceCheckUtils]: 17: Hoare triple {2199#(= (_ bv6 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {2199#(= (_ bv6 32) main_~x~0)} is VALID [2018-11-23 11:27:42,062 INFO L273 TraceCheckUtils]: 18: Hoare triple {2199#(= (_ bv6 32) main_~x~0)} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2206#(= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:42,062 INFO L273 TraceCheckUtils]: 19: Hoare triple {2206#(= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {2206#(= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:42,063 INFO L273 TraceCheckUtils]: 20: Hoare triple {2206#(= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2213#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:42,063 INFO L273 TraceCheckUtils]: 21: Hoare triple {2213#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {2213#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:42,063 INFO L273 TraceCheckUtils]: 22: Hoare triple {2213#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2220#(= (bvadd main_~x~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:42,064 INFO L273 TraceCheckUtils]: 23: Hoare triple {2220#(= (bvadd main_~x~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {2220#(= (bvadd main_~x~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:42,064 INFO L273 TraceCheckUtils]: 24: Hoare triple {2220#(= (bvadd main_~x~0 (_ bv4294967287 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2227#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:42,065 INFO L273 TraceCheckUtils]: 25: Hoare triple {2227#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} assume !~bvult32(~x~0, 99bv32); {2141#false} is VALID [2018-11-23 11:27:42,065 INFO L256 TraceCheckUtils]: 26: Hoare triple {2141#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {2141#false} is VALID [2018-11-23 11:27:42,065 INFO L273 TraceCheckUtils]: 27: Hoare triple {2141#false} ~cond := #in~cond; {2141#false} is VALID [2018-11-23 11:27:42,065 INFO L273 TraceCheckUtils]: 28: Hoare triple {2141#false} assume 0bv32 == ~cond; {2141#false} is VALID [2018-11-23 11:27:42,065 INFO L273 TraceCheckUtils]: 29: Hoare triple {2141#false} assume !false; {2141#false} is VALID [2018-11-23 11:27:42,067 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:27:42,067 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:27:43,221 INFO L273 TraceCheckUtils]: 29: Hoare triple {2141#false} assume !false; {2141#false} is VALID [2018-11-23 11:27:43,221 INFO L273 TraceCheckUtils]: 28: Hoare triple {2141#false} assume 0bv32 == ~cond; {2141#false} is VALID [2018-11-23 11:27:43,222 INFO L273 TraceCheckUtils]: 27: Hoare triple {2141#false} ~cond := #in~cond; {2141#false} is VALID [2018-11-23 11:27:43,222 INFO L256 TraceCheckUtils]: 26: Hoare triple {2141#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {2141#false} is VALID [2018-11-23 11:27:43,223 INFO L273 TraceCheckUtils]: 25: Hoare triple {2255#(bvult main_~x~0 (_ bv99 32))} assume !~bvult32(~x~0, 99bv32); {2141#false} is VALID [2018-11-23 11:27:43,223 INFO L273 TraceCheckUtils]: 24: Hoare triple {2259#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2255#(bvult main_~x~0 (_ bv99 32))} is VALID [2018-11-23 11:27:43,224 INFO L273 TraceCheckUtils]: 23: Hoare triple {2263#(or (not (bvult main_~x~0 (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {2259#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))} is VALID [2018-11-23 11:27:43,227 INFO L273 TraceCheckUtils]: 22: Hoare triple {2267#(or (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2263#(or (not (bvult main_~x~0 (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32)))} is VALID [2018-11-23 11:27:43,227 INFO L273 TraceCheckUtils]: 21: Hoare triple {2267#(or (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {2267#(or (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))))} is VALID [2018-11-23 11:27:43,231 INFO L273 TraceCheckUtils]: 20: Hoare triple {2274#(or (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2267#(or (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))))} is VALID [2018-11-23 11:27:43,231 INFO L273 TraceCheckUtils]: 19: Hoare triple {2274#(or (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {2274#(or (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))))} is VALID [2018-11-23 11:27:43,235 INFO L273 TraceCheckUtils]: 18: Hoare triple {2281#(or (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2274#(or (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))))} is VALID [2018-11-23 11:27:43,236 INFO L273 TraceCheckUtils]: 17: Hoare triple {2281#(or (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {2281#(or (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32))))} is VALID [2018-11-23 11:27:43,239 INFO L273 TraceCheckUtils]: 16: Hoare triple {2288#(or (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv99 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2281#(or (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32))))} is VALID [2018-11-23 11:27:43,240 INFO L273 TraceCheckUtils]: 15: Hoare triple {2288#(or (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {2288#(or (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv99 32)))} is VALID [2018-11-23 11:27:43,247 INFO L273 TraceCheckUtils]: 14: Hoare triple {2295#(or (not (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2288#(or (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv99 32)))} is VALID [2018-11-23 11:27:43,248 INFO L273 TraceCheckUtils]: 13: Hoare triple {2295#(or (not (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {2295#(or (not (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32)))} is VALID [2018-11-23 11:27:43,252 INFO L273 TraceCheckUtils]: 12: Hoare triple {2302#(or (not (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv7 32)) (_ bv99 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2295#(or (not (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32)))} is VALID [2018-11-23 11:27:43,252 INFO L273 TraceCheckUtils]: 11: Hoare triple {2302#(or (not (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv7 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {2302#(or (not (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv7 32)) (_ bv99 32)))} is VALID [2018-11-23 11:27:43,259 INFO L273 TraceCheckUtils]: 10: Hoare triple {2309#(or (not (bvult (bvadd main_~x~0 (_ bv7 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2302#(or (not (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv7 32)) (_ bv99 32)))} is VALID [2018-11-23 11:27:43,259 INFO L273 TraceCheckUtils]: 9: Hoare triple {2309#(or (not (bvult (bvadd main_~x~0 (_ bv7 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {2309#(or (not (bvult (bvadd main_~x~0 (_ bv7 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32)))} is VALID [2018-11-23 11:27:43,263 INFO L273 TraceCheckUtils]: 8: Hoare triple {2316#(or (bvult (bvadd main_~x~0 (_ bv9 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2309#(or (not (bvult (bvadd main_~x~0 (_ bv7 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32)))} is VALID [2018-11-23 11:27:43,264 INFO L273 TraceCheckUtils]: 7: Hoare triple {2316#(or (bvult (bvadd main_~x~0 (_ bv9 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {2316#(or (bvult (bvadd main_~x~0 (_ bv9 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))))} is VALID [2018-11-23 11:27:43,268 INFO L273 TraceCheckUtils]: 6: Hoare triple {2323#(or (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv9 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2316#(or (bvult (bvadd main_~x~0 (_ bv9 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))))} is VALID [2018-11-23 11:27:43,268 INFO L273 TraceCheckUtils]: 5: Hoare triple {2323#(or (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv9 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {2323#(or (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv9 32)) (_ bv99 32))))} is VALID [2018-11-23 11:27:43,269 INFO L273 TraceCheckUtils]: 4: Hoare triple {2140#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {2323#(or (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv9 32)) (_ bv99 32))))} is VALID [2018-11-23 11:27:43,269 INFO L256 TraceCheckUtils]: 3: Hoare triple {2140#true} call #t~ret2 := main(); {2140#true} is VALID [2018-11-23 11:27:43,269 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2140#true} {2140#true} #37#return; {2140#true} is VALID [2018-11-23 11:27:43,269 INFO L273 TraceCheckUtils]: 1: Hoare triple {2140#true} assume true; {2140#true} is VALID [2018-11-23 11:27:43,270 INFO L256 TraceCheckUtils]: 0: Hoare triple {2140#true} call ULTIMATE.init(); {2140#true} is VALID [2018-11-23 11:27:43,274 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:27:43,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:27:43,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2018-11-23 11:27:43,276 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 30 [2018-11-23 11:27:43,277 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:27:43,278 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 11:27:43,381 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:27:43,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 11:27:43,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 11:27:43,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2018-11-23 11:27:43,382 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 25 states. [2018-11-23 11:27:44,799 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 7 [2018-11-23 11:27:45,167 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 7 [2018-11-23 11:27:46,326 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 7 [2018-11-23 11:27:46,602 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 7 [2018-11-23 11:27:46,985 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-11-23 11:27:47,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:47,656 INFO L93 Difference]: Finished difference Result 87 states and 100 transitions. [2018-11-23 11:27:47,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 11:27:47,656 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 30 [2018-11-23 11:27:47,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:27:47,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:27:47,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 83 transitions. [2018-11-23 11:27:47,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:27:47,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 83 transitions. [2018-11-23 11:27:47,662 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 83 transitions. [2018-11-23 11:27:47,836 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:27:47,839 INFO L225 Difference]: With dead ends: 87 [2018-11-23 11:27:47,839 INFO L226 Difference]: Without dead ends: 82 [2018-11-23 11:27:47,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=454, Invalid=806, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 11:27:47,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-23 11:27:47,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-11-23 11:27:47,929 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:27:47,929 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 82 states. [2018-11-23 11:27:47,929 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 82 states. [2018-11-23 11:27:47,929 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 82 states. [2018-11-23 11:27:47,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:47,933 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2018-11-23 11:27:47,933 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2018-11-23 11:27:47,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:27:47,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:27:47,933 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 82 states. [2018-11-23 11:27:47,934 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 82 states. [2018-11-23 11:27:47,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:47,936 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2018-11-23 11:27:47,937 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2018-11-23 11:27:47,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:27:47,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:27:47,937 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:27:47,937 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:27:47,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-23 11:27:47,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2018-11-23 11:27:47,940 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 30 [2018-11-23 11:27:47,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:27:47,941 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2018-11-23 11:27:47,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 11:27:47,941 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2018-11-23 11:27:47,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 11:27:47,942 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:27:47,942 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:27:47,942 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:27:47,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:27:47,942 INFO L82 PathProgramCache]: Analyzing trace with hash -329445454, now seen corresponding path program 3 times [2018-11-23 11:27:47,943 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:27:47,943 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:27:47,972 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:27:48,219 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-23 11:27:48,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:27:48,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:27:48,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:27:48,749 INFO L256 TraceCheckUtils]: 0: Hoare triple {2787#true} call ULTIMATE.init(); {2787#true} is VALID [2018-11-23 11:27:48,749 INFO L273 TraceCheckUtils]: 1: Hoare triple {2787#true} assume true; {2787#true} is VALID [2018-11-23 11:27:48,750 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2787#true} {2787#true} #37#return; {2787#true} is VALID [2018-11-23 11:27:48,750 INFO L256 TraceCheckUtils]: 3: Hoare triple {2787#true} call #t~ret2 := main(); {2787#true} is VALID [2018-11-23 11:27:48,751 INFO L273 TraceCheckUtils]: 4: Hoare triple {2787#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {2804#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:27:48,752 INFO L273 TraceCheckUtils]: 5: Hoare triple {2804#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {2804#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:27:48,753 INFO L273 TraceCheckUtils]: 6: Hoare triple {2804#(= main_~x~0 (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {2811#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:48,753 INFO L273 TraceCheckUtils]: 7: Hoare triple {2811#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {2811#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:48,754 INFO L273 TraceCheckUtils]: 8: Hoare triple {2811#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {2818#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-23 11:27:48,755 INFO L273 TraceCheckUtils]: 9: Hoare triple {2818#(= (_ bv4 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {2818#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-23 11:27:48,755 INFO L273 TraceCheckUtils]: 10: Hoare triple {2818#(= (_ bv4 32) main_~x~0)} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {2825#(= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:48,756 INFO L273 TraceCheckUtils]: 11: Hoare triple {2825#(= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {2825#(= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:48,757 INFO L273 TraceCheckUtils]: 12: Hoare triple {2825#(= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {2832#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:48,757 INFO L273 TraceCheckUtils]: 13: Hoare triple {2832#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {2832#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:48,758 INFO L273 TraceCheckUtils]: 14: Hoare triple {2832#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {2839#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:48,759 INFO L273 TraceCheckUtils]: 15: Hoare triple {2839#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {2839#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:48,760 INFO L273 TraceCheckUtils]: 16: Hoare triple {2839#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {2846#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:48,760 INFO L273 TraceCheckUtils]: 17: Hoare triple {2846#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {2846#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:48,761 INFO L273 TraceCheckUtils]: 18: Hoare triple {2846#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {2853#(= (_ bv14 32) main_~x~0)} is VALID [2018-11-23 11:27:48,762 INFO L273 TraceCheckUtils]: 19: Hoare triple {2853#(= (_ bv14 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {2853#(= (_ bv14 32) main_~x~0)} is VALID [2018-11-23 11:27:48,763 INFO L273 TraceCheckUtils]: 20: Hoare triple {2853#(= (_ bv14 32) main_~x~0)} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {2860#(= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:48,763 INFO L273 TraceCheckUtils]: 21: Hoare triple {2860#(= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {2860#(= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:48,764 INFO L273 TraceCheckUtils]: 22: Hoare triple {2860#(= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {2867#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:48,765 INFO L273 TraceCheckUtils]: 23: Hoare triple {2867#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {2867#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:48,765 INFO L273 TraceCheckUtils]: 24: Hoare triple {2867#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {2874#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:48,766 INFO L273 TraceCheckUtils]: 25: Hoare triple {2874#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {2874#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:48,767 INFO L273 TraceCheckUtils]: 26: Hoare triple {2874#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {2881#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:48,767 INFO L273 TraceCheckUtils]: 27: Hoare triple {2881#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {2881#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:48,768 INFO L273 TraceCheckUtils]: 28: Hoare triple {2881#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {2888#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:48,769 INFO L273 TraceCheckUtils]: 29: Hoare triple {2888#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {2888#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:48,770 INFO L273 TraceCheckUtils]: 30: Hoare triple {2888#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {2895#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:48,788 INFO L273 TraceCheckUtils]: 31: Hoare triple {2895#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {2895#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:48,790 INFO L273 TraceCheckUtils]: 32: Hoare triple {2895#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {2902#(= (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:48,790 INFO L273 TraceCheckUtils]: 33: Hoare triple {2902#(= (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv0 32))} assume !~bvult32(~x~0, 99bv32); {2788#false} is VALID [2018-11-23 11:27:48,791 INFO L256 TraceCheckUtils]: 34: Hoare triple {2788#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {2788#false} is VALID [2018-11-23 11:27:48,791 INFO L273 TraceCheckUtils]: 35: Hoare triple {2788#false} ~cond := #in~cond; {2788#false} is VALID [2018-11-23 11:27:48,791 INFO L273 TraceCheckUtils]: 36: Hoare triple {2788#false} assume 0bv32 == ~cond; {2788#false} is VALID [2018-11-23 11:27:48,791 INFO L273 TraceCheckUtils]: 37: Hoare triple {2788#false} assume !false; {2788#false} is VALID [2018-11-23 11:27:48,793 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:27:48,793 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:27:50,315 INFO L273 TraceCheckUtils]: 37: Hoare triple {2788#false} assume !false; {2788#false} is VALID [2018-11-23 11:27:50,316 INFO L273 TraceCheckUtils]: 36: Hoare triple {2788#false} assume 0bv32 == ~cond; {2788#false} is VALID [2018-11-23 11:27:50,316 INFO L273 TraceCheckUtils]: 35: Hoare triple {2788#false} ~cond := #in~cond; {2788#false} is VALID [2018-11-23 11:27:50,316 INFO L256 TraceCheckUtils]: 34: Hoare triple {2788#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {2788#false} is VALID [2018-11-23 11:27:50,317 INFO L273 TraceCheckUtils]: 33: Hoare triple {2930#(bvult main_~x~0 (_ bv99 32))} assume !~bvult32(~x~0, 99bv32); {2788#false} is VALID [2018-11-23 11:27:50,318 INFO L273 TraceCheckUtils]: 32: Hoare triple {2934#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {2930#(bvult main_~x~0 (_ bv99 32))} is VALID [2018-11-23 11:27:50,318 INFO L273 TraceCheckUtils]: 31: Hoare triple {2938#(or (not (bvult main_~x~0 (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {2934#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} is VALID [2018-11-23 11:27:50,321 INFO L273 TraceCheckUtils]: 30: Hoare triple {2942#(or (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {2938#(or (not (bvult main_~x~0 (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32)))} is VALID [2018-11-23 11:27:50,321 INFO L273 TraceCheckUtils]: 29: Hoare triple {2942#(or (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {2942#(or (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))))} is VALID [2018-11-23 11:27:50,328 INFO L273 TraceCheckUtils]: 28: Hoare triple {2949#(or (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {2942#(or (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))))} is VALID [2018-11-23 11:27:50,328 INFO L273 TraceCheckUtils]: 27: Hoare triple {2949#(or (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {2949#(or (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))))} is VALID [2018-11-23 11:27:50,333 INFO L273 TraceCheckUtils]: 26: Hoare triple {2956#(or (not (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32)))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {2949#(or (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))))} is VALID [2018-11-23 11:27:50,334 INFO L273 TraceCheckUtils]: 25: Hoare triple {2956#(or (not (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {2956#(or (not (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32)))} is VALID [2018-11-23 11:27:50,341 INFO L273 TraceCheckUtils]: 24: Hoare triple {2963#(or (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {2956#(or (not (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32)))} is VALID [2018-11-23 11:27:50,342 INFO L273 TraceCheckUtils]: 23: Hoare triple {2963#(or (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {2963#(or (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))))} is VALID [2018-11-23 11:27:50,348 INFO L273 TraceCheckUtils]: 22: Hoare triple {2970#(or (bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {2963#(or (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))))} is VALID [2018-11-23 11:27:50,348 INFO L273 TraceCheckUtils]: 21: Hoare triple {2970#(or (bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {2970#(or (bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))))} is VALID [2018-11-23 11:27:50,352 INFO L273 TraceCheckUtils]: 20: Hoare triple {2977#(or (bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {2970#(or (bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))))} is VALID [2018-11-23 11:27:50,352 INFO L273 TraceCheckUtils]: 19: Hoare triple {2977#(or (bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {2977#(or (bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))))} is VALID [2018-11-23 11:27:50,357 INFO L273 TraceCheckUtils]: 18: Hoare triple {2984#(or (not (bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32)))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {2977#(or (bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))))} is VALID [2018-11-23 11:27:50,358 INFO L273 TraceCheckUtils]: 17: Hoare triple {2984#(or (not (bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {2984#(or (not (bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32)))} is VALID [2018-11-23 11:27:50,363 INFO L273 TraceCheckUtils]: 16: Hoare triple {2991#(or (bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {2984#(or (not (bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32)))} is VALID [2018-11-23 11:27:50,363 INFO L273 TraceCheckUtils]: 15: Hoare triple {2991#(or (bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {2991#(or (bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))))} is VALID [2018-11-23 11:27:50,368 INFO L273 TraceCheckUtils]: 14: Hoare triple {2998#(or (bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {2991#(or (bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))))} is VALID [2018-11-23 11:27:50,369 INFO L273 TraceCheckUtils]: 13: Hoare triple {2998#(or (bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {2998#(or (bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))))} is VALID [2018-11-23 11:27:50,373 INFO L273 TraceCheckUtils]: 12: Hoare triple {3005#(or (not (bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32)))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {2998#(or (bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))))} is VALID [2018-11-23 11:27:50,374 INFO L273 TraceCheckUtils]: 11: Hoare triple {3005#(or (not (bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {3005#(or (not (bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32)))} is VALID [2018-11-23 11:27:50,378 INFO L273 TraceCheckUtils]: 10: Hoare triple {3012#(or (bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32))))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {3005#(or (not (bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32)))} is VALID [2018-11-23 11:27:50,378 INFO L273 TraceCheckUtils]: 9: Hoare triple {3012#(or (bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {3012#(or (bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32))))} is VALID [2018-11-23 11:27:50,384 INFO L273 TraceCheckUtils]: 8: Hoare triple {3019#(or (bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32))))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {3012#(or (bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32))))} is VALID [2018-11-23 11:27:50,384 INFO L273 TraceCheckUtils]: 7: Hoare triple {3019#(or (bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {3019#(or (bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32))))} is VALID [2018-11-23 11:27:50,392 INFO L273 TraceCheckUtils]: 6: Hoare triple {3026#(or (bvult (bvadd main_~x~0 (_ bv28 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32))))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {3019#(or (bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32))))} is VALID [2018-11-23 11:27:50,393 INFO L273 TraceCheckUtils]: 5: Hoare triple {3026#(or (bvult (bvadd main_~x~0 (_ bv28 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {3026#(or (bvult (bvadd main_~x~0 (_ bv28 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32))))} is VALID [2018-11-23 11:27:50,398 INFO L273 TraceCheckUtils]: 4: Hoare triple {2787#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {3026#(or (bvult (bvadd main_~x~0 (_ bv28 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32))))} is VALID [2018-11-23 11:27:50,399 INFO L256 TraceCheckUtils]: 3: Hoare triple {2787#true} call #t~ret2 := main(); {2787#true} is VALID [2018-11-23 11:27:50,399 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2787#true} {2787#true} #37#return; {2787#true} is VALID [2018-11-23 11:27:50,399 INFO L273 TraceCheckUtils]: 1: Hoare triple {2787#true} assume true; {2787#true} is VALID [2018-11-23 11:27:50,399 INFO L256 TraceCheckUtils]: 0: Hoare triple {2787#true} call ULTIMATE.init(); {2787#true} is VALID [2018-11-23 11:27:50,403 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:27:50,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:27:50,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 33 [2018-11-23 11:27:50,405 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 38 [2018-11-23 11:27:50,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:27:50,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-23 11:27:50,576 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-23 11:27:50,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 11:27:50,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 11:27:50,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=752, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 11:27:50,577 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand 33 states. [2018-11-23 11:27:51,443 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 7 [2018-11-23 11:27:52,146 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 11:27:52,710 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 7 [2018-11-23 11:27:53,247 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 7 [2018-11-23 11:27:53,760 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 7 [2018-11-23 11:27:54,286 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 7 [2018-11-23 11:27:54,886 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 7 [2018-11-23 11:27:55,345 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 7 [2018-11-23 11:27:55,843 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 7 [2018-11-23 11:27:58,224 WARN L180 SmtUtils]: Spent 343.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2018-11-23 11:27:58,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:58,679 INFO L93 Difference]: Finished difference Result 119 states and 136 transitions. [2018-11-23 11:27:58,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 11:27:58,679 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 38 [2018-11-23 11:27:58,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:27:58,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 11:27:58,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 107 transitions. [2018-11-23 11:27:58,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 11:27:58,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 107 transitions. [2018-11-23 11:27:58,684 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 107 transitions. [2018-11-23 11:27:58,954 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:27:58,957 INFO L225 Difference]: With dead ends: 119 [2018-11-23 11:27:58,958 INFO L226 Difference]: Without dead ends: 114 [2018-11-23 11:27:58,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=798, Invalid=1458, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 11:27:58,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-23 11:27:59,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-11-23 11:27:59,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:27:59,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 114 states. [2018-11-23 11:27:59,147 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 114 states. [2018-11-23 11:27:59,147 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 114 states. [2018-11-23 11:27:59,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:59,150 INFO L93 Difference]: Finished difference Result 114 states and 116 transitions. [2018-11-23 11:27:59,150 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 116 transitions. [2018-11-23 11:27:59,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:27:59,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:27:59,150 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 114 states. [2018-11-23 11:27:59,150 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 114 states. [2018-11-23 11:27:59,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:59,152 INFO L93 Difference]: Finished difference Result 114 states and 116 transitions. [2018-11-23 11:27:59,152 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 116 transitions. [2018-11-23 11:27:59,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:27:59,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:27:59,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:27:59,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:27:59,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-23 11:27:59,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 116 transitions. [2018-11-23 11:27:59,155 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 116 transitions. Word has length 38 [2018-11-23 11:27:59,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:27:59,156 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 116 transitions. [2018-11-23 11:27:59,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-23 11:27:59,156 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 116 transitions. [2018-11-23 11:27:59,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 11:27:59,157 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:27:59,157 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:27:59,158 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:27:59,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:27:59,158 INFO L82 PathProgramCache]: Analyzing trace with hash -2117091402, now seen corresponding path program 4 times [2018-11-23 11:27:59,158 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:27:59,158 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:27:59,190 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:27:59,246 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:27:59,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:27:59,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:27:59,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:27:59,866 INFO L256 TraceCheckUtils]: 0: Hoare triple {3658#true} call ULTIMATE.init(); {3658#true} is VALID [2018-11-23 11:27:59,866 INFO L273 TraceCheckUtils]: 1: Hoare triple {3658#true} assume true; {3658#true} is VALID [2018-11-23 11:27:59,866 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3658#true} {3658#true} #37#return; {3658#true} is VALID [2018-11-23 11:27:59,866 INFO L256 TraceCheckUtils]: 3: Hoare triple {3658#true} call #t~ret2 := main(); {3658#true} is VALID [2018-11-23 11:27:59,867 INFO L273 TraceCheckUtils]: 4: Hoare triple {3658#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {3675#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:27:59,867 INFO L273 TraceCheckUtils]: 5: Hoare triple {3675#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {3675#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:27:59,868 INFO L273 TraceCheckUtils]: 6: Hoare triple {3675#(= main_~x~0 (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3682#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:59,868 INFO L273 TraceCheckUtils]: 7: Hoare triple {3682#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {3682#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:59,868 INFO L273 TraceCheckUtils]: 8: Hoare triple {3682#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3689#(= (_ bv2 32) main_~x~0)} is VALID [2018-11-23 11:27:59,869 INFO L273 TraceCheckUtils]: 9: Hoare triple {3689#(= (_ bv2 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {3689#(= (_ bv2 32) main_~x~0)} is VALID [2018-11-23 11:27:59,869 INFO L273 TraceCheckUtils]: 10: Hoare triple {3689#(= (_ bv2 32) main_~x~0)} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3696#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:59,870 INFO L273 TraceCheckUtils]: 11: Hoare triple {3696#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {3696#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:59,870 INFO L273 TraceCheckUtils]: 12: Hoare triple {3696#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3703#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-23 11:27:59,870 INFO L273 TraceCheckUtils]: 13: Hoare triple {3703#(= (_ bv4 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {3703#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-23 11:27:59,871 INFO L273 TraceCheckUtils]: 14: Hoare triple {3703#(= (_ bv4 32) main_~x~0)} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3710#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:59,872 INFO L273 TraceCheckUtils]: 15: Hoare triple {3710#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {3710#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:59,873 INFO L273 TraceCheckUtils]: 16: Hoare triple {3710#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3717#(= (_ bv6 32) main_~x~0)} is VALID [2018-11-23 11:27:59,873 INFO L273 TraceCheckUtils]: 17: Hoare triple {3717#(= (_ bv6 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {3717#(= (_ bv6 32) main_~x~0)} is VALID [2018-11-23 11:27:59,881 INFO L273 TraceCheckUtils]: 18: Hoare triple {3717#(= (_ bv6 32) main_~x~0)} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3724#(= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:59,881 INFO L273 TraceCheckUtils]: 19: Hoare triple {3724#(= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {3724#(= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:59,882 INFO L273 TraceCheckUtils]: 20: Hoare triple {3724#(= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3731#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:59,882 INFO L273 TraceCheckUtils]: 21: Hoare triple {3731#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {3731#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:59,883 INFO L273 TraceCheckUtils]: 22: Hoare triple {3731#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3738#(= (bvadd main_~x~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:59,883 INFO L273 TraceCheckUtils]: 23: Hoare triple {3738#(= (bvadd main_~x~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {3738#(= (bvadd main_~x~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:59,884 INFO L273 TraceCheckUtils]: 24: Hoare triple {3738#(= (bvadd main_~x~0 (_ bv4294967287 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3745#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:59,884 INFO L273 TraceCheckUtils]: 25: Hoare triple {3745#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {3745#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:59,884 INFO L273 TraceCheckUtils]: 26: Hoare triple {3745#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3752#(= (bvadd main_~x~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:59,885 INFO L273 TraceCheckUtils]: 27: Hoare triple {3752#(= (bvadd main_~x~0 (_ bv4294967285 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {3752#(= (bvadd main_~x~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:59,886 INFO L273 TraceCheckUtils]: 28: Hoare triple {3752#(= (bvadd main_~x~0 (_ bv4294967285 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3759#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:59,886 INFO L273 TraceCheckUtils]: 29: Hoare triple {3759#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {3759#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:59,887 INFO L273 TraceCheckUtils]: 30: Hoare triple {3759#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3766#(= (_ bv13 32) main_~x~0)} is VALID [2018-11-23 11:27:59,888 INFO L273 TraceCheckUtils]: 31: Hoare triple {3766#(= (_ bv13 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {3766#(= (_ bv13 32) main_~x~0)} is VALID [2018-11-23 11:27:59,889 INFO L273 TraceCheckUtils]: 32: Hoare triple {3766#(= (_ bv13 32) main_~x~0)} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3773#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:59,889 INFO L273 TraceCheckUtils]: 33: Hoare triple {3773#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {3773#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:59,890 INFO L273 TraceCheckUtils]: 34: Hoare triple {3773#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3780#(= (bvadd main_~x~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:59,890 INFO L273 TraceCheckUtils]: 35: Hoare triple {3780#(= (bvadd main_~x~0 (_ bv4294967281 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {3780#(= (bvadd main_~x~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:59,891 INFO L273 TraceCheckUtils]: 36: Hoare triple {3780#(= (bvadd main_~x~0 (_ bv4294967281 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3787#(= (_ bv16 32) main_~x~0)} is VALID [2018-11-23 11:27:59,892 INFO L273 TraceCheckUtils]: 37: Hoare triple {3787#(= (_ bv16 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {3787#(= (_ bv16 32) main_~x~0)} is VALID [2018-11-23 11:27:59,893 INFO L273 TraceCheckUtils]: 38: Hoare triple {3787#(= (_ bv16 32) main_~x~0)} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3794#(= (bvadd main_~x~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:59,893 INFO L273 TraceCheckUtils]: 39: Hoare triple {3794#(= (bvadd main_~x~0 (_ bv4294967279 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {3794#(= (bvadd main_~x~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:59,894 INFO L273 TraceCheckUtils]: 40: Hoare triple {3794#(= (bvadd main_~x~0 (_ bv4294967279 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3801#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:59,894 INFO L273 TraceCheckUtils]: 41: Hoare triple {3801#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {3801#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:59,895 INFO L273 TraceCheckUtils]: 42: Hoare triple {3801#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3808#(= (bvadd main_~x~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:59,896 INFO L273 TraceCheckUtils]: 43: Hoare triple {3808#(= (bvadd main_~x~0 (_ bv4294967277 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {3808#(= (bvadd main_~x~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:59,897 INFO L273 TraceCheckUtils]: 44: Hoare triple {3808#(= (bvadd main_~x~0 (_ bv4294967277 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3815#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:59,897 INFO L273 TraceCheckUtils]: 45: Hoare triple {3815#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {3815#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:59,898 INFO L273 TraceCheckUtils]: 46: Hoare triple {3815#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3822#(= (_ bv21 32) main_~x~0)} is VALID [2018-11-23 11:27:59,899 INFO L273 TraceCheckUtils]: 47: Hoare triple {3822#(= (_ bv21 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {3822#(= (_ bv21 32) main_~x~0)} is VALID [2018-11-23 11:27:59,899 INFO L273 TraceCheckUtils]: 48: Hoare triple {3822#(= (_ bv21 32) main_~x~0)} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3829#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:59,906 INFO L273 TraceCheckUtils]: 49: Hoare triple {3829#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} assume !~bvult32(~x~0, 99bv32); {3659#false} is VALID [2018-11-23 11:27:59,907 INFO L256 TraceCheckUtils]: 50: Hoare triple {3659#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {3659#false} is VALID [2018-11-23 11:27:59,907 INFO L273 TraceCheckUtils]: 51: Hoare triple {3659#false} ~cond := #in~cond; {3659#false} is VALID [2018-11-23 11:27:59,908 INFO L273 TraceCheckUtils]: 52: Hoare triple {3659#false} assume 0bv32 == ~cond; {3659#false} is VALID [2018-11-23 11:27:59,908 INFO L273 TraceCheckUtils]: 53: Hoare triple {3659#false} assume !false; {3659#false} is VALID [2018-11-23 11:27:59,912 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:27:59,912 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:28:02,222 INFO L273 TraceCheckUtils]: 53: Hoare triple {3659#false} assume !false; {3659#false} is VALID [2018-11-23 11:28:02,222 INFO L273 TraceCheckUtils]: 52: Hoare triple {3659#false} assume 0bv32 == ~cond; {3659#false} is VALID [2018-11-23 11:28:02,223 INFO L273 TraceCheckUtils]: 51: Hoare triple {3659#false} ~cond := #in~cond; {3659#false} is VALID [2018-11-23 11:28:02,223 INFO L256 TraceCheckUtils]: 50: Hoare triple {3659#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {3659#false} is VALID [2018-11-23 11:28:02,224 INFO L273 TraceCheckUtils]: 49: Hoare triple {3857#(bvult main_~x~0 (_ bv99 32))} assume !~bvult32(~x~0, 99bv32); {3659#false} is VALID [2018-11-23 11:28:02,224 INFO L273 TraceCheckUtils]: 48: Hoare triple {3861#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3857#(bvult main_~x~0 (_ bv99 32))} is VALID [2018-11-23 11:28:02,225 INFO L273 TraceCheckUtils]: 47: Hoare triple {3861#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {3861#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:02,229 INFO L273 TraceCheckUtils]: 46: Hoare triple {3868#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3861#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:02,230 INFO L273 TraceCheckUtils]: 45: Hoare triple {3868#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {3868#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:02,234 INFO L273 TraceCheckUtils]: 44: Hoare triple {3875#(bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3868#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:02,234 INFO L273 TraceCheckUtils]: 43: Hoare triple {3875#(bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {3875#(bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:02,238 INFO L273 TraceCheckUtils]: 42: Hoare triple {3882#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3875#(bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:02,238 INFO L273 TraceCheckUtils]: 41: Hoare triple {3882#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {3882#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:02,242 INFO L273 TraceCheckUtils]: 40: Hoare triple {3889#(bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3882#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:02,243 INFO L273 TraceCheckUtils]: 39: Hoare triple {3889#(bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {3889#(bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:02,247 INFO L273 TraceCheckUtils]: 38: Hoare triple {3896#(bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3889#(bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:02,247 INFO L273 TraceCheckUtils]: 37: Hoare triple {3896#(bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {3896#(bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:02,251 INFO L273 TraceCheckUtils]: 36: Hoare triple {3903#(bvult (bvadd main_~x~0 (_ bv7 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3896#(bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:02,252 INFO L273 TraceCheckUtils]: 35: Hoare triple {3903#(bvult (bvadd main_~x~0 (_ bv7 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {3903#(bvult (bvadd main_~x~0 (_ bv7 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:02,256 INFO L273 TraceCheckUtils]: 34: Hoare triple {3910#(bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3903#(bvult (bvadd main_~x~0 (_ bv7 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:02,257 INFO L273 TraceCheckUtils]: 33: Hoare triple {3910#(bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {3910#(bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:02,262 INFO L273 TraceCheckUtils]: 32: Hoare triple {3917#(bvult (bvadd main_~x~0 (_ bv9 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3910#(bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:02,262 INFO L273 TraceCheckUtils]: 31: Hoare triple {3917#(bvult (bvadd main_~x~0 (_ bv9 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {3917#(bvult (bvadd main_~x~0 (_ bv9 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:02,267 INFO L273 TraceCheckUtils]: 30: Hoare triple {3924#(bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3917#(bvult (bvadd main_~x~0 (_ bv9 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:02,267 INFO L273 TraceCheckUtils]: 29: Hoare triple {3924#(bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {3924#(bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:02,271 INFO L273 TraceCheckUtils]: 28: Hoare triple {3931#(bvult (bvadd main_~x~0 (_ bv11 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3924#(bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:02,272 INFO L273 TraceCheckUtils]: 27: Hoare triple {3931#(bvult (bvadd main_~x~0 (_ bv11 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {3931#(bvult (bvadd main_~x~0 (_ bv11 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:02,276 INFO L273 TraceCheckUtils]: 26: Hoare triple {3938#(bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3931#(bvult (bvadd main_~x~0 (_ bv11 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:02,277 INFO L273 TraceCheckUtils]: 25: Hoare triple {3938#(bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {3938#(bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:02,281 INFO L273 TraceCheckUtils]: 24: Hoare triple {3945#(bvult (bvadd main_~x~0 (_ bv13 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3938#(bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:02,281 INFO L273 TraceCheckUtils]: 23: Hoare triple {3945#(bvult (bvadd main_~x~0 (_ bv13 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {3945#(bvult (bvadd main_~x~0 (_ bv13 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:02,286 INFO L273 TraceCheckUtils]: 22: Hoare triple {3952#(bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3945#(bvult (bvadd main_~x~0 (_ bv13 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:02,287 INFO L273 TraceCheckUtils]: 21: Hoare triple {3952#(bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {3952#(bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:02,290 INFO L273 TraceCheckUtils]: 20: Hoare triple {3959#(bvult (bvadd main_~x~0 (_ bv15 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3952#(bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:02,291 INFO L273 TraceCheckUtils]: 19: Hoare triple {3959#(bvult (bvadd main_~x~0 (_ bv15 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {3959#(bvult (bvadd main_~x~0 (_ bv15 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:02,294 INFO L273 TraceCheckUtils]: 18: Hoare triple {3966#(bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3959#(bvult (bvadd main_~x~0 (_ bv15 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:02,295 INFO L273 TraceCheckUtils]: 17: Hoare triple {3966#(bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {3966#(bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:02,299 INFO L273 TraceCheckUtils]: 16: Hoare triple {3973#(bvult (bvadd main_~x~0 (_ bv17 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3966#(bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:02,299 INFO L273 TraceCheckUtils]: 15: Hoare triple {3973#(bvult (bvadd main_~x~0 (_ bv17 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {3973#(bvult (bvadd main_~x~0 (_ bv17 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:02,304 INFO L273 TraceCheckUtils]: 14: Hoare triple {3980#(bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3973#(bvult (bvadd main_~x~0 (_ bv17 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:02,305 INFO L273 TraceCheckUtils]: 13: Hoare triple {3980#(bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {3980#(bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:02,309 INFO L273 TraceCheckUtils]: 12: Hoare triple {3987#(bvult (bvadd main_~x~0 (_ bv19 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3980#(bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:02,309 INFO L273 TraceCheckUtils]: 11: Hoare triple {3987#(bvult (bvadd main_~x~0 (_ bv19 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {3987#(bvult (bvadd main_~x~0 (_ bv19 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:02,314 INFO L273 TraceCheckUtils]: 10: Hoare triple {3994#(bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3987#(bvult (bvadd main_~x~0 (_ bv19 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:02,315 INFO L273 TraceCheckUtils]: 9: Hoare triple {3994#(bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {3994#(bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:02,319 INFO L273 TraceCheckUtils]: 8: Hoare triple {4001#(bvult (bvadd main_~x~0 (_ bv21 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3994#(bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:02,319 INFO L273 TraceCheckUtils]: 7: Hoare triple {4001#(bvult (bvadd main_~x~0 (_ bv21 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {4001#(bvult (bvadd main_~x~0 (_ bv21 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:02,324 INFO L273 TraceCheckUtils]: 6: Hoare triple {4008#(bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4001#(bvult (bvadd main_~x~0 (_ bv21 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:02,324 INFO L273 TraceCheckUtils]: 5: Hoare triple {4008#(bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {4008#(bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:02,325 INFO L273 TraceCheckUtils]: 4: Hoare triple {3658#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {4008#(bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:02,325 INFO L256 TraceCheckUtils]: 3: Hoare triple {3658#true} call #t~ret2 := main(); {3658#true} is VALID [2018-11-23 11:28:02,325 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3658#true} {3658#true} #37#return; {3658#true} is VALID [2018-11-23 11:28:02,325 INFO L273 TraceCheckUtils]: 1: Hoare triple {3658#true} assume true; {3658#true} is VALID [2018-11-23 11:28:02,326 INFO L256 TraceCheckUtils]: 0: Hoare triple {3658#true} call ULTIMATE.init(); {3658#true} is VALID [2018-11-23 11:28:02,330 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:28:02,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:28:02,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 11:28:02,335 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 54 [2018-11-23 11:28:02,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:28:02,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 11:28:02,569 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:28:02,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 11:28:02,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 11:28:02,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 11:28:02,571 INFO L87 Difference]: Start difference. First operand 114 states and 116 transitions. Second operand 48 states. [2018-11-23 11:28:06,828 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 11:28:13,354 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 11:28:17,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:28:17,842 INFO L93 Difference]: Finished difference Result 167 states and 192 transitions. [2018-11-23 11:28:17,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 11:28:17,842 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 54 [2018-11-23 11:28:17,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:28:17,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:28:17,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 155 transitions. [2018-11-23 11:28:17,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:28:17,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 155 transitions. [2018-11-23 11:28:17,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 155 transitions. [2018-11-23 11:28:18,156 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:28:18,160 INFO L225 Difference]: With dead ends: 167 [2018-11-23 11:28:18,160 INFO L226 Difference]: Without dead ends: 162 [2018-11-23 11:28:18,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 11:28:18,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-23 11:28:18,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-11-23 11:28:18,392 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:28:18,392 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand 162 states. [2018-11-23 11:28:18,392 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 162 states. [2018-11-23 11:28:18,392 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 162 states. [2018-11-23 11:28:18,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:28:18,397 INFO L93 Difference]: Finished difference Result 162 states and 164 transitions. [2018-11-23 11:28:18,397 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 164 transitions. [2018-11-23 11:28:18,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:28:18,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:28:18,398 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 162 states. [2018-11-23 11:28:18,398 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 162 states. [2018-11-23 11:28:18,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:28:18,402 INFO L93 Difference]: Finished difference Result 162 states and 164 transitions. [2018-11-23 11:28:18,402 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 164 transitions. [2018-11-23 11:28:18,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:28:18,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:28:18,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:28:18,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:28:18,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-23 11:28:18,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 164 transitions. [2018-11-23 11:28:18,407 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 164 transitions. Word has length 54 [2018-11-23 11:28:18,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:28:18,407 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 164 transitions. [2018-11-23 11:28:18,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 11:28:18,407 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 164 transitions. [2018-11-23 11:28:18,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 11:28:18,408 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:28:18,408 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:28:18,409 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:28:18,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:28:18,409 INFO L82 PathProgramCache]: Analyzing trace with hash -8172190, now seen corresponding path program 4 times [2018-11-23 11:28:18,409 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:28:18,409 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:28:18,437 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:28:18,516 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:28:18,516 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:28:18,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:28:18,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:28:19,919 INFO L256 TraceCheckUtils]: 0: Hoare triple {4894#true} call ULTIMATE.init(); {4894#true} is VALID [2018-11-23 11:28:19,919 INFO L273 TraceCheckUtils]: 1: Hoare triple {4894#true} assume true; {4894#true} is VALID [2018-11-23 11:28:19,919 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4894#true} {4894#true} #37#return; {4894#true} is VALID [2018-11-23 11:28:19,919 INFO L256 TraceCheckUtils]: 3: Hoare triple {4894#true} call #t~ret2 := main(); {4894#true} is VALID [2018-11-23 11:28:19,920 INFO L273 TraceCheckUtils]: 4: Hoare triple {4894#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {4911#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:28:19,921 INFO L273 TraceCheckUtils]: 5: Hoare triple {4911#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4911#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:28:19,921 INFO L273 TraceCheckUtils]: 6: Hoare triple {4911#(= main_~x~0 (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {4918#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,923 INFO L273 TraceCheckUtils]: 7: Hoare triple {4918#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4918#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,923 INFO L273 TraceCheckUtils]: 8: Hoare triple {4918#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {4925#(= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,925 INFO L273 TraceCheckUtils]: 9: Hoare triple {4925#(= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4925#(= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,925 INFO L273 TraceCheckUtils]: 10: Hoare triple {4925#(= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {4932#(= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,927 INFO L273 TraceCheckUtils]: 11: Hoare triple {4932#(= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4932#(= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,929 INFO L273 TraceCheckUtils]: 12: Hoare triple {4932#(= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {4939#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,929 INFO L273 TraceCheckUtils]: 13: Hoare triple {4939#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4939#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,932 INFO L273 TraceCheckUtils]: 14: Hoare triple {4939#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {4946#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,932 INFO L273 TraceCheckUtils]: 15: Hoare triple {4946#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4946#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,934 INFO L273 TraceCheckUtils]: 16: Hoare triple {4946#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {4953#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,934 INFO L273 TraceCheckUtils]: 17: Hoare triple {4953#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4953#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,937 INFO L273 TraceCheckUtils]: 18: Hoare triple {4953#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {4960#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,937 INFO L273 TraceCheckUtils]: 19: Hoare triple {4960#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4960#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,955 INFO L273 TraceCheckUtils]: 20: Hoare triple {4960#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {4967#(= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,957 INFO L273 TraceCheckUtils]: 21: Hoare triple {4967#(= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4967#(= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,957 INFO L273 TraceCheckUtils]: 22: Hoare triple {4967#(= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {4974#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,959 INFO L273 TraceCheckUtils]: 23: Hoare triple {4974#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4974#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,959 INFO L273 TraceCheckUtils]: 24: Hoare triple {4974#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {4981#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,961 INFO L273 TraceCheckUtils]: 25: Hoare triple {4981#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4981#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,961 INFO L273 TraceCheckUtils]: 26: Hoare triple {4981#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {4988#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,963 INFO L273 TraceCheckUtils]: 27: Hoare triple {4988#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4988#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,963 INFO L273 TraceCheckUtils]: 28: Hoare triple {4988#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {4995#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,965 INFO L273 TraceCheckUtils]: 29: Hoare triple {4995#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4995#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,965 INFO L273 TraceCheckUtils]: 30: Hoare triple {4995#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {5002#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,967 INFO L273 TraceCheckUtils]: 31: Hoare triple {5002#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {5002#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,967 INFO L273 TraceCheckUtils]: 32: Hoare triple {5002#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {5009#(= (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,969 INFO L273 TraceCheckUtils]: 33: Hoare triple {5009#(= (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {5009#(= (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,969 INFO L273 TraceCheckUtils]: 34: Hoare triple {5009#(= (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {5016#(= (bvadd main_~x~0 (_ bv4294967266 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,971 INFO L273 TraceCheckUtils]: 35: Hoare triple {5016#(= (bvadd main_~x~0 (_ bv4294967266 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {5016#(= (bvadd main_~x~0 (_ bv4294967266 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,971 INFO L273 TraceCheckUtils]: 36: Hoare triple {5016#(= (bvadd main_~x~0 (_ bv4294967266 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {5023#(= (bvadd main_~x~0 (_ bv4294967264 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,973 INFO L273 TraceCheckUtils]: 37: Hoare triple {5023#(= (bvadd main_~x~0 (_ bv4294967264 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {5023#(= (bvadd main_~x~0 (_ bv4294967264 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,973 INFO L273 TraceCheckUtils]: 38: Hoare triple {5023#(= (bvadd main_~x~0 (_ bv4294967264 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {5030#(= (bvadd main_~x~0 (_ bv4294967262 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,975 INFO L273 TraceCheckUtils]: 39: Hoare triple {5030#(= (bvadd main_~x~0 (_ bv4294967262 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {5030#(= (bvadd main_~x~0 (_ bv4294967262 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,975 INFO L273 TraceCheckUtils]: 40: Hoare triple {5030#(= (bvadd main_~x~0 (_ bv4294967262 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {5037#(= (bvadd main_~x~0 (_ bv4294967260 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,977 INFO L273 TraceCheckUtils]: 41: Hoare triple {5037#(= (bvadd main_~x~0 (_ bv4294967260 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {5037#(= (bvadd main_~x~0 (_ bv4294967260 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,977 INFO L273 TraceCheckUtils]: 42: Hoare triple {5037#(= (bvadd main_~x~0 (_ bv4294967260 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {5044#(= (bvadd main_~x~0 (_ bv4294967258 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,979 INFO L273 TraceCheckUtils]: 43: Hoare triple {5044#(= (bvadd main_~x~0 (_ bv4294967258 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {5044#(= (bvadd main_~x~0 (_ bv4294967258 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,979 INFO L273 TraceCheckUtils]: 44: Hoare triple {5044#(= (bvadd main_~x~0 (_ bv4294967258 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {5051#(= (bvadd main_~x~0 (_ bv4294967256 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,981 INFO L273 TraceCheckUtils]: 45: Hoare triple {5051#(= (bvadd main_~x~0 (_ bv4294967256 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {5051#(= (bvadd main_~x~0 (_ bv4294967256 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,981 INFO L273 TraceCheckUtils]: 46: Hoare triple {5051#(= (bvadd main_~x~0 (_ bv4294967256 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {5058#(= (_ bv42 32) main_~x~0)} is VALID [2018-11-23 11:28:19,981 INFO L273 TraceCheckUtils]: 47: Hoare triple {5058#(= (_ bv42 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {5058#(= (_ bv42 32) main_~x~0)} is VALID [2018-11-23 11:28:19,982 INFO L273 TraceCheckUtils]: 48: Hoare triple {5058#(= (_ bv42 32) main_~x~0)} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {5065#(= (bvadd main_~x~0 (_ bv4294967252 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,983 INFO L273 TraceCheckUtils]: 49: Hoare triple {5065#(= (bvadd main_~x~0 (_ bv4294967252 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {5065#(= (bvadd main_~x~0 (_ bv4294967252 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,983 INFO L273 TraceCheckUtils]: 50: Hoare triple {5065#(= (bvadd main_~x~0 (_ bv4294967252 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {5072#(= (bvadd main_~x~0 (_ bv4294967250 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,983 INFO L273 TraceCheckUtils]: 51: Hoare triple {5072#(= (bvadd main_~x~0 (_ bv4294967250 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {5072#(= (bvadd main_~x~0 (_ bv4294967250 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,984 INFO L273 TraceCheckUtils]: 52: Hoare triple {5072#(= (bvadd main_~x~0 (_ bv4294967250 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {5079#(= (bvadd main_~x~0 (_ bv4294967248 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,985 INFO L273 TraceCheckUtils]: 53: Hoare triple {5079#(= (bvadd main_~x~0 (_ bv4294967248 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {5079#(= (bvadd main_~x~0 (_ bv4294967248 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,985 INFO L273 TraceCheckUtils]: 54: Hoare triple {5079#(= (bvadd main_~x~0 (_ bv4294967248 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {5086#(= (bvadd main_~x~0 (_ bv4294967246 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,986 INFO L273 TraceCheckUtils]: 55: Hoare triple {5086#(= (bvadd main_~x~0 (_ bv4294967246 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {5086#(= (bvadd main_~x~0 (_ bv4294967246 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,986 INFO L273 TraceCheckUtils]: 56: Hoare triple {5086#(= (bvadd main_~x~0 (_ bv4294967246 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {5093#(= (bvadd main_~x~0 (_ bv4294967244 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,987 INFO L273 TraceCheckUtils]: 57: Hoare triple {5093#(= (bvadd main_~x~0 (_ bv4294967244 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {5093#(= (bvadd main_~x~0 (_ bv4294967244 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,988 INFO L273 TraceCheckUtils]: 58: Hoare triple {5093#(= (bvadd main_~x~0 (_ bv4294967244 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {5100#(= (bvadd main_~x~0 (_ bv4294967242 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,988 INFO L273 TraceCheckUtils]: 59: Hoare triple {5100#(= (bvadd main_~x~0 (_ bv4294967242 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {5100#(= (bvadd main_~x~0 (_ bv4294967242 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,989 INFO L273 TraceCheckUtils]: 60: Hoare triple {5100#(= (bvadd main_~x~0 (_ bv4294967242 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {5107#(= (bvadd main_~x~0 (_ bv4294967240 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,989 INFO L273 TraceCheckUtils]: 61: Hoare triple {5107#(= (bvadd main_~x~0 (_ bv4294967240 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {5107#(= (bvadd main_~x~0 (_ bv4294967240 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,990 INFO L273 TraceCheckUtils]: 62: Hoare triple {5107#(= (bvadd main_~x~0 (_ bv4294967240 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {5114#(= (bvadd main_~x~0 (_ bv4294967238 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,991 INFO L273 TraceCheckUtils]: 63: Hoare triple {5114#(= (bvadd main_~x~0 (_ bv4294967238 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {5114#(= (bvadd main_~x~0 (_ bv4294967238 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:19,991 INFO L273 TraceCheckUtils]: 64: Hoare triple {5114#(= (bvadd main_~x~0 (_ bv4294967238 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {5121#(= (_ bv60 32) main_~x~0)} is VALID [2018-11-23 11:28:19,992 INFO L273 TraceCheckUtils]: 65: Hoare triple {5121#(= (_ bv60 32) main_~x~0)} assume !~bvult32(~x~0, 99bv32); {4895#false} is VALID [2018-11-23 11:28:19,992 INFO L256 TraceCheckUtils]: 66: Hoare triple {4895#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {4895#false} is VALID [2018-11-23 11:28:19,993 INFO L273 TraceCheckUtils]: 67: Hoare triple {4895#false} ~cond := #in~cond; {4895#false} is VALID [2018-11-23 11:28:19,993 INFO L273 TraceCheckUtils]: 68: Hoare triple {4895#false} assume 0bv32 == ~cond; {4895#false} is VALID [2018-11-23 11:28:19,993 INFO L273 TraceCheckUtils]: 69: Hoare triple {4895#false} assume !false; {4895#false} is VALID [2018-11-23 11:28:19,999 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:28:19,999 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:28:23,160 INFO L273 TraceCheckUtils]: 69: Hoare triple {4895#false} assume !false; {4895#false} is VALID [2018-11-23 11:28:23,160 INFO L273 TraceCheckUtils]: 68: Hoare triple {4895#false} assume 0bv32 == ~cond; {4895#false} is VALID [2018-11-23 11:28:23,161 INFO L273 TraceCheckUtils]: 67: Hoare triple {4895#false} ~cond := #in~cond; {4895#false} is VALID [2018-11-23 11:28:23,161 INFO L256 TraceCheckUtils]: 66: Hoare triple {4895#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {4895#false} is VALID [2018-11-23 11:28:23,176 INFO L273 TraceCheckUtils]: 65: Hoare triple {5149#(bvult main_~x~0 (_ bv99 32))} assume !~bvult32(~x~0, 99bv32); {4895#false} is VALID [2018-11-23 11:28:23,178 INFO L273 TraceCheckUtils]: 64: Hoare triple {5153#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {5149#(bvult main_~x~0 (_ bv99 32))} is VALID [2018-11-23 11:28:23,195 INFO L273 TraceCheckUtils]: 63: Hoare triple {5153#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5153#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,210 INFO L273 TraceCheckUtils]: 62: Hoare triple {5160#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {5153#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,225 INFO L273 TraceCheckUtils]: 61: Hoare triple {5160#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5160#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,241 INFO L273 TraceCheckUtils]: 60: Hoare triple {5167#(bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {5160#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,247 INFO L273 TraceCheckUtils]: 59: Hoare triple {5167#(bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5167#(bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,252 INFO L273 TraceCheckUtils]: 58: Hoare triple {5174#(bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {5167#(bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,253 INFO L273 TraceCheckUtils]: 57: Hoare triple {5174#(bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5174#(bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,256 INFO L273 TraceCheckUtils]: 56: Hoare triple {5181#(bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {5174#(bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,257 INFO L273 TraceCheckUtils]: 55: Hoare triple {5181#(bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5181#(bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,261 INFO L273 TraceCheckUtils]: 54: Hoare triple {5188#(bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {5181#(bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,262 INFO L273 TraceCheckUtils]: 53: Hoare triple {5188#(bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5188#(bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,280 INFO L273 TraceCheckUtils]: 52: Hoare triple {5195#(bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {5188#(bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,294 INFO L273 TraceCheckUtils]: 51: Hoare triple {5195#(bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5195#(bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,310 INFO L273 TraceCheckUtils]: 50: Hoare triple {5202#(bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {5195#(bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,324 INFO L273 TraceCheckUtils]: 49: Hoare triple {5202#(bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5202#(bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,334 INFO L273 TraceCheckUtils]: 48: Hoare triple {5209#(bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {5202#(bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,346 INFO L273 TraceCheckUtils]: 47: Hoare triple {5209#(bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5209#(bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,360 INFO L273 TraceCheckUtils]: 46: Hoare triple {5216#(bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {5209#(bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,376 INFO L273 TraceCheckUtils]: 45: Hoare triple {5216#(bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5216#(bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,386 INFO L273 TraceCheckUtils]: 44: Hoare triple {5223#(bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {5216#(bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,394 INFO L273 TraceCheckUtils]: 43: Hoare triple {5223#(bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5223#(bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,409 INFO L273 TraceCheckUtils]: 42: Hoare triple {5230#(bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {5223#(bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,423 INFO L273 TraceCheckUtils]: 41: Hoare triple {5230#(bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5230#(bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,433 INFO L273 TraceCheckUtils]: 40: Hoare triple {5237#(bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {5230#(bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,447 INFO L273 TraceCheckUtils]: 39: Hoare triple {5237#(bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5237#(bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,456 INFO L273 TraceCheckUtils]: 38: Hoare triple {5244#(bvult (bvadd main_~x~0 (_ bv28 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {5237#(bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,469 INFO L273 TraceCheckUtils]: 37: Hoare triple {5244#(bvult (bvadd main_~x~0 (_ bv28 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5244#(bvult (bvadd main_~x~0 (_ bv28 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,482 INFO L273 TraceCheckUtils]: 36: Hoare triple {5251#(bvult (bvadd main_~x~0 (_ bv30 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {5244#(bvult (bvadd main_~x~0 (_ bv28 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,491 INFO L273 TraceCheckUtils]: 35: Hoare triple {5251#(bvult (bvadd main_~x~0 (_ bv30 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5251#(bvult (bvadd main_~x~0 (_ bv30 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,509 INFO L273 TraceCheckUtils]: 34: Hoare triple {5258#(bvult (bvadd main_~x~0 (_ bv32 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {5251#(bvult (bvadd main_~x~0 (_ bv30 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,518 INFO L273 TraceCheckUtils]: 33: Hoare triple {5258#(bvult (bvadd main_~x~0 (_ bv32 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5258#(bvult (bvadd main_~x~0 (_ bv32 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,532 INFO L273 TraceCheckUtils]: 32: Hoare triple {5265#(bvult (bvadd main_~x~0 (_ bv34 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {5258#(bvult (bvadd main_~x~0 (_ bv32 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,544 INFO L273 TraceCheckUtils]: 31: Hoare triple {5265#(bvult (bvadd main_~x~0 (_ bv34 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5265#(bvult (bvadd main_~x~0 (_ bv34 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,557 INFO L273 TraceCheckUtils]: 30: Hoare triple {5272#(bvult (bvadd main_~x~0 (_ bv36 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {5265#(bvult (bvadd main_~x~0 (_ bv34 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,576 INFO L273 TraceCheckUtils]: 29: Hoare triple {5272#(bvult (bvadd main_~x~0 (_ bv36 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5272#(bvult (bvadd main_~x~0 (_ bv36 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,586 INFO L273 TraceCheckUtils]: 28: Hoare triple {5279#(bvult (bvadd main_~x~0 (_ bv38 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {5272#(bvult (bvadd main_~x~0 (_ bv36 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,600 INFO L273 TraceCheckUtils]: 27: Hoare triple {5279#(bvult (bvadd main_~x~0 (_ bv38 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5279#(bvult (bvadd main_~x~0 (_ bv38 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,610 INFO L273 TraceCheckUtils]: 26: Hoare triple {5286#(bvult (bvadd main_~x~0 (_ bv40 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {5279#(bvult (bvadd main_~x~0 (_ bv38 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,623 INFO L273 TraceCheckUtils]: 25: Hoare triple {5286#(bvult (bvadd main_~x~0 (_ bv40 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5286#(bvult (bvadd main_~x~0 (_ bv40 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,640 INFO L273 TraceCheckUtils]: 24: Hoare triple {5293#(bvult (bvadd main_~x~0 (_ bv42 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {5286#(bvult (bvadd main_~x~0 (_ bv40 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,649 INFO L273 TraceCheckUtils]: 23: Hoare triple {5293#(bvult (bvadd main_~x~0 (_ bv42 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5293#(bvult (bvadd main_~x~0 (_ bv42 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,659 INFO L273 TraceCheckUtils]: 22: Hoare triple {5300#(bvult (bvadd main_~x~0 (_ bv44 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {5293#(bvult (bvadd main_~x~0 (_ bv42 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,660 INFO L273 TraceCheckUtils]: 21: Hoare triple {5300#(bvult (bvadd main_~x~0 (_ bv44 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5300#(bvult (bvadd main_~x~0 (_ bv44 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,664 INFO L273 TraceCheckUtils]: 20: Hoare triple {5307#(bvult (bvadd main_~x~0 (_ bv46 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {5300#(bvult (bvadd main_~x~0 (_ bv44 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,665 INFO L273 TraceCheckUtils]: 19: Hoare triple {5307#(bvult (bvadd main_~x~0 (_ bv46 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5307#(bvult (bvadd main_~x~0 (_ bv46 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,669 INFO L273 TraceCheckUtils]: 18: Hoare triple {5314#(bvult (bvadd main_~x~0 (_ bv48 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {5307#(bvult (bvadd main_~x~0 (_ bv46 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,670 INFO L273 TraceCheckUtils]: 17: Hoare triple {5314#(bvult (bvadd main_~x~0 (_ bv48 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5314#(bvult (bvadd main_~x~0 (_ bv48 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,674 INFO L273 TraceCheckUtils]: 16: Hoare triple {5321#(bvult (bvadd main_~x~0 (_ bv50 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {5314#(bvult (bvadd main_~x~0 (_ bv48 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,674 INFO L273 TraceCheckUtils]: 15: Hoare triple {5321#(bvult (bvadd main_~x~0 (_ bv50 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5321#(bvult (bvadd main_~x~0 (_ bv50 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,677 INFO L273 TraceCheckUtils]: 14: Hoare triple {5328#(bvult (bvadd main_~x~0 (_ bv52 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {5321#(bvult (bvadd main_~x~0 (_ bv50 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,678 INFO L273 TraceCheckUtils]: 13: Hoare triple {5328#(bvult (bvadd main_~x~0 (_ bv52 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5328#(bvult (bvadd main_~x~0 (_ bv52 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,683 INFO L273 TraceCheckUtils]: 12: Hoare triple {5335#(bvult (bvadd main_~x~0 (_ bv54 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {5328#(bvult (bvadd main_~x~0 (_ bv52 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,683 INFO L273 TraceCheckUtils]: 11: Hoare triple {5335#(bvult (bvadd main_~x~0 (_ bv54 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5335#(bvult (bvadd main_~x~0 (_ bv54 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,688 INFO L273 TraceCheckUtils]: 10: Hoare triple {5342#(bvult (bvadd main_~x~0 (_ bv56 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {5335#(bvult (bvadd main_~x~0 (_ bv54 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,688 INFO L273 TraceCheckUtils]: 9: Hoare triple {5342#(bvult (bvadd main_~x~0 (_ bv56 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5342#(bvult (bvadd main_~x~0 (_ bv56 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,692 INFO L273 TraceCheckUtils]: 8: Hoare triple {5349#(bvult (bvadd main_~x~0 (_ bv58 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {5342#(bvult (bvadd main_~x~0 (_ bv56 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,693 INFO L273 TraceCheckUtils]: 7: Hoare triple {5349#(bvult (bvadd main_~x~0 (_ bv58 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5349#(bvult (bvadd main_~x~0 (_ bv58 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,697 INFO L273 TraceCheckUtils]: 6: Hoare triple {5356#(bvult (bvadd main_~x~0 (_ bv60 32)) (_ bv99 32))} assume !(0bv32 == ~bvurem32(~y~0, 2bv32));~x~0 := ~bvadd32(2bv32, ~x~0); {5349#(bvult (bvadd main_~x~0 (_ bv58 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,697 INFO L273 TraceCheckUtils]: 5: Hoare triple {5356#(bvult (bvadd main_~x~0 (_ bv60 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5356#(bvult (bvadd main_~x~0 (_ bv60 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,698 INFO L273 TraceCheckUtils]: 4: Hoare triple {4894#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {5356#(bvult (bvadd main_~x~0 (_ bv60 32)) (_ bv99 32))} is VALID [2018-11-23 11:28:23,698 INFO L256 TraceCheckUtils]: 3: Hoare triple {4894#true} call #t~ret2 := main(); {4894#true} is VALID [2018-11-23 11:28:23,698 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4894#true} {4894#true} #37#return; {4894#true} is VALID [2018-11-23 11:28:23,698 INFO L273 TraceCheckUtils]: 1: Hoare triple {4894#true} assume true; {4894#true} is VALID [2018-11-23 11:28:23,698 INFO L256 TraceCheckUtils]: 0: Hoare triple {4894#true} call ULTIMATE.init(); {4894#true} is VALID [2018-11-23 11:28:23,704 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:28:23,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:28:23,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 64 [2018-11-23 11:28:23,707 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 70 [2018-11-23 11:28:23,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:28:23,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 64 states. [2018-11-23 11:28:24,021 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:28:24,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-11-23 11:28:24,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-11-23 11:28:24,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1020, Invalid=3012, Unknown=0, NotChecked=0, Total=4032 [2018-11-23 11:28:24,023 INFO L87 Difference]: Start difference. First operand 162 states and 164 transitions. Second operand 64 states. [2018-11-23 11:28:25,557 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 7 [2018-11-23 11:28:26,950 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 7 [2018-11-23 11:28:28,326 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 7 [2018-11-23 11:28:29,741 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 7 [2018-11-23 11:28:31,247 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 7 [2018-11-23 11:28:32,610 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 7 [2018-11-23 11:28:33,975 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 7 [2018-11-23 11:28:35,309 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 7 [2018-11-23 11:28:37,068 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 11:28:38,385 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 11:28:39,767 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 11:28:41,128 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 11:28:57,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:28:57,745 INFO L93 Difference]: Finished difference Result 207 states and 228 transitions. [2018-11-23 11:28:57,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-11-23 11:28:57,746 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 70 [2018-11-23 11:28:57,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:28:57,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 11:28:57,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 179 transitions. [2018-11-23 11:28:57,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 11:28:57,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 179 transitions. [2018-11-23 11:28:57,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 64 states and 179 transitions. [2018-11-23 11:28:58,578 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:28:58,583 INFO L225 Difference]: With dead ends: 207 [2018-11-23 11:28:58,584 INFO L226 Difference]: Without dead ends: 202 [2018-11-23 11:28:58,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 27.7s TimeCoverageRelationStatistics Valid=2874, Invalid=5868, Unknown=0, NotChecked=0, Total=8742 [2018-11-23 11:28:58,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-11-23 11:28:58,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2018-11-23 11:28:58,802 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:28:58,802 INFO L82 GeneralOperation]: Start isEquivalent. First operand 202 states. Second operand 202 states. [2018-11-23 11:28:58,802 INFO L74 IsIncluded]: Start isIncluded. First operand 202 states. Second operand 202 states. [2018-11-23 11:28:58,802 INFO L87 Difference]: Start difference. First operand 202 states. Second operand 202 states. [2018-11-23 11:28:58,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:28:58,808 INFO L93 Difference]: Finished difference Result 202 states and 204 transitions. [2018-11-23 11:28:58,808 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 204 transitions. [2018-11-23 11:28:58,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:28:58,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:28:58,809 INFO L74 IsIncluded]: Start isIncluded. First operand 202 states. Second operand 202 states. [2018-11-23 11:28:58,809 INFO L87 Difference]: Start difference. First operand 202 states. Second operand 202 states. [2018-11-23 11:28:58,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:28:58,814 INFO L93 Difference]: Finished difference Result 202 states and 204 transitions. [2018-11-23 11:28:58,814 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 204 transitions. [2018-11-23 11:28:58,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:28:58,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:28:58,815 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:28:58,815 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:28:58,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-11-23 11:28:58,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 204 transitions. [2018-11-23 11:28:58,820 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 204 transitions. Word has length 70 [2018-11-23 11:28:58,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:28:58,821 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 204 transitions. [2018-11-23 11:28:58,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-11-23 11:28:58,821 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 204 transitions. [2018-11-23 11:28:58,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-23 11:28:58,822 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:28:58,823 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:28:58,823 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:28:58,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:28:58,823 INFO L82 PathProgramCache]: Analyzing trace with hash -99011474, now seen corresponding path program 5 times [2018-11-23 11:28:58,824 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:28:58,824 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:28:58,853 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-11-23 11:29:02,379 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2018-11-23 11:29:02,379 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:29:02,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:02,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:29:03,972 INFO L256 TraceCheckUtils]: 0: Hoare triple {6458#true} call ULTIMATE.init(); {6458#true} is VALID [2018-11-23 11:29:03,972 INFO L273 TraceCheckUtils]: 1: Hoare triple {6458#true} assume true; {6458#true} is VALID [2018-11-23 11:29:03,972 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6458#true} {6458#true} #37#return; {6458#true} is VALID [2018-11-23 11:29:03,972 INFO L256 TraceCheckUtils]: 3: Hoare triple {6458#true} call #t~ret2 := main(); {6458#true} is VALID [2018-11-23 11:29:03,973 INFO L273 TraceCheckUtils]: 4: Hoare triple {6458#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {6475#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:03,973 INFO L273 TraceCheckUtils]: 5: Hoare triple {6475#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6475#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:03,973 INFO L273 TraceCheckUtils]: 6: Hoare triple {6475#(= main_~x~0 (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6482#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:03,974 INFO L273 TraceCheckUtils]: 7: Hoare triple {6482#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6482#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:03,974 INFO L273 TraceCheckUtils]: 8: Hoare triple {6482#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6489#(= (_ bv2 32) main_~x~0)} is VALID [2018-11-23 11:29:03,974 INFO L273 TraceCheckUtils]: 9: Hoare triple {6489#(= (_ bv2 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {6489#(= (_ bv2 32) main_~x~0)} is VALID [2018-11-23 11:29:03,975 INFO L273 TraceCheckUtils]: 10: Hoare triple {6489#(= (_ bv2 32) main_~x~0)} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6496#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:03,975 INFO L273 TraceCheckUtils]: 11: Hoare triple {6496#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6496#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:03,976 INFO L273 TraceCheckUtils]: 12: Hoare triple {6496#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6503#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-23 11:29:03,976 INFO L273 TraceCheckUtils]: 13: Hoare triple {6503#(= (_ bv4 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {6503#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-23 11:29:03,977 INFO L273 TraceCheckUtils]: 14: Hoare triple {6503#(= (_ bv4 32) main_~x~0)} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6510#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:03,978 INFO L273 TraceCheckUtils]: 15: Hoare triple {6510#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6510#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:03,978 INFO L273 TraceCheckUtils]: 16: Hoare triple {6510#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6517#(= (_ bv6 32) main_~x~0)} is VALID [2018-11-23 11:29:03,979 INFO L273 TraceCheckUtils]: 17: Hoare triple {6517#(= (_ bv6 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {6517#(= (_ bv6 32) main_~x~0)} is VALID [2018-11-23 11:29:03,980 INFO L273 TraceCheckUtils]: 18: Hoare triple {6517#(= (_ bv6 32) main_~x~0)} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6524#(= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:03,980 INFO L273 TraceCheckUtils]: 19: Hoare triple {6524#(= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6524#(= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:03,981 INFO L273 TraceCheckUtils]: 20: Hoare triple {6524#(= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6531#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:03,982 INFO L273 TraceCheckUtils]: 21: Hoare triple {6531#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6531#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:03,982 INFO L273 TraceCheckUtils]: 22: Hoare triple {6531#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6538#(= (bvadd main_~x~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:03,983 INFO L273 TraceCheckUtils]: 23: Hoare triple {6538#(= (bvadd main_~x~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6538#(= (bvadd main_~x~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:03,984 INFO L273 TraceCheckUtils]: 24: Hoare triple {6538#(= (bvadd main_~x~0 (_ bv4294967287 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6545#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:03,984 INFO L273 TraceCheckUtils]: 25: Hoare triple {6545#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6545#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:03,985 INFO L273 TraceCheckUtils]: 26: Hoare triple {6545#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6552#(= (bvadd main_~x~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:03,986 INFO L273 TraceCheckUtils]: 27: Hoare triple {6552#(= (bvadd main_~x~0 (_ bv4294967285 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6552#(= (bvadd main_~x~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:03,986 INFO L273 TraceCheckUtils]: 28: Hoare triple {6552#(= (bvadd main_~x~0 (_ bv4294967285 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6559#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:03,987 INFO L273 TraceCheckUtils]: 29: Hoare triple {6559#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6559#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:03,988 INFO L273 TraceCheckUtils]: 30: Hoare triple {6559#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6566#(= (_ bv13 32) main_~x~0)} is VALID [2018-11-23 11:29:03,988 INFO L273 TraceCheckUtils]: 31: Hoare triple {6566#(= (_ bv13 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {6566#(= (_ bv13 32) main_~x~0)} is VALID [2018-11-23 11:29:03,989 INFO L273 TraceCheckUtils]: 32: Hoare triple {6566#(= (_ bv13 32) main_~x~0)} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6573#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:03,989 INFO L273 TraceCheckUtils]: 33: Hoare triple {6573#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6573#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:03,990 INFO L273 TraceCheckUtils]: 34: Hoare triple {6573#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6580#(= (bvadd main_~x~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:03,991 INFO L273 TraceCheckUtils]: 35: Hoare triple {6580#(= (bvadd main_~x~0 (_ bv4294967281 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6580#(= (bvadd main_~x~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:03,991 INFO L273 TraceCheckUtils]: 36: Hoare triple {6580#(= (bvadd main_~x~0 (_ bv4294967281 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6587#(= (_ bv16 32) main_~x~0)} is VALID [2018-11-23 11:29:03,992 INFO L273 TraceCheckUtils]: 37: Hoare triple {6587#(= (_ bv16 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {6587#(= (_ bv16 32) main_~x~0)} is VALID [2018-11-23 11:29:03,993 INFO L273 TraceCheckUtils]: 38: Hoare triple {6587#(= (_ bv16 32) main_~x~0)} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6594#(= (bvadd main_~x~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:03,993 INFO L273 TraceCheckUtils]: 39: Hoare triple {6594#(= (bvadd main_~x~0 (_ bv4294967279 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6594#(= (bvadd main_~x~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:03,994 INFO L273 TraceCheckUtils]: 40: Hoare triple {6594#(= (bvadd main_~x~0 (_ bv4294967279 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6601#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:03,995 INFO L273 TraceCheckUtils]: 41: Hoare triple {6601#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6601#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:03,995 INFO L273 TraceCheckUtils]: 42: Hoare triple {6601#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6608#(= (bvadd main_~x~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:03,996 INFO L273 TraceCheckUtils]: 43: Hoare triple {6608#(= (bvadd main_~x~0 (_ bv4294967277 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6608#(= (bvadd main_~x~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:03,997 INFO L273 TraceCheckUtils]: 44: Hoare triple {6608#(= (bvadd main_~x~0 (_ bv4294967277 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6615#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:03,997 INFO L273 TraceCheckUtils]: 45: Hoare triple {6615#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6615#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:03,998 INFO L273 TraceCheckUtils]: 46: Hoare triple {6615#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6622#(= (_ bv21 32) main_~x~0)} is VALID [2018-11-23 11:29:03,998 INFO L273 TraceCheckUtils]: 47: Hoare triple {6622#(= (_ bv21 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {6622#(= (_ bv21 32) main_~x~0)} is VALID [2018-11-23 11:29:03,999 INFO L273 TraceCheckUtils]: 48: Hoare triple {6622#(= (_ bv21 32) main_~x~0)} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6629#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:04,000 INFO L273 TraceCheckUtils]: 49: Hoare triple {6629#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6629#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:04,001 INFO L273 TraceCheckUtils]: 50: Hoare triple {6629#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6636#(= (bvadd main_~x~0 (_ bv4294967273 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:04,001 INFO L273 TraceCheckUtils]: 51: Hoare triple {6636#(= (bvadd main_~x~0 (_ bv4294967273 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6636#(= (bvadd main_~x~0 (_ bv4294967273 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:04,002 INFO L273 TraceCheckUtils]: 52: Hoare triple {6636#(= (bvadd main_~x~0 (_ bv4294967273 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6643#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:04,002 INFO L273 TraceCheckUtils]: 53: Hoare triple {6643#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6643#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:04,003 INFO L273 TraceCheckUtils]: 54: Hoare triple {6643#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6650#(= (bvadd main_~x~0 (_ bv4294967271 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:04,004 INFO L273 TraceCheckUtils]: 55: Hoare triple {6650#(= (bvadd main_~x~0 (_ bv4294967271 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6650#(= (bvadd main_~x~0 (_ bv4294967271 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:04,004 INFO L273 TraceCheckUtils]: 56: Hoare triple {6650#(= (bvadd main_~x~0 (_ bv4294967271 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6657#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:04,005 INFO L273 TraceCheckUtils]: 57: Hoare triple {6657#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6657#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:04,006 INFO L273 TraceCheckUtils]: 58: Hoare triple {6657#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6664#(= (bvadd main_~x~0 (_ bv4294967269 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:04,006 INFO L273 TraceCheckUtils]: 59: Hoare triple {6664#(= (bvadd main_~x~0 (_ bv4294967269 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6664#(= (bvadd main_~x~0 (_ bv4294967269 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:04,007 INFO L273 TraceCheckUtils]: 60: Hoare triple {6664#(= (bvadd main_~x~0 (_ bv4294967269 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6671#(= (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:04,008 INFO L273 TraceCheckUtils]: 61: Hoare triple {6671#(= (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6671#(= (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:04,008 INFO L273 TraceCheckUtils]: 62: Hoare triple {6671#(= (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6678#(= (bvadd main_~x~0 (_ bv4294967267 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:04,009 INFO L273 TraceCheckUtils]: 63: Hoare triple {6678#(= (bvadd main_~x~0 (_ bv4294967267 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6678#(= (bvadd main_~x~0 (_ bv4294967267 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:04,010 INFO L273 TraceCheckUtils]: 64: Hoare triple {6678#(= (bvadd main_~x~0 (_ bv4294967267 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6685#(= (bvadd main_~x~0 (_ bv4294967266 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:04,010 INFO L273 TraceCheckUtils]: 65: Hoare triple {6685#(= (bvadd main_~x~0 (_ bv4294967266 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6685#(= (bvadd main_~x~0 (_ bv4294967266 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:04,011 INFO L273 TraceCheckUtils]: 66: Hoare triple {6685#(= (bvadd main_~x~0 (_ bv4294967266 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6692#(= (bvadd main_~x~0 (_ bv4294967265 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:04,012 INFO L273 TraceCheckUtils]: 67: Hoare triple {6692#(= (bvadd main_~x~0 (_ bv4294967265 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6692#(= (bvadd main_~x~0 (_ bv4294967265 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:04,012 INFO L273 TraceCheckUtils]: 68: Hoare triple {6692#(= (bvadd main_~x~0 (_ bv4294967265 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6699#(= (bvadd main_~x~0 (_ bv4294967264 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:04,013 INFO L273 TraceCheckUtils]: 69: Hoare triple {6699#(= (bvadd main_~x~0 (_ bv4294967264 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6699#(= (bvadd main_~x~0 (_ bv4294967264 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:04,014 INFO L273 TraceCheckUtils]: 70: Hoare triple {6699#(= (bvadd main_~x~0 (_ bv4294967264 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6706#(= (bvadd main_~x~0 (_ bv4294967263 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:04,014 INFO L273 TraceCheckUtils]: 71: Hoare triple {6706#(= (bvadd main_~x~0 (_ bv4294967263 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6706#(= (bvadd main_~x~0 (_ bv4294967263 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:04,015 INFO L273 TraceCheckUtils]: 72: Hoare triple {6706#(= (bvadd main_~x~0 (_ bv4294967263 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6713#(= (bvadd main_~x~0 (_ bv4294967262 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:04,016 INFO L273 TraceCheckUtils]: 73: Hoare triple {6713#(= (bvadd main_~x~0 (_ bv4294967262 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6713#(= (bvadd main_~x~0 (_ bv4294967262 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:04,016 INFO L273 TraceCheckUtils]: 74: Hoare triple {6713#(= (bvadd main_~x~0 (_ bv4294967262 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6720#(= (_ bv35 32) main_~x~0)} is VALID [2018-11-23 11:29:04,017 INFO L273 TraceCheckUtils]: 75: Hoare triple {6720#(= (_ bv35 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {6720#(= (_ bv35 32) main_~x~0)} is VALID [2018-11-23 11:29:04,018 INFO L273 TraceCheckUtils]: 76: Hoare triple {6720#(= (_ bv35 32) main_~x~0)} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6727#(= (bvadd main_~x~0 (_ bv4294967260 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:04,018 INFO L273 TraceCheckUtils]: 77: Hoare triple {6727#(= (bvadd main_~x~0 (_ bv4294967260 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6727#(= (bvadd main_~x~0 (_ bv4294967260 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:04,019 INFO L273 TraceCheckUtils]: 78: Hoare triple {6727#(= (bvadd main_~x~0 (_ bv4294967260 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6734#(= (_ bv37 32) main_~x~0)} is VALID [2018-11-23 11:29:04,019 INFO L273 TraceCheckUtils]: 79: Hoare triple {6734#(= (_ bv37 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {6734#(= (_ bv37 32) main_~x~0)} is VALID [2018-11-23 11:29:04,020 INFO L273 TraceCheckUtils]: 80: Hoare triple {6734#(= (_ bv37 32) main_~x~0)} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6741#(= (bvadd main_~x~0 (_ bv4294967258 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:04,021 INFO L273 TraceCheckUtils]: 81: Hoare triple {6741#(= (bvadd main_~x~0 (_ bv4294967258 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6741#(= (bvadd main_~x~0 (_ bv4294967258 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:04,021 INFO L273 TraceCheckUtils]: 82: Hoare triple {6741#(= (bvadd main_~x~0 (_ bv4294967258 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6748#(= (_ bv39 32) main_~x~0)} is VALID [2018-11-23 11:29:04,044 INFO L273 TraceCheckUtils]: 83: Hoare triple {6748#(= (_ bv39 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {6748#(= (_ bv39 32) main_~x~0)} is VALID [2018-11-23 11:29:04,045 INFO L273 TraceCheckUtils]: 84: Hoare triple {6748#(= (_ bv39 32) main_~x~0)} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6755#(= (bvadd main_~x~0 (_ bv4294967256 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:04,045 INFO L273 TraceCheckUtils]: 85: Hoare triple {6755#(= (bvadd main_~x~0 (_ bv4294967256 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6755#(= (bvadd main_~x~0 (_ bv4294967256 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:04,045 INFO L273 TraceCheckUtils]: 86: Hoare triple {6755#(= (bvadd main_~x~0 (_ bv4294967256 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6762#(= (_ bv41 32) main_~x~0)} is VALID [2018-11-23 11:29:04,046 INFO L273 TraceCheckUtils]: 87: Hoare triple {6762#(= (_ bv41 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {6762#(= (_ bv41 32) main_~x~0)} is VALID [2018-11-23 11:29:04,046 INFO L273 TraceCheckUtils]: 88: Hoare triple {6762#(= (_ bv41 32) main_~x~0)} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6769#(= (bvadd main_~x~0 (_ bv4294967254 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:04,046 INFO L273 TraceCheckUtils]: 89: Hoare triple {6769#(= (bvadd main_~x~0 (_ bv4294967254 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6769#(= (bvadd main_~x~0 (_ bv4294967254 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:04,047 INFO L273 TraceCheckUtils]: 90: Hoare triple {6769#(= (bvadd main_~x~0 (_ bv4294967254 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6776#(= (bvadd main_~x~0 (_ bv4294967253 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:04,048 INFO L273 TraceCheckUtils]: 91: Hoare triple {6776#(= (bvadd main_~x~0 (_ bv4294967253 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6776#(= (bvadd main_~x~0 (_ bv4294967253 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:04,049 INFO L273 TraceCheckUtils]: 92: Hoare triple {6776#(= (bvadd main_~x~0 (_ bv4294967253 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6783#(= (bvadd main_~x~0 (_ bv4294967252 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:04,049 INFO L273 TraceCheckUtils]: 93: Hoare triple {6783#(= (bvadd main_~x~0 (_ bv4294967252 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6783#(= (bvadd main_~x~0 (_ bv4294967252 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:04,050 INFO L273 TraceCheckUtils]: 94: Hoare triple {6783#(= (bvadd main_~x~0 (_ bv4294967252 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6790#(= (_ bv45 32) main_~x~0)} is VALID [2018-11-23 11:29:04,050 INFO L273 TraceCheckUtils]: 95: Hoare triple {6790#(= (_ bv45 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {6790#(= (_ bv45 32) main_~x~0)} is VALID [2018-11-23 11:29:04,051 INFO L273 TraceCheckUtils]: 96: Hoare triple {6790#(= (_ bv45 32) main_~x~0)} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6797#(= (bvadd main_~x~0 (_ bv4294967250 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:04,052 INFO L273 TraceCheckUtils]: 97: Hoare triple {6797#(= (bvadd main_~x~0 (_ bv4294967250 32)) (_ bv0 32))} assume !~bvult32(~x~0, 99bv32); {6459#false} is VALID [2018-11-23 11:29:04,052 INFO L256 TraceCheckUtils]: 98: Hoare triple {6459#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {6459#false} is VALID [2018-11-23 11:29:04,052 INFO L273 TraceCheckUtils]: 99: Hoare triple {6459#false} ~cond := #in~cond; {6459#false} is VALID [2018-11-23 11:29:04,053 INFO L273 TraceCheckUtils]: 100: Hoare triple {6459#false} assume 0bv32 == ~cond; {6459#false} is VALID [2018-11-23 11:29:04,053 INFO L273 TraceCheckUtils]: 101: Hoare triple {6459#false} assume !false; {6459#false} is VALID [2018-11-23 11:29:04,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:29:04,068 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:29:17,700 INFO L273 TraceCheckUtils]: 101: Hoare triple {6459#false} assume !false; {6459#false} is VALID [2018-11-23 11:29:17,700 INFO L273 TraceCheckUtils]: 100: Hoare triple {6459#false} assume 0bv32 == ~cond; {6459#false} is VALID [2018-11-23 11:29:17,700 INFO L273 TraceCheckUtils]: 99: Hoare triple {6459#false} ~cond := #in~cond; {6459#false} is VALID [2018-11-23 11:29:17,701 INFO L256 TraceCheckUtils]: 98: Hoare triple {6459#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {6459#false} is VALID [2018-11-23 11:29:17,701 INFO L273 TraceCheckUtils]: 97: Hoare triple {6825#(bvult main_~x~0 (_ bv99 32))} assume !~bvult32(~x~0, 99bv32); {6459#false} is VALID [2018-11-23 11:29:17,702 INFO L273 TraceCheckUtils]: 96: Hoare triple {6829#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6825#(bvult main_~x~0 (_ bv99 32))} is VALID [2018-11-23 11:29:17,702 INFO L273 TraceCheckUtils]: 95: Hoare triple {6833#(or (not (bvult main_~x~0 (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {6829#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))} is VALID [2018-11-23 11:29:17,706 INFO L273 TraceCheckUtils]: 94: Hoare triple {6837#(or (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6833#(or (not (bvult main_~x~0 (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:17,706 INFO L273 TraceCheckUtils]: 93: Hoare triple {6837#(or (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {6837#(or (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:17,710 INFO L273 TraceCheckUtils]: 92: Hoare triple {6844#(or (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6837#(or (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:17,711 INFO L273 TraceCheckUtils]: 91: Hoare triple {6844#(or (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {6844#(or (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:17,714 INFO L273 TraceCheckUtils]: 90: Hoare triple {6851#(or (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6844#(or (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:17,715 INFO L273 TraceCheckUtils]: 89: Hoare triple {6851#(or (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {6851#(or (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:17,718 INFO L273 TraceCheckUtils]: 88: Hoare triple {6858#(or (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv99 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6851#(or (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:17,719 INFO L273 TraceCheckUtils]: 87: Hoare triple {6858#(or (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {6858#(or (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:17,724 INFO L273 TraceCheckUtils]: 86: Hoare triple {6865#(or (not (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6858#(or (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:17,724 INFO L273 TraceCheckUtils]: 85: Hoare triple {6865#(or (not (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {6865#(or (not (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:17,729 INFO L273 TraceCheckUtils]: 84: Hoare triple {6872#(or (not (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv7 32)) (_ bv99 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6865#(or (not (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:17,729 INFO L273 TraceCheckUtils]: 83: Hoare triple {6872#(or (not (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv7 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {6872#(or (not (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv7 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:17,737 INFO L273 TraceCheckUtils]: 82: Hoare triple {6879#(or (not (bvult (bvadd main_~x~0 (_ bv7 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6872#(or (not (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv7 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:17,737 INFO L273 TraceCheckUtils]: 81: Hoare triple {6879#(or (not (bvult (bvadd main_~x~0 (_ bv7 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {6879#(or (not (bvult (bvadd main_~x~0 (_ bv7 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:17,741 INFO L273 TraceCheckUtils]: 80: Hoare triple {6886#(or (bvult (bvadd main_~x~0 (_ bv9 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6879#(or (not (bvult (bvadd main_~x~0 (_ bv7 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:17,741 INFO L273 TraceCheckUtils]: 79: Hoare triple {6886#(or (bvult (bvadd main_~x~0 (_ bv9 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {6886#(or (bvult (bvadd main_~x~0 (_ bv9 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:17,745 INFO L273 TraceCheckUtils]: 78: Hoare triple {6893#(or (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv9 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6886#(or (bvult (bvadd main_~x~0 (_ bv9 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:17,745 INFO L273 TraceCheckUtils]: 77: Hoare triple {6893#(or (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv9 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {6893#(or (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv9 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:17,749 INFO L273 TraceCheckUtils]: 76: Hoare triple {6900#(or (not (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv11 32)) (_ bv99 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6893#(or (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv9 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:17,750 INFO L273 TraceCheckUtils]: 75: Hoare triple {6900#(or (not (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv11 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {6900#(or (not (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv11 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:17,754 INFO L273 TraceCheckUtils]: 74: Hoare triple {6907#(or (bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv11 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6900#(or (not (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv11 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:17,754 INFO L273 TraceCheckUtils]: 73: Hoare triple {6907#(or (bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv11 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {6907#(or (bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv11 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:17,758 INFO L273 TraceCheckUtils]: 72: Hoare triple {6914#(or (bvult (bvadd main_~x~0 (_ bv13 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6907#(or (bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv11 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:17,759 INFO L273 TraceCheckUtils]: 71: Hoare triple {6914#(or (bvult (bvadd main_~x~0 (_ bv13 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {6914#(or (bvult (bvadd main_~x~0 (_ bv13 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:17,764 INFO L273 TraceCheckUtils]: 70: Hoare triple {6921#(or (not (bvult (bvadd main_~x~0 (_ bv13 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6914#(or (bvult (bvadd main_~x~0 (_ bv13 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:17,764 INFO L273 TraceCheckUtils]: 69: Hoare triple {6921#(or (not (bvult (bvadd main_~x~0 (_ bv13 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {6921#(or (not (bvult (bvadd main_~x~0 (_ bv13 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:17,769 INFO L273 TraceCheckUtils]: 68: Hoare triple {6928#(or (not (bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv15 32)) (_ bv99 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6921#(or (not (bvult (bvadd main_~x~0 (_ bv13 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:17,769 INFO L273 TraceCheckUtils]: 67: Hoare triple {6928#(or (not (bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv15 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {6928#(or (not (bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv15 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:17,773 INFO L273 TraceCheckUtils]: 66: Hoare triple {6935#(or (bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv15 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6928#(or (not (bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv15 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:17,774 INFO L273 TraceCheckUtils]: 65: Hoare triple {6935#(or (bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv15 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {6935#(or (bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv15 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:17,778 INFO L273 TraceCheckUtils]: 64: Hoare triple {6942#(or (bvult (bvadd main_~x~0 (_ bv17 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6935#(or (bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv15 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:17,778 INFO L273 TraceCheckUtils]: 63: Hoare triple {6942#(or (bvult (bvadd main_~x~0 (_ bv17 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {6942#(or (bvult (bvadd main_~x~0 (_ bv17 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:17,782 INFO L273 TraceCheckUtils]: 62: Hoare triple {6949#(or (bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv17 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6942#(or (bvult (bvadd main_~x~0 (_ bv17 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:17,782 INFO L273 TraceCheckUtils]: 61: Hoare triple {6949#(or (bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv17 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {6949#(or (bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv17 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:17,787 INFO L273 TraceCheckUtils]: 60: Hoare triple {6956#(or (bvult (bvadd main_~x~0 (_ bv19 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6949#(or (bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv17 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:17,787 INFO L273 TraceCheckUtils]: 59: Hoare triple {6956#(or (bvult (bvadd main_~x~0 (_ bv19 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {6956#(or (bvult (bvadd main_~x~0 (_ bv19 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:17,795 INFO L273 TraceCheckUtils]: 58: Hoare triple {6963#(or (bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv19 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6956#(or (bvult (bvadd main_~x~0 (_ bv19 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:17,796 INFO L273 TraceCheckUtils]: 57: Hoare triple {6963#(or (bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv19 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {6963#(or (bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv19 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:17,801 INFO L273 TraceCheckUtils]: 56: Hoare triple {6970#(or (not (bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv21 32)) (_ bv99 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6963#(or (bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv19 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:17,801 INFO L273 TraceCheckUtils]: 55: Hoare triple {6970#(or (not (bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv21 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {6970#(or (not (bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv21 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:17,805 INFO L273 TraceCheckUtils]: 54: Hoare triple {6977#(or (not (bvult (bvadd main_~x~0 (_ bv21 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6970#(or (not (bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv21 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:17,806 INFO L273 TraceCheckUtils]: 53: Hoare triple {6977#(or (not (bvult (bvadd main_~x~0 (_ bv21 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {6977#(or (not (bvult (bvadd main_~x~0 (_ bv21 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:17,811 INFO L273 TraceCheckUtils]: 52: Hoare triple {6984#(or (not (bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv23 32)) (_ bv99 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6977#(or (not (bvult (bvadd main_~x~0 (_ bv21 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:17,812 INFO L273 TraceCheckUtils]: 51: Hoare triple {6984#(or (not (bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv23 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {6984#(or (not (bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv23 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:17,816 INFO L273 TraceCheckUtils]: 50: Hoare triple {6991#(or (bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv23 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6984#(or (not (bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv23 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:17,816 INFO L273 TraceCheckUtils]: 49: Hoare triple {6991#(or (bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv23 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {6991#(or (bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv23 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:17,820 INFO L273 TraceCheckUtils]: 48: Hoare triple {6998#(or (not (bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv25 32)) (_ bv99 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6991#(or (bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv23 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:17,820 INFO L273 TraceCheckUtils]: 47: Hoare triple {6998#(or (not (bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv25 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {6998#(or (not (bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv25 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:17,825 INFO L273 TraceCheckUtils]: 46: Hoare triple {7005#(or (bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv25 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6998#(or (not (bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv25 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:17,825 INFO L273 TraceCheckUtils]: 45: Hoare triple {7005#(or (bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv25 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {7005#(or (bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv25 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:17,829 INFO L273 TraceCheckUtils]: 44: Hoare triple {7012#(or (not (bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv27 32)) (_ bv99 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {7005#(or (bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv25 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:17,829 INFO L273 TraceCheckUtils]: 43: Hoare triple {7012#(or (not (bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv27 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {7012#(or (not (bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv27 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:17,835 INFO L273 TraceCheckUtils]: 42: Hoare triple {7019#(or (bvult (bvadd main_~x~0 (_ bv28 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv27 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {7012#(or (not (bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv27 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:17,835 INFO L273 TraceCheckUtils]: 41: Hoare triple {7019#(or (bvult (bvadd main_~x~0 (_ bv28 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv27 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {7019#(or (bvult (bvadd main_~x~0 (_ bv28 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv27 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:17,840 INFO L273 TraceCheckUtils]: 40: Hoare triple {7026#(or (bvult (bvadd main_~x~0 (_ bv29 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv28 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {7019#(or (bvult (bvadd main_~x~0 (_ bv28 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv27 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:17,840 INFO L273 TraceCheckUtils]: 39: Hoare triple {7026#(or (bvult (bvadd main_~x~0 (_ bv29 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv28 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {7026#(or (bvult (bvadd main_~x~0 (_ bv29 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv28 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:17,848 INFO L273 TraceCheckUtils]: 38: Hoare triple {7033#(or (not (bvult (bvadd main_~x~0 (_ bv29 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv30 32)) (_ bv99 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {7026#(or (bvult (bvadd main_~x~0 (_ bv29 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv28 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:17,848 INFO L273 TraceCheckUtils]: 37: Hoare triple {7033#(or (not (bvult (bvadd main_~x~0 (_ bv29 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv30 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {7033#(or (not (bvult (bvadd main_~x~0 (_ bv29 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv30 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:17,853 INFO L273 TraceCheckUtils]: 36: Hoare triple {7040#(or (not (bvult (bvadd main_~x~0 (_ bv30 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv31 32)) (_ bv99 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {7033#(or (not (bvult (bvadd main_~x~0 (_ bv29 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv30 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:17,853 INFO L273 TraceCheckUtils]: 35: Hoare triple {7040#(or (not (bvult (bvadd main_~x~0 (_ bv30 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv31 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {7040#(or (not (bvult (bvadd main_~x~0 (_ bv30 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv31 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:17,857 INFO L273 TraceCheckUtils]: 34: Hoare triple {7047#(or (not (bvult (bvadd main_~x~0 (_ bv31 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv32 32)) (_ bv99 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {7040#(or (not (bvult (bvadd main_~x~0 (_ bv30 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv31 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:17,857 INFO L273 TraceCheckUtils]: 33: Hoare triple {7047#(or (not (bvult (bvadd main_~x~0 (_ bv31 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv32 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {7047#(or (not (bvult (bvadd main_~x~0 (_ bv31 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv32 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:17,861 INFO L273 TraceCheckUtils]: 32: Hoare triple {7054#(or (not (bvult (bvadd main_~x~0 (_ bv32 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv33 32)) (_ bv99 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {7047#(or (not (bvult (bvadd main_~x~0 (_ bv31 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv32 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:17,862 INFO L273 TraceCheckUtils]: 31: Hoare triple {7054#(or (not (bvult (bvadd main_~x~0 (_ bv32 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv33 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {7054#(or (not (bvult (bvadd main_~x~0 (_ bv32 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv33 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:17,866 INFO L273 TraceCheckUtils]: 30: Hoare triple {7061#(or (not (bvult (bvadd main_~x~0 (_ bv33 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv34 32)) (_ bv99 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {7054#(or (not (bvult (bvadd main_~x~0 (_ bv32 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv33 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:17,866 INFO L273 TraceCheckUtils]: 29: Hoare triple {7061#(or (not (bvult (bvadd main_~x~0 (_ bv33 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv34 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {7061#(or (not (bvult (bvadd main_~x~0 (_ bv33 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv34 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:17,870 INFO L273 TraceCheckUtils]: 28: Hoare triple {7068#(or (bvult (bvadd main_~x~0 (_ bv35 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv34 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {7061#(or (not (bvult (bvadd main_~x~0 (_ bv33 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv34 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:17,870 INFO L273 TraceCheckUtils]: 27: Hoare triple {7068#(or (bvult (bvadd main_~x~0 (_ bv35 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv34 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {7068#(or (bvult (bvadd main_~x~0 (_ bv35 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv34 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:17,875 INFO L273 TraceCheckUtils]: 26: Hoare triple {7075#(or (not (bvult (bvadd main_~x~0 (_ bv35 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv36 32)) (_ bv99 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {7068#(or (bvult (bvadd main_~x~0 (_ bv35 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv34 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:17,876 INFO L273 TraceCheckUtils]: 25: Hoare triple {7075#(or (not (bvult (bvadd main_~x~0 (_ bv35 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv36 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {7075#(or (not (bvult (bvadd main_~x~0 (_ bv35 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv36 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:17,880 INFO L273 TraceCheckUtils]: 24: Hoare triple {7082#(or (not (bvult (bvadd main_~x~0 (_ bv36 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv37 32)) (_ bv99 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {7075#(or (not (bvult (bvadd main_~x~0 (_ bv35 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv36 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:17,880 INFO L273 TraceCheckUtils]: 23: Hoare triple {7082#(or (not (bvult (bvadd main_~x~0 (_ bv36 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv37 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {7082#(or (not (bvult (bvadd main_~x~0 (_ bv36 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv37 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:17,884 INFO L273 TraceCheckUtils]: 22: Hoare triple {7089#(or (not (bvult (bvadd main_~x~0 (_ bv37 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv38 32)) (_ bv99 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {7082#(or (not (bvult (bvadd main_~x~0 (_ bv36 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv37 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:17,885 INFO L273 TraceCheckUtils]: 21: Hoare triple {7089#(or (not (bvult (bvadd main_~x~0 (_ bv37 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv38 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {7089#(or (not (bvult (bvadd main_~x~0 (_ bv37 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv38 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:17,889 INFO L273 TraceCheckUtils]: 20: Hoare triple {7096#(or (bvult (bvadd main_~x~0 (_ bv39 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv38 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {7089#(or (not (bvult (bvadd main_~x~0 (_ bv37 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv38 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:17,889 INFO L273 TraceCheckUtils]: 19: Hoare triple {7096#(or (bvult (bvadd main_~x~0 (_ bv39 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv38 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {7096#(or (bvult (bvadd main_~x~0 (_ bv39 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv38 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:17,893 INFO L273 TraceCheckUtils]: 18: Hoare triple {7103#(or (bvult (bvadd main_~x~0 (_ bv40 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv39 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {7096#(or (bvult (bvadd main_~x~0 (_ bv39 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv38 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:17,894 INFO L273 TraceCheckUtils]: 17: Hoare triple {7103#(or (bvult (bvadd main_~x~0 (_ bv40 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv39 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {7103#(or (bvult (bvadd main_~x~0 (_ bv40 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv39 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:17,898 INFO L273 TraceCheckUtils]: 16: Hoare triple {7110#(or (not (bvult (bvadd main_~x~0 (_ bv40 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv41 32)) (_ bv99 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {7103#(or (bvult (bvadd main_~x~0 (_ bv40 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv39 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:17,898 INFO L273 TraceCheckUtils]: 15: Hoare triple {7110#(or (not (bvult (bvadd main_~x~0 (_ bv40 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv41 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {7110#(or (not (bvult (bvadd main_~x~0 (_ bv40 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv41 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:17,904 INFO L273 TraceCheckUtils]: 14: Hoare triple {7117#(or (not (bvult (bvadd main_~x~0 (_ bv41 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv42 32)) (_ bv99 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {7110#(or (not (bvult (bvadd main_~x~0 (_ bv40 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv41 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:17,904 INFO L273 TraceCheckUtils]: 13: Hoare triple {7117#(or (not (bvult (bvadd main_~x~0 (_ bv41 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv42 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {7117#(or (not (bvult (bvadd main_~x~0 (_ bv41 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv42 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:17,908 INFO L273 TraceCheckUtils]: 12: Hoare triple {7124#(or (bvult (bvadd main_~x~0 (_ bv43 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv42 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {7117#(or (not (bvult (bvadd main_~x~0 (_ bv41 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv42 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:17,909 INFO L273 TraceCheckUtils]: 11: Hoare triple {7124#(or (bvult (bvadd main_~x~0 (_ bv43 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv42 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {7124#(or (bvult (bvadd main_~x~0 (_ bv43 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv42 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:17,916 INFO L273 TraceCheckUtils]: 10: Hoare triple {7131#(or (bvult (bvadd main_~x~0 (_ bv44 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv43 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {7124#(or (bvult (bvadd main_~x~0 (_ bv43 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv42 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:17,917 INFO L273 TraceCheckUtils]: 9: Hoare triple {7131#(or (bvult (bvadd main_~x~0 (_ bv44 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv43 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {7131#(or (bvult (bvadd main_~x~0 (_ bv44 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv43 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:17,922 INFO L273 TraceCheckUtils]: 8: Hoare triple {7138#(or (not (bvult (bvadd main_~x~0 (_ bv44 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv45 32)) (_ bv99 32)))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {7131#(or (bvult (bvadd main_~x~0 (_ bv44 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv43 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:17,923 INFO L273 TraceCheckUtils]: 7: Hoare triple {7138#(or (not (bvult (bvadd main_~x~0 (_ bv44 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv45 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {7138#(or (not (bvult (bvadd main_~x~0 (_ bv44 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv45 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:17,930 INFO L273 TraceCheckUtils]: 6: Hoare triple {7145#(or (bvult (bvadd main_~x~0 (_ bv46 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv45 32)) (_ bv99 32))))} assume 0bv32 == ~bvurem32(~y~0, 2bv32);#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {7138#(or (not (bvult (bvadd main_~x~0 (_ bv44 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv45 32)) (_ bv99 32)))} is VALID [2018-11-23 11:29:17,948 INFO L273 TraceCheckUtils]: 5: Hoare triple {7145#(or (bvult (bvadd main_~x~0 (_ bv46 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv45 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {7145#(or (bvult (bvadd main_~x~0 (_ bv46 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv45 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:17,957 INFO L273 TraceCheckUtils]: 4: Hoare triple {6458#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {7145#(or (bvult (bvadd main_~x~0 (_ bv46 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv45 32)) (_ bv99 32))))} is VALID [2018-11-23 11:29:17,957 INFO L256 TraceCheckUtils]: 3: Hoare triple {6458#true} call #t~ret2 := main(); {6458#true} is VALID [2018-11-23 11:29:17,957 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6458#true} {6458#true} #37#return; {6458#true} is VALID [2018-11-23 11:29:17,957 INFO L273 TraceCheckUtils]: 1: Hoare triple {6458#true} assume true; {6458#true} is VALID [2018-11-23 11:29:17,958 INFO L256 TraceCheckUtils]: 0: Hoare triple {6458#true} call ULTIMATE.init(); {6458#true} is VALID [2018-11-23 11:29:17,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:29:17,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:29:17,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 97 [2018-11-23 11:29:18,000 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 102 [2018-11-23 11:29:18,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:29:18,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 97 states. [2018-11-23 11:29:18,509 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:18,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-11-23 11:29:18,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-11-23 11:29:18,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2448, Invalid=6864, Unknown=0, NotChecked=0, Total=9312 [2018-11-23 11:29:18,513 INFO L87 Difference]: Start difference. First operand 202 states and 204 transitions. Second operand 97 states. [2018-11-23 11:29:34,235 WARN L180 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 232 DAG size of output: 7 [2018-11-23 11:29:38,049 WARN L180 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 222 DAG size of output: 7 [2018-11-23 11:29:41,862 WARN L180 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 212 DAG size of output: 7 [2018-11-23 11:29:45,491 WARN L180 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 202 DAG size of output: 7 [2018-11-23 11:29:48,979 WARN L180 SmtUtils]: Spent 888.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 7 [2018-11-23 11:29:52,299 WARN L180 SmtUtils]: Spent 843.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 7 [2018-11-23 11:29:55,563 WARN L180 SmtUtils]: Spent 782.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 7 [2018-11-23 11:29:58,716 WARN L180 SmtUtils]: Spent 789.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 7 [2018-11-23 11:30:01,914 WARN L180 SmtUtils]: Spent 675.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 7 [2018-11-23 11:30:04,916 WARN L180 SmtUtils]: Spent 608.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 7 [2018-11-23 11:30:07,811 WARN L180 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 7 [2018-11-23 11:30:10,472 WARN L180 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 7 [2018-11-23 11:30:12,952 WARN L180 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 7 [2018-11-23 11:30:15,214 WARN L180 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 7 [2018-11-23 11:30:17,463 WARN L180 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 7 [2018-11-23 11:30:19,443 WARN L180 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 7 [2018-11-23 11:30:21,197 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 7 [2018-11-23 11:30:22,801 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 7 [2018-11-23 11:30:24,316 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 7 [2018-11-23 11:30:25,526 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 7 [2018-11-23 11:30:31,611 WARN L180 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 227 DAG size of output: 7 [2018-11-23 11:30:35,114 WARN L180 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 217 DAG size of output: 7 [2018-11-23 11:30:41,704 WARN L180 SmtUtils]: Spent 3.86 s on a formula simplification that was a NOOP. DAG size: 234 [2018-11-23 11:30:47,713 WARN L180 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 207 DAG size of output: 7 [2018-11-23 11:30:51,244 WARN L180 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 197 DAG size of output: 7 [2018-11-23 11:30:54,447 WARN L180 SmtUtils]: Spent 931.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 7 [2018-11-23 11:30:57,559 WARN L180 SmtUtils]: Spent 892.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 7 [2018-11-23 11:31:00,618 WARN L180 SmtUtils]: Spent 868.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 7 [2018-11-23 11:31:03,660 WARN L180 SmtUtils]: Spent 792.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 7 [2018-11-23 11:31:06,536 WARN L180 SmtUtils]: Spent 654.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 7