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-lit/jm2006_true-unreach-call_true-termination.c.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:39:17,806 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:39:17,808 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:39:17,820 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:39:17,821 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:39:17,822 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:39:17,823 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:39:17,825 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:39:17,827 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:39:17,827 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:39:17,828 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:39:17,828 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:39:17,829 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:39:17,831 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:39:17,832 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:39:17,833 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:39:17,836 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:39:17,841 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:39:17,843 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:39:17,847 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:39:17,848 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:39:17,853 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:39:17,855 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:39:17,855 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:39:17,855 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:39:17,856 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:39:17,857 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:39:17,858 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:39:17,859 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:39:17,860 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:39:17,860 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:39:17,861 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:39:17,861 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:39:17,861 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:39:17,862 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:39:17,863 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:39:17,863 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:39:17,878 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:39:17,878 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:39:17,879 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:39:17,879 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:39:17,880 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:39:17,880 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:39:17,880 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:39:17,881 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:39:17,881 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:39:17,881 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:39:17,881 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:39:17,881 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:39:17,881 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:39:17,882 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:39:17,882 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:39:17,882 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:39:17,882 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:39:17,882 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:39:17,883 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:39:17,883 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:39:17,883 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:39:17,883 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:39:17,883 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:39:17,884 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:39:17,884 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:39:17,884 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:39:17,884 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:39:17,884 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:39:17,885 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:39:17,885 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:39:17,885 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:39:17,885 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:39:17,885 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:39:17,934 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:39:17,948 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:39:17,952 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:39:17,954 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:39:17,954 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:39:17,955 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/jm2006_true-unreach-call_true-termination.c.i [2018-11-23 11:39:18,025 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b417141c5/e8d43b8a95d148e1a8a38f6522c4f6aa/FLAG17b4fcbd4 [2018-11-23 11:39:18,461 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:39:18,462 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/jm2006_true-unreach-call_true-termination.c.i [2018-11-23 11:39:18,467 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b417141c5/e8d43b8a95d148e1a8a38f6522c4f6aa/FLAG17b4fcbd4 [2018-11-23 11:39:18,853 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b417141c5/e8d43b8a95d148e1a8a38f6522c4f6aa [2018-11-23 11:39:18,862 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:39:18,864 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:39:18,865 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:39:18,865 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:39:18,869 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:39:18,871 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:39:18" (1/1) ... [2018-11-23 11:39:18,874 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22b1938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:39:18, skipping insertion in model container [2018-11-23 11:39:18,874 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:39:18" (1/1) ... [2018-11-23 11:39:18,885 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:39:18,907 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:39:19,183 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:39:19,190 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:39:19,211 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:39:19,225 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:39:19,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:39:19 WrapperNode [2018-11-23 11:39:19,226 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:39:19,227 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:39:19,227 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:39:19,227 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:39:19,235 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:39:19" (1/1) ... [2018-11-23 11:39:19,241 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:39:19" (1/1) ... [2018-11-23 11:39:19,247 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:39:19,247 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:39:19,248 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:39:19,248 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:39:19,255 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:39:19" (1/1) ... [2018-11-23 11:39:19,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:39:19" (1/1) ... [2018-11-23 11:39:19,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:39:19" (1/1) ... [2018-11-23 11:39:19,257 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:39:19" (1/1) ... [2018-11-23 11:39:19,265 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:39:19" (1/1) ... [2018-11-23 11:39:19,270 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:39:19" (1/1) ... [2018-11-23 11:39:19,271 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:39:19" (1/1) ... [2018-11-23 11:39:19,274 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:39:19,274 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:39:19,274 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:39:19,275 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:39:19,276 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:39:19" (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:39:19,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:39:19,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:39:19,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:39:19,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:39:19,393 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:39:19,394 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:39:19,394 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:39:19,394 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:39:19,844 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:39:19,845 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 11:39:19,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:39:19 BoogieIcfgContainer [2018-11-23 11:39:19,845 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:39:19,846 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:39:19,846 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:39:19,849 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:39:19,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:39:18" (1/3) ... [2018-11-23 11:39:19,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d193e0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:39:19, skipping insertion in model container [2018-11-23 11:39:19,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:39:19" (2/3) ... [2018-11-23 11:39:19,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d193e0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:39:19, skipping insertion in model container [2018-11-23 11:39:19,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:39:19" (3/3) ... [2018-11-23 11:39:19,853 INFO L112 eAbstractionObserver]: Analyzing ICFG jm2006_true-unreach-call_true-termination.c.i [2018-11-23 11:39:19,864 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:39:19,871 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:39:19,888 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:39:19,928 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:39:19,929 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:39:19,929 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:39:19,930 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:39:19,931 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:39:19,931 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:39:19,931 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:39:19,931 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:39:19,931 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:39:19,949 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-23 11:39:19,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 11:39:19,956 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:39:19,957 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:39:19,960 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:39:19,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:39:19,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1912775084, now seen corresponding path program 1 times [2018-11-23 11:39:19,972 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:39:19,973 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:39:19,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:39:20,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:39:20,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:39:20,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:39:20,106 INFO L256 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2018-11-23 11:39:20,109 INFO L273 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2018-11-23 11:39:20,110 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #42#return; {23#true} is VALID [2018-11-23 11:39:20,110 INFO L256 TraceCheckUtils]: 3: Hoare triple {23#true} call #t~ret5 := main(); {23#true} is VALID [2018-11-23 11:39:20,110 INFO L273 TraceCheckUtils]: 4: Hoare triple {23#true} havoc ~i~0;havoc ~j~0;~i~0 := #t~nondet1;havoc #t~nondet1;~j~0 := #t~nondet2;havoc #t~nondet2; {23#true} is VALID [2018-11-23 11:39:20,111 INFO L273 TraceCheckUtils]: 5: Hoare triple {23#true} assume !!(~bvsge32(~i~0, 0bv32) && ~bvsge32(~j~0, 0bv32));~x~0 := ~i~0;~y~0 := ~j~0; {23#true} is VALID [2018-11-23 11:39:20,120 INFO L273 TraceCheckUtils]: 6: Hoare triple {23#true} assume !true; {24#false} is VALID [2018-11-23 11:39:20,120 INFO L273 TraceCheckUtils]: 7: Hoare triple {24#false} assume ~i~0 == ~j~0; {24#false} is VALID [2018-11-23 11:39:20,121 INFO L256 TraceCheckUtils]: 8: Hoare triple {24#false} call __VERIFIER_assert((if 0bv32 == ~y~0 then 1bv32 else 0bv32)); {24#false} is VALID [2018-11-23 11:39:20,121 INFO L273 TraceCheckUtils]: 9: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2018-11-23 11:39:20,121 INFO L273 TraceCheckUtils]: 10: Hoare triple {24#false} assume 0bv32 == ~cond; {24#false} is VALID [2018-11-23 11:39:20,121 INFO L273 TraceCheckUtils]: 11: Hoare triple {24#false} assume !false; {24#false} is VALID [2018-11-23 11:39:20,124 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:39:20,125 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:39:20,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:39:20,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:39:20,135 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-23 11:39:20,139 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:39:20,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:39:20,183 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:39:20,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:39:20,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:39:20,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:39:20,199 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-23 11:39:20,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:20,354 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2018-11-23 11:39:20,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:39:20,354 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-23 11:39:20,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:39:20,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:39:20,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 39 transitions. [2018-11-23 11:39:20,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:39:20,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 39 transitions. [2018-11-23 11:39:20,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 39 transitions. [2018-11-23 11:39:20,667 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:39:20,681 INFO L225 Difference]: With dead ends: 33 [2018-11-23 11:39:20,681 INFO L226 Difference]: Without dead ends: 13 [2018-11-23 11:39:20,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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:39:20,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-23 11:39:20,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 11:39:20,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:39:20,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2018-11-23 11:39:20,729 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 11:39:20,729 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 11:39:20,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:20,733 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-23 11:39:20,733 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 11:39:20,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:20,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:20,734 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 11:39:20,734 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 11:39:20,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:20,737 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-23 11:39:20,737 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 11:39:20,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:20,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:20,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:39:20,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:39:20,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:39:20,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-23 11:39:20,742 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 12 [2018-11-23 11:39:20,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:39:20,743 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-23 11:39:20,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:39:20,743 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 11:39:20,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 11:39:20,744 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:39:20,744 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:39:20,744 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:39:20,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:39:20,745 INFO L82 PathProgramCache]: Analyzing trace with hash -2027291688, now seen corresponding path program 1 times [2018-11-23 11:39:20,745 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:39:20,746 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:39:20,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:39:20,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:39:20,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:39:20,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:39:21,142 INFO L256 TraceCheckUtils]: 0: Hoare triple {148#true} call ULTIMATE.init(); {148#true} is VALID [2018-11-23 11:39:21,142 INFO L273 TraceCheckUtils]: 1: Hoare triple {148#true} assume true; {148#true} is VALID [2018-11-23 11:39:21,143 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {148#true} {148#true} #42#return; {148#true} is VALID [2018-11-23 11:39:21,143 INFO L256 TraceCheckUtils]: 3: Hoare triple {148#true} call #t~ret5 := main(); {148#true} is VALID [2018-11-23 11:39:21,143 INFO L273 TraceCheckUtils]: 4: Hoare triple {148#true} havoc ~i~0;havoc ~j~0;~i~0 := #t~nondet1;havoc #t~nondet1;~j~0 := #t~nondet2;havoc #t~nondet2; {148#true} is VALID [2018-11-23 11:39:21,144 INFO L273 TraceCheckUtils]: 5: Hoare triple {148#true} assume !!(~bvsge32(~i~0, 0bv32) && ~bvsge32(~j~0, 0bv32));~x~0 := ~i~0;~y~0 := ~j~0; {168#(and (= main_~j~0 main_~y~0) (= main_~x~0 main_~i~0))} is VALID [2018-11-23 11:39:21,147 INFO L273 TraceCheckUtils]: 6: Hoare triple {168#(and (= main_~j~0 main_~y~0) (= main_~x~0 main_~i~0))} assume !(0bv32 != ~x~0); {172#(and (= main_~j~0 main_~y~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:39:21,147 INFO L273 TraceCheckUtils]: 7: Hoare triple {172#(and (= main_~j~0 main_~y~0) (= main_~i~0 (_ bv0 32)))} assume ~i~0 == ~j~0; {176#(= main_~y~0 (_ bv0 32))} is VALID [2018-11-23 11:39:21,149 INFO L256 TraceCheckUtils]: 8: Hoare triple {176#(= main_~y~0 (_ bv0 32))} call __VERIFIER_assert((if 0bv32 == ~y~0 then 1bv32 else 0bv32)); {180#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:21,151 INFO L273 TraceCheckUtils]: 9: Hoare triple {180#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {184#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:21,152 INFO L273 TraceCheckUtils]: 10: Hoare triple {184#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {149#false} is VALID [2018-11-23 11:39:21,152 INFO L273 TraceCheckUtils]: 11: Hoare triple {149#false} assume !false; {149#false} is VALID [2018-11-23 11:39:21,154 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:39:21,154 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (3)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 11:39:21,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:39:21,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 11:39:21,161 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-11-23 11:39:21,161 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:39:21,162 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:39:21,196 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:39:21,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:39:21,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:39:21,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:39:21,197 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 7 states. [2018-11-23 11:39:22,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:22,019 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-23 11:39:22,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:39:22,020 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-11-23 11:39:22,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:39:22,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:39:22,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2018-11-23 11:39:22,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:39:22,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2018-11-23 11:39:22,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 20 transitions. [2018-11-23 11:39:22,059 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:39:22,061 INFO L225 Difference]: With dead ends: 20 [2018-11-23 11:39:22,062 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 11:39:22,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:39:22,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 11:39:22,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 11:39:22,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:39:22,085 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-23 11:39:22,085 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 11:39:22,085 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 11:39:22,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:22,087 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 11:39:22,087 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 11:39:22,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:22,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:22,088 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 11:39:22,088 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 11:39:22,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:22,090 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 11:39:22,090 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 11:39:22,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:22,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:22,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:39:22,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:39:22,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:39:22,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-23 11:39:22,093 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-11-23 11:39:22,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:39:22,093 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-23 11:39:22,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:39:22,093 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 11:39:22,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:39:22,094 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:39:22,094 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:39:22,094 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:39:22,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:39:22,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1190399537, now seen corresponding path program 1 times [2018-11-23 11:39:22,095 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:39:22,095 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:39:22,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:39:22,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:39:22,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:39:22,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:39:22,505 INFO L256 TraceCheckUtils]: 0: Hoare triple {276#true} call ULTIMATE.init(); {276#true} is VALID [2018-11-23 11:39:22,505 INFO L273 TraceCheckUtils]: 1: Hoare triple {276#true} assume true; {276#true} is VALID [2018-11-23 11:39:22,506 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {276#true} {276#true} #42#return; {276#true} is VALID [2018-11-23 11:39:22,506 INFO L256 TraceCheckUtils]: 3: Hoare triple {276#true} call #t~ret5 := main(); {276#true} is VALID [2018-11-23 11:39:22,506 INFO L273 TraceCheckUtils]: 4: Hoare triple {276#true} havoc ~i~0;havoc ~j~0;~i~0 := #t~nondet1;havoc #t~nondet1;~j~0 := #t~nondet2;havoc #t~nondet2; {276#true} is VALID [2018-11-23 11:39:22,516 INFO L273 TraceCheckUtils]: 5: Hoare triple {276#true} assume !!(~bvsge32(~i~0, 0bv32) && ~bvsge32(~j~0, 0bv32));~x~0 := ~i~0;~y~0 := ~j~0; {296#(and (bvsge main_~j~0 (_ bv0 32)) (= main_~j~0 main_~y~0) (= main_~x~0 main_~i~0))} is VALID [2018-11-23 11:39:22,546 INFO L273 TraceCheckUtils]: 6: Hoare triple {296#(and (bvsge main_~j~0 (_ bv0 32)) (= main_~j~0 main_~y~0) (= main_~x~0 main_~i~0))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {300#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) main_~y~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) main_~x~0))} is VALID [2018-11-23 11:39:22,548 INFO L273 TraceCheckUtils]: 7: Hoare triple {300#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) main_~y~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) main_~x~0))} assume !(0bv32 != ~x~0); {304#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) main_~y~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:39:22,550 INFO L273 TraceCheckUtils]: 8: Hoare triple {304#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) main_~y~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~i~0 == ~j~0; {308#(= main_~y~0 (_ bv0 32))} is VALID [2018-11-23 11:39:22,551 INFO L256 TraceCheckUtils]: 9: Hoare triple {308#(= main_~y~0 (_ bv0 32))} call __VERIFIER_assert((if 0bv32 == ~y~0 then 1bv32 else 0bv32)); {312#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:22,552 INFO L273 TraceCheckUtils]: 10: Hoare triple {312#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {316#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:22,552 INFO L273 TraceCheckUtils]: 11: Hoare triple {316#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {277#false} is VALID [2018-11-23 11:39:22,553 INFO L273 TraceCheckUtils]: 12: Hoare triple {277#false} assume !false; {277#false} is VALID [2018-11-23 11:39:22,555 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:39:22,555 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:39:22,923 INFO L273 TraceCheckUtils]: 12: Hoare triple {277#false} assume !false; {277#false} is VALID [2018-11-23 11:39:22,924 INFO L273 TraceCheckUtils]: 11: Hoare triple {326#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {277#false} is VALID [2018-11-23 11:39:22,925 INFO L273 TraceCheckUtils]: 10: Hoare triple {330#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {326#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:39:22,927 INFO L256 TraceCheckUtils]: 9: Hoare triple {308#(= main_~y~0 (_ bv0 32))} call __VERIFIER_assert((if 0bv32 == ~y~0 then 1bv32 else 0bv32)); {330#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:39:22,928 INFO L273 TraceCheckUtils]: 8: Hoare triple {337#(or (not (= main_~j~0 main_~i~0)) (= main_~y~0 (_ bv0 32)))} assume ~i~0 == ~j~0; {308#(= main_~y~0 (_ bv0 32))} is VALID [2018-11-23 11:39:22,943 INFO L273 TraceCheckUtils]: 7: Hoare triple {341#(or (not (= main_~j~0 main_~i~0)) (not (= main_~x~0 (_ bv0 32))) (= main_~y~0 (_ bv0 32)))} assume !(0bv32 != ~x~0); {337#(or (not (= main_~j~0 main_~i~0)) (= main_~y~0 (_ bv0 32)))} is VALID [2018-11-23 11:39:22,952 INFO L273 TraceCheckUtils]: 6: Hoare triple {345#(or (not (= main_~j~0 main_~i~0)) (= (_ bv1 32) main_~y~0) (not (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {341#(or (not (= main_~j~0 main_~i~0)) (not (= main_~x~0 (_ bv0 32))) (= main_~y~0 (_ bv0 32)))} is VALID [2018-11-23 11:39:22,970 INFO L273 TraceCheckUtils]: 5: Hoare triple {276#true} assume !!(~bvsge32(~i~0, 0bv32) && ~bvsge32(~j~0, 0bv32));~x~0 := ~i~0;~y~0 := ~j~0; {345#(or (not (= main_~j~0 main_~i~0)) (= (_ bv1 32) main_~y~0) (not (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:39:22,970 INFO L273 TraceCheckUtils]: 4: Hoare triple {276#true} havoc ~i~0;havoc ~j~0;~i~0 := #t~nondet1;havoc #t~nondet1;~j~0 := #t~nondet2;havoc #t~nondet2; {276#true} is VALID [2018-11-23 11:39:22,971 INFO L256 TraceCheckUtils]: 3: Hoare triple {276#true} call #t~ret5 := main(); {276#true} is VALID [2018-11-23 11:39:22,971 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {276#true} {276#true} #42#return; {276#true} is VALID [2018-11-23 11:39:22,971 INFO L273 TraceCheckUtils]: 1: Hoare triple {276#true} assume true; {276#true} is VALID [2018-11-23 11:39:22,972 INFO L256 TraceCheckUtils]: 0: Hoare triple {276#true} call ULTIMATE.init(); {276#true} is VALID [2018-11-23 11:39:22,973 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:39:22,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:39:22,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-11-23 11:39:22,975 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-11-23 11:39:22,976 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:39:22,976 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 11:39:23,100 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:39:23,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 11:39:23,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 11:39:23,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:39:23,101 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-11-23 11:39:23,697 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2018-11-23 11:39:24,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:24,018 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-23 11:39:24,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:39:24,018 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-11-23 11:39:24,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:39:24,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:39:24,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 27 transitions. [2018-11-23 11:39:24,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:39:24,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 27 transitions. [2018-11-23 11:39:24,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 27 transitions. [2018-11-23 11:39:24,097 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:39:24,099 INFO L225 Difference]: With dead ends: 25 [2018-11-23 11:39:24,099 INFO L226 Difference]: Without dead ends: 17 [2018-11-23 11:39:24,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:39:24,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-23 11:39:24,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-23 11:39:24,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:39:24,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2018-11-23 11:39:24,163 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 11:39:24,163 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 11:39:24,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:24,165 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-11-23 11:39:24,165 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 11:39:24,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:24,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:24,166 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 11:39:24,166 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 11:39:24,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:24,168 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-11-23 11:39:24,168 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 11:39:24,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:24,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:24,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:39:24,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:39:24,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:39:24,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-23 11:39:24,171 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 13 [2018-11-23 11:39:24,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:39:24,171 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-23 11:39:24,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 11:39:24,172 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 11:39:24,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:39:24,172 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:39:24,173 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:39:24,173 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:39:24,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:39:24,173 INFO L82 PathProgramCache]: Analyzing trace with hash -353156712, now seen corresponding path program 2 times [2018-11-23 11:39:24,174 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:39:24,174 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:39:24,195 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:39:24,228 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:39:24,229 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:39:24,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:39:24,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:39:24,697 INFO L256 TraceCheckUtils]: 0: Hoare triple {479#true} call ULTIMATE.init(); {479#true} is VALID [2018-11-23 11:39:24,698 INFO L273 TraceCheckUtils]: 1: Hoare triple {479#true} assume true; {479#true} is VALID [2018-11-23 11:39:24,698 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {479#true} {479#true} #42#return; {479#true} is VALID [2018-11-23 11:39:24,699 INFO L256 TraceCheckUtils]: 3: Hoare triple {479#true} call #t~ret5 := main(); {479#true} is VALID [2018-11-23 11:39:24,699 INFO L273 TraceCheckUtils]: 4: Hoare triple {479#true} havoc ~i~0;havoc ~j~0;~i~0 := #t~nondet1;havoc #t~nondet1;~j~0 := #t~nondet2;havoc #t~nondet2; {479#true} is VALID [2018-11-23 11:39:24,702 INFO L273 TraceCheckUtils]: 5: Hoare triple {479#true} assume !!(~bvsge32(~i~0, 0bv32) && ~bvsge32(~j~0, 0bv32));~x~0 := ~i~0;~y~0 := ~j~0; {499#(and (bvsge main_~j~0 (_ bv0 32)) (= main_~j~0 main_~y~0) (= main_~x~0 main_~i~0))} is VALID [2018-11-23 11:39:24,726 INFO L273 TraceCheckUtils]: 6: Hoare triple {499#(and (bvsge main_~j~0 (_ bv0 32)) (= main_~j~0 main_~y~0) (= main_~x~0 main_~i~0))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {503#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) main_~y~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) main_~x~0))} is VALID [2018-11-23 11:39:24,767 INFO L273 TraceCheckUtils]: 7: Hoare triple {503#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) main_~y~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) main_~x~0))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {507#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967294 32)) main_~y~0) (= (bvadd main_~i~0 (_ bv4294967294 32)) main_~x~0))} is VALID [2018-11-23 11:39:24,812 INFO L273 TraceCheckUtils]: 8: Hoare triple {507#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967294 32)) main_~y~0) (= (bvadd main_~i~0 (_ bv4294967294 32)) main_~x~0))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {511#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967293 32)) main_~y~0) (= (bvadd main_~x~0 (_ bv3 32)) main_~i~0))} is VALID [2018-11-23 11:39:24,863 INFO L273 TraceCheckUtils]: 9: Hoare triple {511#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967293 32)) main_~y~0) (= (bvadd main_~x~0 (_ bv3 32)) main_~i~0))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {515#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967292 32)) main_~y~0) (= (bvadd main_~i~0 (_ bv4294967292 32)) main_~x~0))} is VALID [2018-11-23 11:39:24,865 INFO L273 TraceCheckUtils]: 10: Hoare triple {515#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967292 32)) main_~y~0) (= (bvadd main_~i~0 (_ bv4294967292 32)) main_~x~0))} assume !(0bv32 != ~x~0); {519#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967292 32)) main_~y~0) (= (_ bv4 32) main_~i~0))} is VALID [2018-11-23 11:39:24,866 INFO L273 TraceCheckUtils]: 11: Hoare triple {519#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967292 32)) main_~y~0) (= (_ bv4 32) main_~i~0))} assume ~i~0 == ~j~0; {523#(= main_~y~0 (_ bv0 32))} is VALID [2018-11-23 11:39:24,870 INFO L256 TraceCheckUtils]: 12: Hoare triple {523#(= main_~y~0 (_ bv0 32))} call __VERIFIER_assert((if 0bv32 == ~y~0 then 1bv32 else 0bv32)); {527#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:24,871 INFO L273 TraceCheckUtils]: 13: Hoare triple {527#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {531#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:24,892 INFO L273 TraceCheckUtils]: 14: Hoare triple {531#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {480#false} is VALID [2018-11-23 11:39:24,892 INFO L273 TraceCheckUtils]: 15: Hoare triple {480#false} assume !false; {480#false} is VALID [2018-11-23 11:39:24,894 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:39:24,894 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:39:25,530 INFO L273 TraceCheckUtils]: 15: Hoare triple {480#false} assume !false; {480#false} is VALID [2018-11-23 11:39:25,531 INFO L273 TraceCheckUtils]: 14: Hoare triple {541#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {480#false} is VALID [2018-11-23 11:39:25,532 INFO L273 TraceCheckUtils]: 13: Hoare triple {545#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {541#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:39:25,532 INFO L256 TraceCheckUtils]: 12: Hoare triple {523#(= main_~y~0 (_ bv0 32))} call __VERIFIER_assert((if 0bv32 == ~y~0 then 1bv32 else 0bv32)); {545#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:39:25,533 INFO L273 TraceCheckUtils]: 11: Hoare triple {552#(or (not (= main_~j~0 main_~i~0)) (= main_~y~0 (_ bv0 32)))} assume ~i~0 == ~j~0; {523#(= main_~y~0 (_ bv0 32))} is VALID [2018-11-23 11:39:25,534 INFO L273 TraceCheckUtils]: 10: Hoare triple {556#(or (not (= main_~j~0 main_~i~0)) (not (= main_~x~0 (_ bv0 32))) (= main_~y~0 (_ bv0 32)))} assume !(0bv32 != ~x~0); {552#(or (not (= main_~j~0 main_~i~0)) (= main_~y~0 (_ bv0 32)))} is VALID [2018-11-23 11:39:25,536 INFO L273 TraceCheckUtils]: 9: Hoare triple {560#(or (not (= main_~j~0 main_~i~0)) (= (_ bv1 32) main_~y~0) (not (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {556#(or (not (= main_~j~0 main_~i~0)) (not (= main_~x~0 (_ bv0 32))) (= main_~y~0 (_ bv0 32)))} is VALID [2018-11-23 11:39:25,539 INFO L273 TraceCheckUtils]: 8: Hoare triple {564#(or (not (= main_~j~0 main_~i~0)) (not (= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))) (= (_ bv2 32) main_~y~0))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {560#(or (not (= main_~j~0 main_~i~0)) (= (_ bv1 32) main_~y~0) (not (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:39:25,541 INFO L273 TraceCheckUtils]: 7: Hoare triple {568#(or (= (_ bv3 32) main_~y~0) (not (= main_~j~0 main_~i~0)) (not (= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {564#(or (not (= main_~j~0 main_~i~0)) (not (= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))) (= (_ bv2 32) main_~y~0))} is VALID [2018-11-23 11:39:25,542 INFO L273 TraceCheckUtils]: 6: Hoare triple {572#(or (= (_ bv4 32) main_~y~0) (not (= main_~j~0 main_~i~0)) (not (= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {568#(or (= (_ bv3 32) main_~y~0) (not (= main_~j~0 main_~i~0)) (not (= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))))} is VALID [2018-11-23 11:39:25,543 INFO L273 TraceCheckUtils]: 5: Hoare triple {479#true} assume !!(~bvsge32(~i~0, 0bv32) && ~bvsge32(~j~0, 0bv32));~x~0 := ~i~0;~y~0 := ~j~0; {572#(or (= (_ bv4 32) main_~y~0) (not (= main_~j~0 main_~i~0)) (not (= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))))} is VALID [2018-11-23 11:39:25,543 INFO L273 TraceCheckUtils]: 4: Hoare triple {479#true} havoc ~i~0;havoc ~j~0;~i~0 := #t~nondet1;havoc #t~nondet1;~j~0 := #t~nondet2;havoc #t~nondet2; {479#true} is VALID [2018-11-23 11:39:25,544 INFO L256 TraceCheckUtils]: 3: Hoare triple {479#true} call #t~ret5 := main(); {479#true} is VALID [2018-11-23 11:39:25,544 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {479#true} {479#true} #42#return; {479#true} is VALID [2018-11-23 11:39:25,544 INFO L273 TraceCheckUtils]: 1: Hoare triple {479#true} assume true; {479#true} is VALID [2018-11-23 11:39:25,545 INFO L256 TraceCheckUtils]: 0: Hoare triple {479#true} call ULTIMATE.init(); {479#true} is VALID [2018-11-23 11:39:25,547 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:39:25,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:39:25,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-11-23 11:39:25,549 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 16 [2018-11-23 11:39:25,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:39:25,550 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 11:39:25,754 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:39:25,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 11:39:25,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 11:39:25,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:39:25,755 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 19 states. [2018-11-23 11:39:28,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:28,105 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-23 11:39:28,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 11:39:28,105 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 16 [2018-11-23 11:39:28,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:39:28,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:39:28,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 36 transitions. [2018-11-23 11:39:28,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:39:28,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 36 transitions. [2018-11-23 11:39:28,111 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 36 transitions. [2018-11-23 11:39:28,390 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:39:28,391 INFO L225 Difference]: With dead ends: 31 [2018-11-23 11:39:28,391 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 11:39:28,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=196, Invalid=616, Unknown=0, NotChecked=0, Total=812 [2018-11-23 11:39:28,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 11:39:28,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-23 11:39:28,476 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:39:28,476 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2018-11-23 11:39:28,477 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 11:39:28,477 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 11:39:28,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:28,480 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-23 11:39:28,480 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-23 11:39:28,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:28,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:28,481 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 11:39:28,481 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 11:39:28,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:28,483 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-23 11:39:28,483 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-23 11:39:28,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:28,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:28,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:39:28,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:39:28,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:39:28,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-11-23 11:39:28,486 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 16 [2018-11-23 11:39:28,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:39:28,487 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-11-23 11:39:28,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 11:39:28,487 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-23 11:39:28,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:39:28,488 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:39:28,488 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:39:28,489 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:39:28,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:39:28,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1113225672, now seen corresponding path program 3 times [2018-11-23 11:39:28,490 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:39:28,490 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:39:28,507 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:39:28,626 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 11:39:28,626 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:39:28,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:39:28,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:39:29,478 INFO L256 TraceCheckUtils]: 0: Hoare triple {750#true} call ULTIMATE.init(); {750#true} is VALID [2018-11-23 11:39:29,479 INFO L273 TraceCheckUtils]: 1: Hoare triple {750#true} assume true; {750#true} is VALID [2018-11-23 11:39:29,479 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {750#true} {750#true} #42#return; {750#true} is VALID [2018-11-23 11:39:29,479 INFO L256 TraceCheckUtils]: 3: Hoare triple {750#true} call #t~ret5 := main(); {750#true} is VALID [2018-11-23 11:39:29,480 INFO L273 TraceCheckUtils]: 4: Hoare triple {750#true} havoc ~i~0;havoc ~j~0;~i~0 := #t~nondet1;havoc #t~nondet1;~j~0 := #t~nondet2;havoc #t~nondet2; {750#true} is VALID [2018-11-23 11:39:29,481 INFO L273 TraceCheckUtils]: 5: Hoare triple {750#true} assume !!(~bvsge32(~i~0, 0bv32) && ~bvsge32(~j~0, 0bv32));~x~0 := ~i~0;~y~0 := ~j~0; {770#(and (bvsge main_~j~0 (_ bv0 32)) (= main_~j~0 main_~y~0) (= main_~x~0 main_~i~0))} is VALID [2018-11-23 11:39:29,512 INFO L273 TraceCheckUtils]: 6: Hoare triple {770#(and (bvsge main_~j~0 (_ bv0 32)) (= main_~j~0 main_~y~0) (= main_~x~0 main_~i~0))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {774#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) main_~y~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) main_~x~0))} is VALID [2018-11-23 11:39:29,550 INFO L273 TraceCheckUtils]: 7: Hoare triple {774#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) main_~y~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) main_~x~0))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {778#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967294 32)) main_~y~0) (= (bvadd main_~i~0 (_ bv4294967294 32)) main_~x~0))} is VALID [2018-11-23 11:39:29,600 INFO L273 TraceCheckUtils]: 8: Hoare triple {778#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967294 32)) main_~y~0) (= (bvadd main_~i~0 (_ bv4294967294 32)) main_~x~0))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {782#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967293 32)) main_~y~0) (= (bvadd main_~x~0 (_ bv3 32)) main_~i~0))} is VALID [2018-11-23 11:39:29,655 INFO L273 TraceCheckUtils]: 9: Hoare triple {782#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967293 32)) main_~y~0) (= (bvadd main_~x~0 (_ bv3 32)) main_~i~0))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {786#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967292 32)) main_~y~0) (= (bvadd main_~i~0 (_ bv4294967292 32)) main_~x~0))} is VALID [2018-11-23 11:39:29,709 INFO L273 TraceCheckUtils]: 10: Hoare triple {786#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967292 32)) main_~y~0) (= (bvadd main_~i~0 (_ bv4294967292 32)) main_~x~0))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {790#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~x~0 (_ bv5 32)) main_~i~0) (= (bvadd main_~j~0 (_ bv4294967291 32)) main_~y~0))} is VALID [2018-11-23 11:39:29,765 INFO L273 TraceCheckUtils]: 11: Hoare triple {790#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~x~0 (_ bv5 32)) main_~i~0) (= (bvadd main_~j~0 (_ bv4294967291 32)) main_~y~0))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {794#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967290 32)) main_~y~0) (= (bvadd main_~i~0 (_ bv4294967290 32)) main_~x~0))} is VALID [2018-11-23 11:39:29,813 INFO L273 TraceCheckUtils]: 12: Hoare triple {794#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967290 32)) main_~y~0) (= (bvadd main_~i~0 (_ bv4294967290 32)) main_~x~0))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {798#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967289 32)) main_~y~0) (= (bvadd main_~x~0 (_ bv7 32)) main_~i~0))} is VALID [2018-11-23 11:39:29,860 INFO L273 TraceCheckUtils]: 13: Hoare triple {798#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967289 32)) main_~y~0) (= (bvadd main_~x~0 (_ bv7 32)) main_~i~0))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {802#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967288 32)) main_~x~0) (= (bvadd main_~j~0 (_ bv4294967288 32)) main_~y~0))} is VALID [2018-11-23 11:39:29,897 INFO L273 TraceCheckUtils]: 14: Hoare triple {802#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967288 32)) main_~x~0) (= (bvadd main_~j~0 (_ bv4294967288 32)) main_~y~0))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {806#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967287 32)) main_~y~0) (= (bvadd main_~x~0 (_ bv9 32)) main_~i~0))} is VALID [2018-11-23 11:39:29,977 INFO L273 TraceCheckUtils]: 15: Hoare triple {806#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967287 32)) main_~y~0) (= (bvadd main_~x~0 (_ bv9 32)) main_~i~0))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {810#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~y~0 (_ bv10 32)) main_~j~0) (= (bvadd main_~i~0 (_ bv4294967286 32)) main_~x~0))} is VALID [2018-11-23 11:39:29,978 INFO L273 TraceCheckUtils]: 16: Hoare triple {810#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~y~0 (_ bv10 32)) main_~j~0) (= (bvadd main_~i~0 (_ bv4294967286 32)) main_~x~0))} assume !(0bv32 != ~x~0); {814#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~y~0 (_ bv10 32)) main_~j~0) (= (_ bv10 32) main_~i~0))} is VALID [2018-11-23 11:39:29,979 INFO L273 TraceCheckUtils]: 17: Hoare triple {814#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~y~0 (_ bv10 32)) main_~j~0) (= (_ bv10 32) main_~i~0))} assume ~i~0 == ~j~0; {818#(= main_~y~0 (_ bv0 32))} is VALID [2018-11-23 11:39:29,980 INFO L256 TraceCheckUtils]: 18: Hoare triple {818#(= main_~y~0 (_ bv0 32))} call __VERIFIER_assert((if 0bv32 == ~y~0 then 1bv32 else 0bv32)); {822#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:29,980 INFO L273 TraceCheckUtils]: 19: Hoare triple {822#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {826#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:29,981 INFO L273 TraceCheckUtils]: 20: Hoare triple {826#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {751#false} is VALID [2018-11-23 11:39:29,981 INFO L273 TraceCheckUtils]: 21: Hoare triple {751#false} assume !false; {751#false} is VALID [2018-11-23 11:39:29,984 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:39:29,985 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:39:31,483 INFO L273 TraceCheckUtils]: 21: Hoare triple {751#false} assume !false; {751#false} is VALID [2018-11-23 11:39:31,489 INFO L273 TraceCheckUtils]: 20: Hoare triple {836#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {751#false} is VALID [2018-11-23 11:39:31,490 INFO L273 TraceCheckUtils]: 19: Hoare triple {840#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {836#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:39:31,491 INFO L256 TraceCheckUtils]: 18: Hoare triple {818#(= main_~y~0 (_ bv0 32))} call __VERIFIER_assert((if 0bv32 == ~y~0 then 1bv32 else 0bv32)); {840#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:39:31,492 INFO L273 TraceCheckUtils]: 17: Hoare triple {847#(or (not (= main_~j~0 main_~i~0)) (= main_~y~0 (_ bv0 32)))} assume ~i~0 == ~j~0; {818#(= main_~y~0 (_ bv0 32))} is VALID [2018-11-23 11:39:31,492 INFO L273 TraceCheckUtils]: 16: Hoare triple {851#(or (not (= main_~j~0 main_~i~0)) (not (= main_~x~0 (_ bv0 32))) (= main_~y~0 (_ bv0 32)))} assume !(0bv32 != ~x~0); {847#(or (not (= main_~j~0 main_~i~0)) (= main_~y~0 (_ bv0 32)))} is VALID [2018-11-23 11:39:31,495 INFO L273 TraceCheckUtils]: 15: Hoare triple {855#(or (not (= main_~j~0 main_~i~0)) (= (_ bv1 32) main_~y~0) (not (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {851#(or (not (= main_~j~0 main_~i~0)) (not (= main_~x~0 (_ bv0 32))) (= main_~y~0 (_ bv0 32)))} is VALID [2018-11-23 11:39:31,496 INFO L273 TraceCheckUtils]: 14: Hoare triple {859#(or (not (= main_~j~0 main_~i~0)) (not (= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))) (= (_ bv2 32) main_~y~0))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {855#(or (not (= main_~j~0 main_~i~0)) (= (_ bv1 32) main_~y~0) (not (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:39:31,498 INFO L273 TraceCheckUtils]: 13: Hoare triple {863#(or (= (_ bv3 32) main_~y~0) (not (= main_~j~0 main_~i~0)) (not (= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {859#(or (not (= main_~j~0 main_~i~0)) (not (= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))) (= (_ bv2 32) main_~y~0))} is VALID [2018-11-23 11:39:31,499 INFO L273 TraceCheckUtils]: 12: Hoare triple {867#(or (= (_ bv4 32) main_~y~0) (not (= main_~j~0 main_~i~0)) (not (= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {863#(or (= (_ bv3 32) main_~y~0) (not (= main_~j~0 main_~i~0)) (not (= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))))} is VALID [2018-11-23 11:39:31,501 INFO L273 TraceCheckUtils]: 11: Hoare triple {871#(or (not (= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= main_~j~0 main_~i~0)) (= (_ bv5 32) main_~y~0))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {867#(or (= (_ bv4 32) main_~y~0) (not (= main_~j~0 main_~i~0)) (not (= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))))} is VALID [2018-11-23 11:39:31,504 INFO L273 TraceCheckUtils]: 10: Hoare triple {875#(or (not (= main_~j~0 main_~i~0)) (not (= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))) (= (_ bv6 32) main_~y~0))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {871#(or (not (= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= main_~j~0 main_~i~0)) (= (_ bv5 32) main_~y~0))} is VALID [2018-11-23 11:39:31,506 INFO L273 TraceCheckUtils]: 9: Hoare triple {879#(or (not (= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32))) (= (_ bv7 32) main_~y~0) (not (= main_~j~0 main_~i~0)))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {875#(or (not (= main_~j~0 main_~i~0)) (not (= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))) (= (_ bv6 32) main_~y~0))} is VALID [2018-11-23 11:39:31,509 INFO L273 TraceCheckUtils]: 8: Hoare triple {883#(or (= (_ bv8 32) main_~y~0) (not (= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))) (not (= main_~j~0 main_~i~0)))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {879#(or (not (= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32))) (= (_ bv7 32) main_~y~0) (not (= main_~j~0 main_~i~0)))} is VALID [2018-11-23 11:39:31,511 INFO L273 TraceCheckUtils]: 7: Hoare triple {887#(or (not (= main_~j~0 main_~i~0)) (= (_ bv9 32) main_~y~0) (not (= (bvadd main_~x~0 (_ bv4294967287 32)) (_ bv0 32))))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {883#(or (= (_ bv8 32) main_~y~0) (not (= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))) (not (= main_~j~0 main_~i~0)))} is VALID [2018-11-23 11:39:31,514 INFO L273 TraceCheckUtils]: 6: Hoare triple {891#(or (= (_ bv10 32) main_~y~0) (not (= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))) (not (= main_~j~0 main_~i~0)))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {887#(or (not (= main_~j~0 main_~i~0)) (= (_ bv9 32) main_~y~0) (not (= (bvadd main_~x~0 (_ bv4294967287 32)) (_ bv0 32))))} is VALID [2018-11-23 11:39:31,515 INFO L273 TraceCheckUtils]: 5: Hoare triple {750#true} assume !!(~bvsge32(~i~0, 0bv32) && ~bvsge32(~j~0, 0bv32));~x~0 := ~i~0;~y~0 := ~j~0; {891#(or (= (_ bv10 32) main_~y~0) (not (= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))) (not (= main_~j~0 main_~i~0)))} is VALID [2018-11-23 11:39:31,515 INFO L273 TraceCheckUtils]: 4: Hoare triple {750#true} havoc ~i~0;havoc ~j~0;~i~0 := #t~nondet1;havoc #t~nondet1;~j~0 := #t~nondet2;havoc #t~nondet2; {750#true} is VALID [2018-11-23 11:39:31,516 INFO L256 TraceCheckUtils]: 3: Hoare triple {750#true} call #t~ret5 := main(); {750#true} is VALID [2018-11-23 11:39:31,516 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {750#true} {750#true} #42#return; {750#true} is VALID [2018-11-23 11:39:31,517 INFO L273 TraceCheckUtils]: 1: Hoare triple {750#true} assume true; {750#true} is VALID [2018-11-23 11:39:31,517 INFO L256 TraceCheckUtils]: 0: Hoare triple {750#true} call ULTIMATE.init(); {750#true} is VALID [2018-11-23 11:39:31,520 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:39:31,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:39:31,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2018-11-23 11:39:31,522 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 22 [2018-11-23 11:39:31,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:39:31,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 11:39:32,027 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:39:32,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 11:39:32,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 11:39:32,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=743, Unknown=0, NotChecked=0, Total=930 [2018-11-23 11:39:32,028 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 31 states. [2018-11-23 11:39:47,651 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2018-11-23 11:40:00,794 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2018-11-23 11:40:01,165 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2018-11-23 11:40:11,395 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2018-11-23 11:40:11,734 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2018-11-23 11:40:38,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:40:38,982 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2018-11-23 11:40:38,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 11:40:38,983 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 22 [2018-11-23 11:40:38,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:40:38,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 11:40:38,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 54 transitions. [2018-11-23 11:40:38,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 11:40:38,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 54 transitions. [2018-11-23 11:40:38,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 54 transitions. [2018-11-23 11:40:41,691 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 53 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 11:40:41,693 INFO L225 Difference]: With dead ends: 43 [2018-11-23 11:40:41,693 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 11:40:41,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 65.8s TimeCoverageRelationStatistics Valid=561, Invalid=1594, Unknown=7, NotChecked=0, Total=2162 [2018-11-23 11:40:41,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 11:40:42,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-23 11:40:42,069 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:40:42,069 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2018-11-23 11:40:42,069 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-23 11:40:42,069 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-23 11:40:42,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:40:42,072 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-23 11:40:42,072 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-11-23 11:40:42,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:40:42,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:40:42,074 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-23 11:40:42,074 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-23 11:40:42,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:40:42,076 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-23 11:40:42,076 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-11-23 11:40:42,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:40:42,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:40:42,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:40:42,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:40:42,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 11:40:42,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-11-23 11:40:42,079 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 22 [2018-11-23 11:40:42,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:40:42,079 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-11-23 11:40:42,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 11:40:42,080 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-11-23 11:40:42,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 11:40:42,081 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:40:42,081 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:40:42,081 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:40:42,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:40:42,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1312151688, now seen corresponding path program 4 times [2018-11-23 11:40:42,082 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:40:42,082 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:40:42,101 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:40:42,196 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:40:42,196 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:40:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:40:42,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:40:44,906 INFO L256 TraceCheckUtils]: 0: Hoare triple {1153#true} call ULTIMATE.init(); {1153#true} is VALID [2018-11-23 11:40:44,907 INFO L273 TraceCheckUtils]: 1: Hoare triple {1153#true} assume true; {1153#true} is VALID [2018-11-23 11:40:44,908 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1153#true} {1153#true} #42#return; {1153#true} is VALID [2018-11-23 11:40:44,908 INFO L256 TraceCheckUtils]: 3: Hoare triple {1153#true} call #t~ret5 := main(); {1153#true} is VALID [2018-11-23 11:40:44,909 INFO L273 TraceCheckUtils]: 4: Hoare triple {1153#true} havoc ~i~0;havoc ~j~0;~i~0 := #t~nondet1;havoc #t~nondet1;~j~0 := #t~nondet2;havoc #t~nondet2; {1153#true} is VALID [2018-11-23 11:40:44,912 INFO L273 TraceCheckUtils]: 5: Hoare triple {1153#true} assume !!(~bvsge32(~i~0, 0bv32) && ~bvsge32(~j~0, 0bv32));~x~0 := ~i~0;~y~0 := ~j~0; {1173#(and (bvsge main_~j~0 (_ bv0 32)) (= main_~j~0 main_~y~0) (= main_~x~0 main_~i~0))} is VALID [2018-11-23 11:40:44,941 INFO L273 TraceCheckUtils]: 6: Hoare triple {1173#(and (bvsge main_~j~0 (_ bv0 32)) (= main_~j~0 main_~y~0) (= main_~x~0 main_~i~0))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1177#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) main_~y~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) main_~x~0))} is VALID [2018-11-23 11:40:44,984 INFO L273 TraceCheckUtils]: 7: Hoare triple {1177#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) main_~y~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) main_~x~0))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1181#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967294 32)) main_~y~0) (= (bvadd main_~i~0 (_ bv4294967294 32)) main_~x~0))} is VALID [2018-11-23 11:40:45,028 INFO L273 TraceCheckUtils]: 8: Hoare triple {1181#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967294 32)) main_~y~0) (= (bvadd main_~i~0 (_ bv4294967294 32)) main_~x~0))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1185#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967293 32)) main_~y~0) (= (bvadd main_~x~0 (_ bv3 32)) main_~i~0))} is VALID [2018-11-23 11:40:45,081 INFO L273 TraceCheckUtils]: 9: Hoare triple {1185#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967293 32)) main_~y~0) (= (bvadd main_~x~0 (_ bv3 32)) main_~i~0))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1189#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967292 32)) main_~y~0) (= (bvadd main_~i~0 (_ bv4294967292 32)) main_~x~0))} is VALID [2018-11-23 11:40:45,128 INFO L273 TraceCheckUtils]: 10: Hoare triple {1189#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967292 32)) main_~y~0) (= (bvadd main_~i~0 (_ bv4294967292 32)) main_~x~0))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1193#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~x~0 (_ bv5 32)) main_~i~0) (= (bvadd main_~j~0 (_ bv4294967291 32)) main_~y~0))} is VALID [2018-11-23 11:40:45,183 INFO L273 TraceCheckUtils]: 11: Hoare triple {1193#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~x~0 (_ bv5 32)) main_~i~0) (= (bvadd main_~j~0 (_ bv4294967291 32)) main_~y~0))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1197#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967290 32)) main_~y~0) (= (bvadd main_~i~0 (_ bv4294967290 32)) main_~x~0))} is VALID [2018-11-23 11:40:45,240 INFO L273 TraceCheckUtils]: 12: Hoare triple {1197#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967290 32)) main_~y~0) (= (bvadd main_~i~0 (_ bv4294967290 32)) main_~x~0))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1201#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967289 32)) main_~y~0) (= (bvadd main_~x~0 (_ bv7 32)) main_~i~0))} is VALID [2018-11-23 11:40:45,277 INFO L273 TraceCheckUtils]: 13: Hoare triple {1201#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967289 32)) main_~y~0) (= (bvadd main_~x~0 (_ bv7 32)) main_~i~0))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1205#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967288 32)) main_~x~0) (= (bvadd main_~j~0 (_ bv4294967288 32)) main_~y~0))} is VALID [2018-11-23 11:40:45,328 INFO L273 TraceCheckUtils]: 14: Hoare triple {1205#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967288 32)) main_~x~0) (= (bvadd main_~j~0 (_ bv4294967288 32)) main_~y~0))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1209#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967287 32)) main_~y~0) (= (bvadd main_~x~0 (_ bv9 32)) main_~i~0))} is VALID [2018-11-23 11:40:45,393 INFO L273 TraceCheckUtils]: 15: Hoare triple {1209#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967287 32)) main_~y~0) (= (bvadd main_~x~0 (_ bv9 32)) main_~i~0))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1213#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~y~0 (_ bv10 32)) main_~j~0) (= (bvadd main_~i~0 (_ bv4294967286 32)) main_~x~0))} is VALID [2018-11-23 11:40:45,460 INFO L273 TraceCheckUtils]: 16: Hoare triple {1213#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~y~0 (_ bv10 32)) main_~j~0) (= (bvadd main_~i~0 (_ bv4294967286 32)) main_~x~0))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1217#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~x~0 (_ bv11 32)) main_~i~0) (= (bvadd main_~y~0 (_ bv11 32)) main_~j~0))} is VALID [2018-11-23 11:40:45,523 INFO L273 TraceCheckUtils]: 17: Hoare triple {1217#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~x~0 (_ bv11 32)) main_~i~0) (= (bvadd main_~y~0 (_ bv11 32)) main_~j~0))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1221#(and (= (bvadd main_~i~0 (_ bv4294967284 32)) main_~x~0) (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~y~0 (_ bv12 32)) main_~j~0))} is VALID [2018-11-23 11:40:45,602 INFO L273 TraceCheckUtils]: 18: Hoare triple {1221#(and (= (bvadd main_~i~0 (_ bv4294967284 32)) main_~x~0) (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~y~0 (_ bv12 32)) main_~j~0))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1225#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~x~0 (_ bv13 32)) main_~i~0) (= (bvadd main_~y~0 (_ bv13 32)) main_~j~0))} is VALID [2018-11-23 11:40:45,655 INFO L273 TraceCheckUtils]: 19: Hoare triple {1225#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~x~0 (_ bv13 32)) main_~i~0) (= (bvadd main_~y~0 (_ bv13 32)) main_~j~0))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1229#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967282 32)) main_~x~0) (= (bvadd main_~j~0 (_ bv4294967282 32)) main_~y~0))} is VALID [2018-11-23 11:40:45,710 INFO L273 TraceCheckUtils]: 20: Hoare triple {1229#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967282 32)) main_~x~0) (= (bvadd main_~j~0 (_ bv4294967282 32)) main_~y~0))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1233#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967281 32)) main_~y~0) (= (bvadd main_~x~0 (_ bv15 32)) main_~i~0))} is VALID [2018-11-23 11:40:45,761 INFO L273 TraceCheckUtils]: 21: Hoare triple {1233#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967281 32)) main_~y~0) (= (bvadd main_~x~0 (_ bv15 32)) main_~i~0))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1237#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~y~0 (_ bv16 32)) main_~j~0) (= (bvadd main_~i~0 (_ bv4294967280 32)) main_~x~0))} is VALID [2018-11-23 11:40:45,815 INFO L273 TraceCheckUtils]: 22: Hoare triple {1237#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~y~0 (_ bv16 32)) main_~j~0) (= (bvadd main_~i~0 (_ bv4294967280 32)) main_~x~0))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1241#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~x~0 (_ bv17 32)) main_~i~0) (= (bvadd main_~j~0 (_ bv4294967279 32)) main_~y~0))} is VALID [2018-11-23 11:40:45,871 INFO L273 TraceCheckUtils]: 23: Hoare triple {1241#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~x~0 (_ bv17 32)) main_~i~0) (= (bvadd main_~j~0 (_ bv4294967279 32)) main_~y~0))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1245#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967278 32)) main_~y~0) (= (bvadd main_~i~0 (_ bv4294967278 32)) main_~x~0))} is VALID [2018-11-23 11:40:45,921 INFO L273 TraceCheckUtils]: 24: Hoare triple {1245#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967278 32)) main_~y~0) (= (bvadd main_~i~0 (_ bv4294967278 32)) main_~x~0))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1249#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967277 32)) main_~y~0) (= (bvadd main_~x~0 (_ bv19 32)) main_~i~0))} is VALID [2018-11-23 11:40:45,974 INFO L273 TraceCheckUtils]: 25: Hoare triple {1249#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967277 32)) main_~y~0) (= (bvadd main_~x~0 (_ bv19 32)) main_~i~0))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1253#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967276 32)) main_~y~0) (= (bvadd main_~i~0 (_ bv4294967276 32)) main_~x~0))} is VALID [2018-11-23 11:40:46,030 INFO L273 TraceCheckUtils]: 26: Hoare triple {1253#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967276 32)) main_~y~0) (= (bvadd main_~i~0 (_ bv4294967276 32)) main_~x~0))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1257#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~x~0 (_ bv21 32)) main_~i~0) (= (bvadd main_~j~0 (_ bv4294967275 32)) main_~y~0))} is VALID [2018-11-23 11:40:46,089 INFO L273 TraceCheckUtils]: 27: Hoare triple {1257#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~x~0 (_ bv21 32)) main_~i~0) (= (bvadd main_~j~0 (_ bv4294967275 32)) main_~y~0))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1261#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967274 32)) main_~y~0) (= (bvadd main_~i~0 (_ bv4294967274 32)) main_~x~0))} is VALID [2018-11-23 11:40:46,090 INFO L273 TraceCheckUtils]: 28: Hoare triple {1261#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967274 32)) main_~y~0) (= (bvadd main_~i~0 (_ bv4294967274 32)) main_~x~0))} assume !(0bv32 != ~x~0); {1265#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967274 32)) main_~y~0) (= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32)))} is VALID [2018-11-23 11:40:46,091 INFO L273 TraceCheckUtils]: 29: Hoare triple {1265#(and (bvsge main_~j~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967274 32)) main_~y~0) (= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32)))} assume ~i~0 == ~j~0; {1269#(= main_~y~0 (_ bv0 32))} is VALID [2018-11-23 11:40:46,092 INFO L256 TraceCheckUtils]: 30: Hoare triple {1269#(= main_~y~0 (_ bv0 32))} call __VERIFIER_assert((if 0bv32 == ~y~0 then 1bv32 else 0bv32)); {1273#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:46,093 INFO L273 TraceCheckUtils]: 31: Hoare triple {1273#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {1277#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:46,093 INFO L273 TraceCheckUtils]: 32: Hoare triple {1277#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {1154#false} is VALID [2018-11-23 11:40:46,094 INFO L273 TraceCheckUtils]: 33: Hoare triple {1154#false} assume !false; {1154#false} is VALID [2018-11-23 11:40:46,100 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:40:46,100 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:40:49,280 INFO L273 TraceCheckUtils]: 33: Hoare triple {1154#false} assume !false; {1154#false} is VALID [2018-11-23 11:40:49,281 INFO L273 TraceCheckUtils]: 32: Hoare triple {1287#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {1154#false} is VALID [2018-11-23 11:40:49,281 INFO L273 TraceCheckUtils]: 31: Hoare triple {1291#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {1287#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:40:49,282 INFO L256 TraceCheckUtils]: 30: Hoare triple {1269#(= main_~y~0 (_ bv0 32))} call __VERIFIER_assert((if 0bv32 == ~y~0 then 1bv32 else 0bv32)); {1291#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:40:49,283 INFO L273 TraceCheckUtils]: 29: Hoare triple {1298#(or (not (= main_~j~0 main_~i~0)) (= main_~y~0 (_ bv0 32)))} assume ~i~0 == ~j~0; {1269#(= main_~y~0 (_ bv0 32))} is VALID [2018-11-23 11:40:49,283 INFO L273 TraceCheckUtils]: 28: Hoare triple {1302#(or (not (= main_~j~0 main_~i~0)) (not (= main_~x~0 (_ bv0 32))) (= main_~y~0 (_ bv0 32)))} assume !(0bv32 != ~x~0); {1298#(or (not (= main_~j~0 main_~i~0)) (= main_~y~0 (_ bv0 32)))} is VALID [2018-11-23 11:40:49,285 INFO L273 TraceCheckUtils]: 27: Hoare triple {1306#(or (not (= main_~j~0 main_~i~0)) (= (_ bv1 32) main_~y~0) (not (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1302#(or (not (= main_~j~0 main_~i~0)) (not (= main_~x~0 (_ bv0 32))) (= main_~y~0 (_ bv0 32)))} is VALID [2018-11-23 11:40:49,287 INFO L273 TraceCheckUtils]: 26: Hoare triple {1310#(or (not (= main_~j~0 main_~i~0)) (not (= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))) (= (_ bv2 32) main_~y~0))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1306#(or (not (= main_~j~0 main_~i~0)) (= (_ bv1 32) main_~y~0) (not (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:40:49,289 INFO L273 TraceCheckUtils]: 25: Hoare triple {1314#(or (= (_ bv3 32) main_~y~0) (not (= main_~j~0 main_~i~0)) (not (= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1310#(or (not (= main_~j~0 main_~i~0)) (not (= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))) (= (_ bv2 32) main_~y~0))} is VALID [2018-11-23 11:40:49,290 INFO L273 TraceCheckUtils]: 24: Hoare triple {1318#(or (= (_ bv4 32) main_~y~0) (not (= main_~j~0 main_~i~0)) (not (= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1314#(or (= (_ bv3 32) main_~y~0) (not (= main_~j~0 main_~i~0)) (not (= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))))} is VALID [2018-11-23 11:40:49,292 INFO L273 TraceCheckUtils]: 23: Hoare triple {1322#(or (not (= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= main_~j~0 main_~i~0)) (= (_ bv5 32) main_~y~0))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1318#(or (= (_ bv4 32) main_~y~0) (not (= main_~j~0 main_~i~0)) (not (= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))))} is VALID [2018-11-23 11:40:49,294 INFO L273 TraceCheckUtils]: 22: Hoare triple {1326#(or (not (= main_~j~0 main_~i~0)) (not (= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))) (= (_ bv6 32) main_~y~0))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1322#(or (not (= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= main_~j~0 main_~i~0)) (= (_ bv5 32) main_~y~0))} is VALID [2018-11-23 11:40:49,296 INFO L273 TraceCheckUtils]: 21: Hoare triple {1330#(or (not (= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32))) (= (_ bv7 32) main_~y~0) (not (= main_~j~0 main_~i~0)))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1326#(or (not (= main_~j~0 main_~i~0)) (not (= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))) (= (_ bv6 32) main_~y~0))} is VALID [2018-11-23 11:40:49,298 INFO L273 TraceCheckUtils]: 20: Hoare triple {1334#(or (= (_ bv8 32) main_~y~0) (not (= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))) (not (= main_~j~0 main_~i~0)))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1330#(or (not (= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32))) (= (_ bv7 32) main_~y~0) (not (= main_~j~0 main_~i~0)))} is VALID [2018-11-23 11:40:49,301 INFO L273 TraceCheckUtils]: 19: Hoare triple {1338#(or (not (= main_~j~0 main_~i~0)) (= (_ bv9 32) main_~y~0) (not (= (bvadd main_~x~0 (_ bv4294967287 32)) (_ bv0 32))))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1334#(or (= (_ bv8 32) main_~y~0) (not (= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))) (not (= main_~j~0 main_~i~0)))} is VALID [2018-11-23 11:40:49,304 INFO L273 TraceCheckUtils]: 18: Hoare triple {1342#(or (= (_ bv10 32) main_~y~0) (not (= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))) (not (= main_~j~0 main_~i~0)))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1338#(or (not (= main_~j~0 main_~i~0)) (= (_ bv9 32) main_~y~0) (not (= (bvadd main_~x~0 (_ bv4294967287 32)) (_ bv0 32))))} is VALID [2018-11-23 11:40:49,306 INFO L273 TraceCheckUtils]: 17: Hoare triple {1346#(or (= (_ bv11 32) main_~y~0) (not (= main_~j~0 main_~i~0)) (not (= (bvadd main_~x~0 (_ bv4294967285 32)) (_ bv0 32))))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1342#(or (= (_ bv10 32) main_~y~0) (not (= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))) (not (= main_~j~0 main_~i~0)))} is VALID [2018-11-23 11:40:49,309 INFO L273 TraceCheckUtils]: 16: Hoare triple {1350#(or (= (_ bv12 32) main_~y~0) (not (= main_~j~0 main_~i~0)) (not (= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1346#(or (= (_ bv11 32) main_~y~0) (not (= main_~j~0 main_~i~0)) (not (= (bvadd main_~x~0 (_ bv4294967285 32)) (_ bv0 32))))} is VALID [2018-11-23 11:40:49,311 INFO L273 TraceCheckUtils]: 15: Hoare triple {1354#(or (not (= main_~j~0 main_~i~0)) (not (= (bvadd main_~x~0 (_ bv4294967283 32)) (_ bv0 32))) (= (_ bv13 32) main_~y~0))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1350#(or (= (_ bv12 32) main_~y~0) (not (= main_~j~0 main_~i~0)) (not (= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))))} is VALID [2018-11-23 11:40:49,314 INFO L273 TraceCheckUtils]: 14: Hoare triple {1358#(or (not (= main_~j~0 main_~i~0)) (not (= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))) (= (_ bv14 32) main_~y~0))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1354#(or (not (= main_~j~0 main_~i~0)) (not (= (bvadd main_~x~0 (_ bv4294967283 32)) (_ bv0 32))) (= (_ bv13 32) main_~y~0))} is VALID [2018-11-23 11:40:49,317 INFO L273 TraceCheckUtils]: 13: Hoare triple {1362#(or (= (_ bv15 32) main_~y~0) (not (= main_~j~0 main_~i~0)) (not (= (bvadd main_~x~0 (_ bv4294967281 32)) (_ bv0 32))))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1358#(or (not (= main_~j~0 main_~i~0)) (not (= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))) (= (_ bv14 32) main_~y~0))} is VALID [2018-11-23 11:40:49,318 INFO L273 TraceCheckUtils]: 12: Hoare triple {1366#(or (not (= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))) (not (= main_~j~0 main_~i~0)) (= (_ bv16 32) main_~y~0))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1362#(or (= (_ bv15 32) main_~y~0) (not (= main_~j~0 main_~i~0)) (not (= (bvadd main_~x~0 (_ bv4294967281 32)) (_ bv0 32))))} is VALID [2018-11-23 11:40:49,319 INFO L273 TraceCheckUtils]: 11: Hoare triple {1370#(or (= (_ bv17 32) main_~y~0) (not (= (bvadd main_~x~0 (_ bv4294967279 32)) (_ bv0 32))) (not (= main_~j~0 main_~i~0)))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1366#(or (not (= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))) (not (= main_~j~0 main_~i~0)) (= (_ bv16 32) main_~y~0))} is VALID [2018-11-23 11:40:49,322 INFO L273 TraceCheckUtils]: 10: Hoare triple {1374#(or (not (= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))) (not (= main_~j~0 main_~i~0)) (= (_ bv18 32) main_~y~0))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1370#(or (= (_ bv17 32) main_~y~0) (not (= (bvadd main_~x~0 (_ bv4294967279 32)) (_ bv0 32))) (not (= main_~j~0 main_~i~0)))} is VALID [2018-11-23 11:40:49,324 INFO L273 TraceCheckUtils]: 9: Hoare triple {1378#(or (= (_ bv19 32) main_~y~0) (not (= main_~j~0 main_~i~0)) (not (= (bvadd main_~x~0 (_ bv4294967277 32)) (_ bv0 32))))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1374#(or (not (= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))) (not (= main_~j~0 main_~i~0)) (= (_ bv18 32) main_~y~0))} is VALID [2018-11-23 11:40:49,327 INFO L273 TraceCheckUtils]: 8: Hoare triple {1382#(or (= (_ bv20 32) main_~y~0) (not (= main_~j~0 main_~i~0)) (not (= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1378#(or (= (_ bv19 32) main_~y~0) (not (= main_~j~0 main_~i~0)) (not (= (bvadd main_~x~0 (_ bv4294967277 32)) (_ bv0 32))))} is VALID [2018-11-23 11:40:49,330 INFO L273 TraceCheckUtils]: 7: Hoare triple {1386#(or (= (_ bv21 32) main_~y~0) (not (= main_~j~0 main_~i~0)) (not (= (bvadd main_~x~0 (_ bv4294967275 32)) (_ bv0 32))))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1382#(or (= (_ bv20 32) main_~y~0) (not (= main_~j~0 main_~i~0)) (not (= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))))} is VALID [2018-11-23 11:40:49,332 INFO L273 TraceCheckUtils]: 6: Hoare triple {1390#(or (= (_ bv22 32) main_~y~0) (not (= main_~j~0 main_~i~0)) (not (= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))))} assume !!(0bv32 != ~x~0);#t~post3 := ~x~0;~x~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~y~0;~y~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1386#(or (= (_ bv21 32) main_~y~0) (not (= main_~j~0 main_~i~0)) (not (= (bvadd main_~x~0 (_ bv4294967275 32)) (_ bv0 32))))} is VALID [2018-11-23 11:40:49,335 INFO L273 TraceCheckUtils]: 5: Hoare triple {1153#true} assume !!(~bvsge32(~i~0, 0bv32) && ~bvsge32(~j~0, 0bv32));~x~0 := ~i~0;~y~0 := ~j~0; {1390#(or (= (_ bv22 32) main_~y~0) (not (= main_~j~0 main_~i~0)) (not (= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))))} is VALID [2018-11-23 11:40:49,335 INFO L273 TraceCheckUtils]: 4: Hoare triple {1153#true} havoc ~i~0;havoc ~j~0;~i~0 := #t~nondet1;havoc #t~nondet1;~j~0 := #t~nondet2;havoc #t~nondet2; {1153#true} is VALID [2018-11-23 11:40:49,335 INFO L256 TraceCheckUtils]: 3: Hoare triple {1153#true} call #t~ret5 := main(); {1153#true} is VALID [2018-11-23 11:40:49,336 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1153#true} {1153#true} #42#return; {1153#true} is VALID [2018-11-23 11:40:49,336 INFO L273 TraceCheckUtils]: 1: Hoare triple {1153#true} assume true; {1153#true} is VALID [2018-11-23 11:40:49,336 INFO L256 TraceCheckUtils]: 0: Hoare triple {1153#true} call ULTIMATE.init(); {1153#true} is VALID [2018-11-23 11:40:49,340 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:40:49,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:40:49,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 55 [2018-11-23 11:40:49,342 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 34 [2018-11-23 11:40:49,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:40:49,343 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states. [2018-11-23 11:40:50,358 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:40:50,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-23 11:40:50,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-23 11:40:50,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=643, Invalid=2327, Unknown=0, NotChecked=0, Total=2970 [2018-11-23 11:40:50,362 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 55 states. [2018-11-23 11:41:38,909 WARN L180 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2018-11-23 11:42:24,150 WARN L180 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2018-11-23 11:42:25,058 WARN L180 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 120