/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/sum01_bug02.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:50:24,641 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:50:24,644 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:50:24,669 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:50:24,669 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:50:24,672 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:50:24,674 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:50:24,691 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:50:24,694 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:50:24,695 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:50:24,698 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:50:24,699 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:50:24,699 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:50:24,701 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:50:24,703 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:50:24,707 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:50:24,709 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:50:24,710 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:50:24,712 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:50:24,714 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:50:24,716 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:50:24,718 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:50:24,719 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:50:24,720 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:50:24,723 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:50:24,723 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:50:24,724 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:50:24,725 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:50:24,725 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:50:24,727 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:50:24,727 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:50:24,728 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:50:24,729 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:50:24,729 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:50:24,731 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:50:24,731 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:50:24,732 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:50:24,732 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:50:24,732 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:50:24,734 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:50:24,734 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:50:24,735 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:50:24,754 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:50:24,754 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:50:24,756 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:50:24,756 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:50:24,756 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:50:24,757 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:50:24,757 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:50:24,757 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:50:24,757 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:50:24,758 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:50:24,758 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:50:24,758 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:50:24,758 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:50:24,758 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:50:24,759 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:50:24,759 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:50:24,759 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:50:24,759 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:50:24,759 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:50:24,760 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:50:24,760 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:50:24,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:50:24,760 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:50:24,760 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:50:24,761 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:50:24,761 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:50:24,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:50:24,761 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:50:24,761 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:50:24,762 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:50:25,082 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:50:25,098 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:50:25,102 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:50:25,104 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:50:25,104 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:50:25,105 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01_bug02.i [2020-07-17 22:50:25,180 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f721251f/abf4302d3885453a8594387e28606f5c/FLAG01c5a6bca [2020-07-17 22:50:25,748 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:50:25,751 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01_bug02.i [2020-07-17 22:50:25,761 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f721251f/abf4302d3885453a8594387e28606f5c/FLAG01c5a6bca [2020-07-17 22:50:26,146 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f721251f/abf4302d3885453a8594387e28606f5c [2020-07-17 22:50:26,159 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:50:26,162 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:50:26,164 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:50:26,164 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:50:26,168 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:50:26,170 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:50:26" (1/1) ... [2020-07-17 22:50:26,174 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ff530c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:26, skipping insertion in model container [2020-07-17 22:50:26,174 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:50:26" (1/1) ... [2020-07-17 22:50:26,184 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:50:26,204 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:50:26,428 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:50:26,435 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:50:26,454 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:50:26,472 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:50:26,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:26 WrapperNode [2020-07-17 22:50:26,473 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:50:26,474 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:50:26,474 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:50:26,474 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:50:26,487 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:26" (1/1) ... [2020-07-17 22:50:26,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:26" (1/1) ... [2020-07-17 22:50:26,587 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:26" (1/1) ... [2020-07-17 22:50:26,588 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:26" (1/1) ... [2020-07-17 22:50:26,595 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:26" (1/1) ... [2020-07-17 22:50:26,601 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:26" (1/1) ... [2020-07-17 22:50:26,602 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:26" (1/1) ... [2020-07-17 22:50:26,604 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:50:26,605 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:50:26,605 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:50:26,605 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:50:26,606 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:26" (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 [2020-07-17 22:50:26,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:50:26,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:50:26,683 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:50:26,684 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:50:26,684 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:50:26,684 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:50:26,684 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-07-17 22:50:26,684 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:50:26,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:50:26,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:50:26,959 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:50:26,960 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-17 22:50:26,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:50:26 BoogieIcfgContainer [2020-07-17 22:50:26,965 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:50:26,969 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:50:26,970 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:50:26,984 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:50:26,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:50:26" (1/3) ... [2020-07-17 22:50:26,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@190f32f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:50:26, skipping insertion in model container [2020-07-17 22:50:26,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:26" (2/3) ... [2020-07-17 22:50:26,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@190f32f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:50:26, skipping insertion in model container [2020-07-17 22:50:26,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:50:26" (3/3) ... [2020-07-17 22:50:26,996 INFO L109 eAbstractionObserver]: Analyzing ICFG sum01_bug02.i [2020-07-17 22:50:27,034 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:50:27,049 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:50:27,076 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:50:27,107 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:50:27,107 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:50:27,108 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:50:27,108 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:50:27,108 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:50:27,108 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:50:27,109 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:50:27,109 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:50:27,129 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-07-17 22:50:27,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-17 22:50:27,135 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:27,137 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:27,137 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:27,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:27,145 INFO L82 PathProgramCache]: Analyzing trace with hash -146959038, now seen corresponding path program 1 times [2020-07-17 22:50:27,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:27,158 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709780785] [2020-07-17 22:50:27,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:27,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:27,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:27,327 INFO L280 TraceCheckUtils]: 0: Hoare triple {23#true} assume true; {23#true} is VALID [2020-07-17 22:50:27,327 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {23#true} {23#true} #39#return; {23#true} is VALID [2020-07-17 22:50:27,330 INFO L263 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2020-07-17 22:50:27,330 INFO L280 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2020-07-17 22:50:27,331 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #39#return; {23#true} is VALID [2020-07-17 22:50:27,331 INFO L263 TraceCheckUtils]: 3: Hoare triple {23#true} call #t~ret3 := main(); {23#true} is VALID [2020-07-17 22:50:27,332 INFO L280 TraceCheckUtils]: 4: Hoare triple {23#true} havoc ~i~0;~j~0 := 10;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {23#true} is VALID [2020-07-17 22:50:27,333 INFO L280 TraceCheckUtils]: 5: Hoare triple {23#true} assume !true; {24#false} is VALID [2020-07-17 22:50:27,334 INFO L263 TraceCheckUtils]: 6: Hoare triple {24#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {24#false} is VALID [2020-07-17 22:50:27,334 INFO L280 TraceCheckUtils]: 7: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2020-07-17 22:50:27,334 INFO L280 TraceCheckUtils]: 8: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2020-07-17 22:50:27,335 INFO L280 TraceCheckUtils]: 9: Hoare triple {24#false} assume !false; {24#false} is VALID [2020-07-17 22:50:27,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:27,337 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709780785] [2020-07-17 22:50:27,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:50:27,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-17 22:50:27,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329573254] [2020-07-17 22:50:27,346 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-17 22:50:27,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:27,355 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-17 22:50:27,400 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:27,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-17 22:50:27,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:27,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-17 22:50:27,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-17 22:50:27,415 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2020-07-17 22:50:27,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:27,502 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2020-07-17 22:50:27,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-17 22:50:27,502 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-17 22:50:27,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:27,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-17 22:50:27,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 35 transitions. [2020-07-17 22:50:27,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-17 22:50:27,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 35 transitions. [2020-07-17 22:50:27,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 35 transitions. [2020-07-17 22:50:27,599 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:27,612 INFO L225 Difference]: With dead ends: 31 [2020-07-17 22:50:27,613 INFO L226 Difference]: Without dead ends: 14 [2020-07-17 22:50:27,617 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-17 22:50:27,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-17 22:50:27,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-17 22:50:27,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:27,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2020-07-17 22:50:27,669 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-17 22:50:27,669 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-17 22:50:27,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:27,673 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2020-07-17 22:50:27,674 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2020-07-17 22:50:27,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:27,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:27,675 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-17 22:50:27,675 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-17 22:50:27,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:27,679 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2020-07-17 22:50:27,679 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2020-07-17 22:50:27,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:27,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:27,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:27,681 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:27,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-17 22:50:27,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2020-07-17 22:50:27,686 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2020-07-17 22:50:27,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:27,686 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2020-07-17 22:50:27,686 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-17 22:50:27,687 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2020-07-17 22:50:27,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-17 22:50:27,688 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:27,688 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:27,688 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:50:27,689 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:27,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:27,690 INFO L82 PathProgramCache]: Analyzing trace with hash -158964811, now seen corresponding path program 1 times [2020-07-17 22:50:27,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:27,691 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85001371] [2020-07-17 22:50:27,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:27,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:27,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:27,828 INFO L280 TraceCheckUtils]: 0: Hoare triple {118#true} assume true; {118#true} is VALID [2020-07-17 22:50:27,829 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {118#true} {118#true} #39#return; {118#true} is VALID [2020-07-17 22:50:27,829 INFO L263 TraceCheckUtils]: 0: Hoare triple {118#true} call ULTIMATE.init(); {118#true} is VALID [2020-07-17 22:50:27,829 INFO L280 TraceCheckUtils]: 1: Hoare triple {118#true} assume true; {118#true} is VALID [2020-07-17 22:50:27,830 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {118#true} {118#true} #39#return; {118#true} is VALID [2020-07-17 22:50:27,830 INFO L263 TraceCheckUtils]: 3: Hoare triple {118#true} call #t~ret3 := main(); {118#true} is VALID [2020-07-17 22:50:27,832 INFO L280 TraceCheckUtils]: 4: Hoare triple {118#true} havoc ~i~0;~j~0 := 10;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {122#(= 0 main_~sn~0)} is VALID [2020-07-17 22:50:27,834 INFO L280 TraceCheckUtils]: 5: Hoare triple {122#(= 0 main_~sn~0)} assume !(~i~0 <= ~n~0); {122#(= 0 main_~sn~0)} is VALID [2020-07-17 22:50:27,836 INFO L263 TraceCheckUtils]: 6: Hoare triple {122#(= 0 main_~sn~0)} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {123#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:50:27,838 INFO L280 TraceCheckUtils]: 7: Hoare triple {123#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {124#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:50:27,839 INFO L280 TraceCheckUtils]: 8: Hoare triple {124#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {119#false} is VALID [2020-07-17 22:50:27,840 INFO L280 TraceCheckUtils]: 9: Hoare triple {119#false} assume !false; {119#false} is VALID [2020-07-17 22:50:27,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:27,842 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85001371] [2020-07-17 22:50:27,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:50:27,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:50:27,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671490518] [2020-07-17 22:50:27,845 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-17 22:50:27,845 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:27,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:50:27,865 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:27,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:50:27,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:27,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:50:27,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:50:27,867 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2020-07-17 22:50:28,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:28,031 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-07-17 22:50:28,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:50:28,032 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-17 22:50:28,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:28,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:50:28,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2020-07-17 22:50:28,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:50:28,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2020-07-17 22:50:28,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 25 transitions. [2020-07-17 22:50:28,090 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:28,092 INFO L225 Difference]: With dead ends: 23 [2020-07-17 22:50:28,093 INFO L226 Difference]: Without dead ends: 18 [2020-07-17 22:50:28,094 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:50:28,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-17 22:50:28,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-17 22:50:28,105 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:28,105 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2020-07-17 22:50:28,106 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-17 22:50:28,106 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-17 22:50:28,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:28,109 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2020-07-17 22:50:28,109 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2020-07-17 22:50:28,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:28,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:28,110 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-17 22:50:28,110 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-17 22:50:28,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:28,113 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2020-07-17 22:50:28,114 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2020-07-17 22:50:28,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:28,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:28,114 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:28,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:28,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-17 22:50:28,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2020-07-17 22:50:28,117 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 10 [2020-07-17 22:50:28,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:28,118 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-07-17 22:50:28,118 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:50:28,118 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2020-07-17 22:50:28,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-17 22:50:28,119 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:28,119 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:28,119 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:50:28,120 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:28,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:28,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1017948080, now seen corresponding path program 1 times [2020-07-17 22:50:28,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:28,121 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717876125] [2020-07-17 22:50:28,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:28,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:28,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:28,554 INFO L280 TraceCheckUtils]: 0: Hoare triple {224#true} assume true; {224#true} is VALID [2020-07-17 22:50:28,554 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {224#true} {224#true} #39#return; {224#true} is VALID [2020-07-17 22:50:28,555 INFO L263 TraceCheckUtils]: 0: Hoare triple {224#true} call ULTIMATE.init(); {224#true} is VALID [2020-07-17 22:50:28,555 INFO L280 TraceCheckUtils]: 1: Hoare triple {224#true} assume true; {224#true} is VALID [2020-07-17 22:50:28,555 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {224#true} {224#true} #39#return; {224#true} is VALID [2020-07-17 22:50:28,556 INFO L263 TraceCheckUtils]: 3: Hoare triple {224#true} call #t~ret3 := main(); {224#true} is VALID [2020-07-17 22:50:28,557 INFO L280 TraceCheckUtils]: 4: Hoare triple {224#true} havoc ~i~0;~j~0 := 10;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {228#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-17 22:50:28,559 INFO L280 TraceCheckUtils]: 5: Hoare triple {228#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {229#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-17 22:50:28,561 INFO L280 TraceCheckUtils]: 6: Hoare triple {229#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {230#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} is VALID [2020-07-17 22:50:28,563 INFO L280 TraceCheckUtils]: 7: Hoare triple {230#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {230#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} is VALID [2020-07-17 22:50:28,565 INFO L280 TraceCheckUtils]: 8: Hoare triple {230#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {231#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} is VALID [2020-07-17 22:50:28,567 INFO L280 TraceCheckUtils]: 9: Hoare triple {231#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} assume !(~i~0 <= ~n~0); {232#(and (<= main_~sn~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~sn~0))} is VALID [2020-07-17 22:50:28,569 INFO L263 TraceCheckUtils]: 10: Hoare triple {232#(and (<= main_~sn~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {233#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:50:28,570 INFO L280 TraceCheckUtils]: 11: Hoare triple {233#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {234#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:50:28,571 INFO L280 TraceCheckUtils]: 12: Hoare triple {234#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {225#false} is VALID [2020-07-17 22:50:28,571 INFO L280 TraceCheckUtils]: 13: Hoare triple {225#false} assume !false; {225#false} is VALID [2020-07-17 22:50:28,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:28,575 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717876125] [2020-07-17 22:50:28,575 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185846659] [2020-07-17 22:50:28,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:28,617 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-17 22:50:28,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:28,629 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:28,898 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:50:28,971 INFO L263 TraceCheckUtils]: 0: Hoare triple {224#true} call ULTIMATE.init(); {224#true} is VALID [2020-07-17 22:50:28,971 INFO L280 TraceCheckUtils]: 1: Hoare triple {224#true} assume true; {224#true} is VALID [2020-07-17 22:50:28,972 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {224#true} {224#true} #39#return; {224#true} is VALID [2020-07-17 22:50:28,972 INFO L263 TraceCheckUtils]: 3: Hoare triple {224#true} call #t~ret3 := main(); {224#true} is VALID [2020-07-17 22:50:28,973 INFO L280 TraceCheckUtils]: 4: Hoare triple {224#true} havoc ~i~0;~j~0 := 10;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {250#(and (= 1 main_~i~0) (= 0 main_~sn~0))} is VALID [2020-07-17 22:50:28,975 INFO L280 TraceCheckUtils]: 5: Hoare triple {250#(and (= 1 main_~i~0) (= 0 main_~sn~0))} assume !!(~i~0 <= ~n~0); {254#(and (= 1 main_~i~0) (<= main_~i~0 main_~n~0) (= 0 main_~sn~0))} is VALID [2020-07-17 22:50:28,976 INFO L280 TraceCheckUtils]: 6: Hoare triple {254#(and (= 1 main_~i~0) (<= main_~i~0 main_~n~0) (= 0 main_~sn~0))} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {258#(and (= 1 main_~i~0) (<= main_~i~0 main_~n~0) (= 2 main_~sn~0))} is VALID [2020-07-17 22:50:28,978 INFO L280 TraceCheckUtils]: 7: Hoare triple {258#(and (= 1 main_~i~0) (<= main_~i~0 main_~n~0) (= 2 main_~sn~0))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {258#(and (= 1 main_~i~0) (<= main_~i~0 main_~n~0) (= 2 main_~sn~0))} is VALID [2020-07-17 22:50:28,979 INFO L280 TraceCheckUtils]: 8: Hoare triple {258#(and (= 1 main_~i~0) (<= main_~i~0 main_~n~0) (= 2 main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {265#(and (<= main_~i~0 2) (= 2 main_~sn~0) (<= 1 main_~n~0))} is VALID [2020-07-17 22:50:28,981 INFO L280 TraceCheckUtils]: 9: Hoare triple {265#(and (<= main_~i~0 2) (= 2 main_~sn~0) (<= 1 main_~n~0))} assume !(~i~0 <= ~n~0); {269#(and (= 2 main_~sn~0) (<= 1 main_~n~0) (<= main_~n~0 1))} is VALID [2020-07-17 22:50:28,983 INFO L263 TraceCheckUtils]: 10: Hoare triple {269#(and (= 2 main_~sn~0) (<= 1 main_~n~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {273#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:50:28,985 INFO L280 TraceCheckUtils]: 11: Hoare triple {273#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {277#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:50:28,986 INFO L280 TraceCheckUtils]: 12: Hoare triple {277#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {225#false} is VALID [2020-07-17 22:50:28,986 INFO L280 TraceCheckUtils]: 13: Hoare triple {225#false} assume !false; {225#false} is VALID [2020-07-17 22:50:28,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:28,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:50:28,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2020-07-17 22:50:28,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905326784] [2020-07-17 22:50:28,989 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 14 [2020-07-17 22:50:28,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:28,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-17 22:50:29,034 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:29,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-17 22:50:29,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:29,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-17 22:50:29,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2020-07-17 22:50:29,036 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 16 states. [2020-07-17 22:50:29,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:29,721 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2020-07-17 22:50:29,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-17 22:50:29,722 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 14 [2020-07-17 22:50:29,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:29,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-17 22:50:29,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 41 transitions. [2020-07-17 22:50:29,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-17 22:50:29,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 41 transitions. [2020-07-17 22:50:29,732 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 41 transitions. [2020-07-17 22:50:29,803 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:29,805 INFO L225 Difference]: With dead ends: 40 [2020-07-17 22:50:29,807 INFO L226 Difference]: Without dead ends: 34 [2020-07-17 22:50:29,808 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2020-07-17 22:50:29,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-17 22:50:29,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2020-07-17 22:50:29,836 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:29,836 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 27 states. [2020-07-17 22:50:29,836 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 27 states. [2020-07-17 22:50:29,836 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 27 states. [2020-07-17 22:50:29,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:29,840 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2020-07-17 22:50:29,840 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2020-07-17 22:50:29,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:29,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:29,841 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 34 states. [2020-07-17 22:50:29,841 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 34 states. [2020-07-17 22:50:29,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:29,844 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2020-07-17 22:50:29,845 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2020-07-17 22:50:29,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:29,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:29,846 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:29,846 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:29,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-17 22:50:29,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2020-07-17 22:50:29,848 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 14 [2020-07-17 22:50:29,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:29,849 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2020-07-17 22:50:29,849 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-17 22:50:29,849 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2020-07-17 22:50:29,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-17 22:50:29,850 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:29,850 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:30,062 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-17 22:50:30,063 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:30,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:30,064 INFO L82 PathProgramCache]: Analyzing trace with hash -852639511, now seen corresponding path program 1 times [2020-07-17 22:50:30,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:30,065 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364226180] [2020-07-17 22:50:30,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:30,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:30,136 INFO L280 TraceCheckUtils]: 0: Hoare triple {451#true} assume true; {451#true} is VALID [2020-07-17 22:50:30,137 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {451#true} {451#true} #39#return; {451#true} is VALID [2020-07-17 22:50:30,137 INFO L263 TraceCheckUtils]: 0: Hoare triple {451#true} call ULTIMATE.init(); {451#true} is VALID [2020-07-17 22:50:30,137 INFO L280 TraceCheckUtils]: 1: Hoare triple {451#true} assume true; {451#true} is VALID [2020-07-17 22:50:30,138 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {451#true} {451#true} #39#return; {451#true} is VALID [2020-07-17 22:50:30,138 INFO L263 TraceCheckUtils]: 3: Hoare triple {451#true} call #t~ret3 := main(); {451#true} is VALID [2020-07-17 22:50:30,139 INFO L280 TraceCheckUtils]: 4: Hoare triple {451#true} havoc ~i~0;~j~0 := 10;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {455#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-17 22:50:30,140 INFO L280 TraceCheckUtils]: 5: Hoare triple {455#(<= (+ main_~i~0 9) main_~j~0)} assume !!(~i~0 <= ~n~0); {455#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-17 22:50:30,142 INFO L280 TraceCheckUtils]: 6: Hoare triple {455#(<= (+ main_~i~0 9) main_~j~0)} assume !(~i~0 < ~j~0); {452#false} is VALID [2020-07-17 22:50:30,143 INFO L280 TraceCheckUtils]: 7: Hoare triple {452#false} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {452#false} is VALID [2020-07-17 22:50:30,143 INFO L280 TraceCheckUtils]: 8: Hoare triple {452#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {452#false} is VALID [2020-07-17 22:50:30,144 INFO L280 TraceCheckUtils]: 9: Hoare triple {452#false} assume !!(~i~0 <= ~n~0); {452#false} is VALID [2020-07-17 22:50:30,144 INFO L280 TraceCheckUtils]: 10: Hoare triple {452#false} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {452#false} is VALID [2020-07-17 22:50:30,144 INFO L280 TraceCheckUtils]: 11: Hoare triple {452#false} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {452#false} is VALID [2020-07-17 22:50:30,145 INFO L280 TraceCheckUtils]: 12: Hoare triple {452#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {452#false} is VALID [2020-07-17 22:50:30,145 INFO L280 TraceCheckUtils]: 13: Hoare triple {452#false} assume !(~i~0 <= ~n~0); {452#false} is VALID [2020-07-17 22:50:30,145 INFO L263 TraceCheckUtils]: 14: Hoare triple {452#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {452#false} is VALID [2020-07-17 22:50:30,145 INFO L280 TraceCheckUtils]: 15: Hoare triple {452#false} ~cond := #in~cond; {452#false} is VALID [2020-07-17 22:50:30,146 INFO L280 TraceCheckUtils]: 16: Hoare triple {452#false} assume 0 == ~cond; {452#false} is VALID [2020-07-17 22:50:30,146 INFO L280 TraceCheckUtils]: 17: Hoare triple {452#false} assume !false; {452#false} is VALID [2020-07-17 22:50:30,146 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-17 22:50:30,147 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364226180] [2020-07-17 22:50:30,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:50:30,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:50:30,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766770522] [2020-07-17 22:50:30,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-17 22:50:30,149 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:30,149 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:50:30,176 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:30,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:50:30,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:30,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:50:30,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:50:30,177 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 3 states. [2020-07-17 22:50:30,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:30,245 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2020-07-17 22:50:30,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:50:30,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-17 22:50:30,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:30,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:50:30,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2020-07-17 22:50:30,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:50:30,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2020-07-17 22:50:30,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 29 transitions. [2020-07-17 22:50:30,286 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:30,287 INFO L225 Difference]: With dead ends: 36 [2020-07-17 22:50:30,288 INFO L226 Difference]: Without dead ends: 23 [2020-07-17 22:50:30,289 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:50:30,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-17 22:50:30,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-17 22:50:30,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:30,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2020-07-17 22:50:30,305 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-17 22:50:30,305 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-17 22:50:30,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:30,308 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-07-17 22:50:30,308 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-17 22:50:30,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:30,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:30,309 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-17 22:50:30,309 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-17 22:50:30,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:30,311 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-07-17 22:50:30,311 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-17 22:50:30,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:30,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:30,312 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:30,312 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:30,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-17 22:50:30,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2020-07-17 22:50:30,314 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 18 [2020-07-17 22:50:30,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:30,315 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2020-07-17 22:50:30,315 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:50:30,315 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-17 22:50:30,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-17 22:50:30,316 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:30,316 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:30,316 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 22:50:30,317 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:30,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:30,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1920151575, now seen corresponding path program 2 times [2020-07-17 22:50:30,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:30,318 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601395803] [2020-07-17 22:50:30,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:30,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:30,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:30,380 INFO L280 TraceCheckUtils]: 0: Hoare triple {587#true} assume true; {587#true} is VALID [2020-07-17 22:50:30,380 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {587#true} {587#true} #39#return; {587#true} is VALID [2020-07-17 22:50:30,380 INFO L263 TraceCheckUtils]: 0: Hoare triple {587#true} call ULTIMATE.init(); {587#true} is VALID [2020-07-17 22:50:30,381 INFO L280 TraceCheckUtils]: 1: Hoare triple {587#true} assume true; {587#true} is VALID [2020-07-17 22:50:30,381 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {587#true} {587#true} #39#return; {587#true} is VALID [2020-07-17 22:50:30,381 INFO L263 TraceCheckUtils]: 3: Hoare triple {587#true} call #t~ret3 := main(); {587#true} is VALID [2020-07-17 22:50:30,383 INFO L280 TraceCheckUtils]: 4: Hoare triple {587#true} havoc ~i~0;~j~0 := 10;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {591#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-17 22:50:30,383 INFO L280 TraceCheckUtils]: 5: Hoare triple {591#(<= (+ main_~i~0 9) main_~j~0)} assume !!(~i~0 <= ~n~0); {591#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-17 22:50:30,385 INFO L280 TraceCheckUtils]: 6: Hoare triple {591#(<= (+ main_~i~0 9) main_~j~0)} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {591#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-17 22:50:30,386 INFO L280 TraceCheckUtils]: 7: Hoare triple {591#(<= (+ main_~i~0 9) main_~j~0)} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {592#(<= (+ main_~i~0 8) main_~j~0)} is VALID [2020-07-17 22:50:30,387 INFO L280 TraceCheckUtils]: 8: Hoare triple {592#(<= (+ main_~i~0 8) main_~j~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {593#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-17 22:50:30,388 INFO L280 TraceCheckUtils]: 9: Hoare triple {593#(<= (+ main_~i~0 7) main_~j~0)} assume !!(~i~0 <= ~n~0); {593#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-17 22:50:30,389 INFO L280 TraceCheckUtils]: 10: Hoare triple {593#(<= (+ main_~i~0 7) main_~j~0)} assume !(~i~0 < ~j~0); {588#false} is VALID [2020-07-17 22:50:30,390 INFO L280 TraceCheckUtils]: 11: Hoare triple {588#false} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {588#false} is VALID [2020-07-17 22:50:30,390 INFO L280 TraceCheckUtils]: 12: Hoare triple {588#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {588#false} is VALID [2020-07-17 22:50:30,391 INFO L280 TraceCheckUtils]: 13: Hoare triple {588#false} assume !(~i~0 <= ~n~0); {588#false} is VALID [2020-07-17 22:50:30,391 INFO L263 TraceCheckUtils]: 14: Hoare triple {588#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {588#false} is VALID [2020-07-17 22:50:30,391 INFO L280 TraceCheckUtils]: 15: Hoare triple {588#false} ~cond := #in~cond; {588#false} is VALID [2020-07-17 22:50:30,391 INFO L280 TraceCheckUtils]: 16: Hoare triple {588#false} assume 0 == ~cond; {588#false} is VALID [2020-07-17 22:50:30,392 INFO L280 TraceCheckUtils]: 17: Hoare triple {588#false} assume !false; {588#false} is VALID [2020-07-17 22:50:30,392 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:30,393 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601395803] [2020-07-17 22:50:30,393 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528622525] [2020-07-17 22:50:30,393 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:30,422 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:50:30,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:50:30,424 INFO L264 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-17 22:50:30,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:30,435 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:30,551 INFO L263 TraceCheckUtils]: 0: Hoare triple {587#true} call ULTIMATE.init(); {587#true} is VALID [2020-07-17 22:50:30,551 INFO L280 TraceCheckUtils]: 1: Hoare triple {587#true} assume true; {587#true} is VALID [2020-07-17 22:50:30,552 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {587#true} {587#true} #39#return; {587#true} is VALID [2020-07-17 22:50:30,552 INFO L263 TraceCheckUtils]: 3: Hoare triple {587#true} call #t~ret3 := main(); {587#true} is VALID [2020-07-17 22:50:30,553 INFO L280 TraceCheckUtils]: 4: Hoare triple {587#true} havoc ~i~0;~j~0 := 10;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {609#(and (<= 10 main_~j~0) (<= main_~i~0 1))} is VALID [2020-07-17 22:50:30,555 INFO L280 TraceCheckUtils]: 5: Hoare triple {609#(and (<= 10 main_~j~0) (<= main_~i~0 1))} assume !!(~i~0 <= ~n~0); {609#(and (<= 10 main_~j~0) (<= main_~i~0 1))} is VALID [2020-07-17 22:50:30,556 INFO L280 TraceCheckUtils]: 6: Hoare triple {609#(and (<= 10 main_~j~0) (<= main_~i~0 1))} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {609#(and (<= 10 main_~j~0) (<= main_~i~0 1))} is VALID [2020-07-17 22:50:30,557 INFO L280 TraceCheckUtils]: 7: Hoare triple {609#(and (<= 10 main_~j~0) (<= main_~i~0 1))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {619#(and (<= 9 main_~j~0) (<= main_~i~0 1))} is VALID [2020-07-17 22:50:30,558 INFO L280 TraceCheckUtils]: 8: Hoare triple {619#(and (<= 9 main_~j~0) (<= main_~i~0 1))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {623#(and (<= 9 main_~j~0) (<= main_~i~0 2))} is VALID [2020-07-17 22:50:30,560 INFO L280 TraceCheckUtils]: 9: Hoare triple {623#(and (<= 9 main_~j~0) (<= main_~i~0 2))} assume !!(~i~0 <= ~n~0); {623#(and (<= 9 main_~j~0) (<= main_~i~0 2))} is VALID [2020-07-17 22:50:30,561 INFO L280 TraceCheckUtils]: 10: Hoare triple {623#(and (<= 9 main_~j~0) (<= main_~i~0 2))} assume !(~i~0 < ~j~0); {588#false} is VALID [2020-07-17 22:50:30,561 INFO L280 TraceCheckUtils]: 11: Hoare triple {588#false} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {588#false} is VALID [2020-07-17 22:50:30,561 INFO L280 TraceCheckUtils]: 12: Hoare triple {588#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {588#false} is VALID [2020-07-17 22:50:30,562 INFO L280 TraceCheckUtils]: 13: Hoare triple {588#false} assume !(~i~0 <= ~n~0); {588#false} is VALID [2020-07-17 22:50:30,562 INFO L263 TraceCheckUtils]: 14: Hoare triple {588#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {588#false} is VALID [2020-07-17 22:50:30,562 INFO L280 TraceCheckUtils]: 15: Hoare triple {588#false} ~cond := #in~cond; {588#false} is VALID [2020-07-17 22:50:30,562 INFO L280 TraceCheckUtils]: 16: Hoare triple {588#false} assume 0 == ~cond; {588#false} is VALID [2020-07-17 22:50:30,563 INFO L280 TraceCheckUtils]: 17: Hoare triple {588#false} assume !false; {588#false} is VALID [2020-07-17 22:50:30,564 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:30,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:50:30,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2020-07-17 22:50:30,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265760672] [2020-07-17 22:50:30,565 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-07-17 22:50:30,566 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:30,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-17 22:50:30,600 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:30,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 22:50:30,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:30,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 22:50:30,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:50:30,602 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 8 states. [2020-07-17 22:50:30,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:30,699 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2020-07-17 22:50:30,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:50:30,699 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-07-17 22:50:30,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:30,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:50:30,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-17 22:50:30,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:50:30,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-17 22:50:30,704 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2020-07-17 22:50:30,752 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:30,753 INFO L225 Difference]: With dead ends: 32 [2020-07-17 22:50:30,755 INFO L226 Difference]: Without dead ends: 23 [2020-07-17 22:50:30,756 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:50:30,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-17 22:50:30,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-17 22:50:30,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:30,778 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2020-07-17 22:50:30,778 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-17 22:50:30,779 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-17 22:50:30,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:30,781 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2020-07-17 22:50:30,782 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-17 22:50:30,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:30,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:30,782 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-17 22:50:30,783 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-17 22:50:30,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:30,784 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2020-07-17 22:50:30,785 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-17 22:50:30,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:30,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:30,785 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:30,785 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:30,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-17 22:50:30,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2020-07-17 22:50:30,788 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 18 [2020-07-17 22:50:30,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:30,788 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2020-07-17 22:50:30,788 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 22:50:30,788 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-17 22:50:30,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:50:30,789 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:30,789 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:31,002 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:31,004 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:31,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:31,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1780946716, now seen corresponding path program 3 times [2020-07-17 22:50:31,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:31,005 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892820657] [2020-07-17 22:50:31,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:31,131 INFO L280 TraceCheckUtils]: 0: Hoare triple {774#true} assume true; {774#true} is VALID [2020-07-17 22:50:31,131 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {774#true} {774#true} #39#return; {774#true} is VALID [2020-07-17 22:50:31,132 INFO L263 TraceCheckUtils]: 0: Hoare triple {774#true} call ULTIMATE.init(); {774#true} is VALID [2020-07-17 22:50:31,132 INFO L280 TraceCheckUtils]: 1: Hoare triple {774#true} assume true; {774#true} is VALID [2020-07-17 22:50:31,132 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {774#true} {774#true} #39#return; {774#true} is VALID [2020-07-17 22:50:31,132 INFO L263 TraceCheckUtils]: 3: Hoare triple {774#true} call #t~ret3 := main(); {774#true} is VALID [2020-07-17 22:50:31,133 INFO L280 TraceCheckUtils]: 4: Hoare triple {774#true} havoc ~i~0;~j~0 := 10;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {778#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-17 22:50:31,134 INFO L280 TraceCheckUtils]: 5: Hoare triple {778#(<= (+ main_~i~0 9) main_~j~0)} assume !!(~i~0 <= ~n~0); {778#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-17 22:50:31,138 INFO L280 TraceCheckUtils]: 6: Hoare triple {778#(<= (+ main_~i~0 9) main_~j~0)} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {778#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-17 22:50:31,140 INFO L280 TraceCheckUtils]: 7: Hoare triple {778#(<= (+ main_~i~0 9) main_~j~0)} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {779#(<= (+ main_~i~0 8) main_~j~0)} is VALID [2020-07-17 22:50:31,141 INFO L280 TraceCheckUtils]: 8: Hoare triple {779#(<= (+ main_~i~0 8) main_~j~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {780#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-17 22:50:31,142 INFO L280 TraceCheckUtils]: 9: Hoare triple {780#(<= (+ main_~i~0 7) main_~j~0)} assume !!(~i~0 <= ~n~0); {780#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-17 22:50:31,142 INFO L280 TraceCheckUtils]: 10: Hoare triple {780#(<= (+ main_~i~0 7) main_~j~0)} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {780#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-17 22:50:31,143 INFO L280 TraceCheckUtils]: 11: Hoare triple {780#(<= (+ main_~i~0 7) main_~j~0)} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {781#(<= (+ main_~i~0 6) main_~j~0)} is VALID [2020-07-17 22:50:31,144 INFO L280 TraceCheckUtils]: 12: Hoare triple {781#(<= (+ main_~i~0 6) main_~j~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {782#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2020-07-17 22:50:31,146 INFO L280 TraceCheckUtils]: 13: Hoare triple {782#(<= (+ main_~i~0 5) main_~j~0)} assume !!(~i~0 <= ~n~0); {782#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2020-07-17 22:50:31,147 INFO L280 TraceCheckUtils]: 14: Hoare triple {782#(<= (+ main_~i~0 5) main_~j~0)} assume !(~i~0 < ~j~0); {775#false} is VALID [2020-07-17 22:50:31,148 INFO L280 TraceCheckUtils]: 15: Hoare triple {775#false} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {775#false} is VALID [2020-07-17 22:50:31,148 INFO L280 TraceCheckUtils]: 16: Hoare triple {775#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {775#false} is VALID [2020-07-17 22:50:31,148 INFO L280 TraceCheckUtils]: 17: Hoare triple {775#false} assume !(~i~0 <= ~n~0); {775#false} is VALID [2020-07-17 22:50:31,149 INFO L263 TraceCheckUtils]: 18: Hoare triple {775#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {775#false} is VALID [2020-07-17 22:50:31,149 INFO L280 TraceCheckUtils]: 19: Hoare triple {775#false} ~cond := #in~cond; {775#false} is VALID [2020-07-17 22:50:31,149 INFO L280 TraceCheckUtils]: 20: Hoare triple {775#false} assume 0 == ~cond; {775#false} is VALID [2020-07-17 22:50:31,149 INFO L280 TraceCheckUtils]: 21: Hoare triple {775#false} assume !false; {775#false} is VALID [2020-07-17 22:50:31,151 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:31,151 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892820657] [2020-07-17 22:50:31,152 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213200860] [2020-07-17 22:50:31,152 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:31,191 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-07-17 22:50:31,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:50:31,192 INFO L264 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-17 22:50:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:31,201 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:31,344 INFO L263 TraceCheckUtils]: 0: Hoare triple {774#true} call ULTIMATE.init(); {774#true} is VALID [2020-07-17 22:50:31,345 INFO L280 TraceCheckUtils]: 1: Hoare triple {774#true} assume true; {774#true} is VALID [2020-07-17 22:50:31,345 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {774#true} {774#true} #39#return; {774#true} is VALID [2020-07-17 22:50:31,345 INFO L263 TraceCheckUtils]: 3: Hoare triple {774#true} call #t~ret3 := main(); {774#true} is VALID [2020-07-17 22:50:31,347 INFO L280 TraceCheckUtils]: 4: Hoare triple {774#true} havoc ~i~0;~j~0 := 10;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {798#(and (<= 10 main_~j~0) (<= main_~i~0 1))} is VALID [2020-07-17 22:50:31,348 INFO L280 TraceCheckUtils]: 5: Hoare triple {798#(and (<= 10 main_~j~0) (<= main_~i~0 1))} assume !!(~i~0 <= ~n~0); {798#(and (<= 10 main_~j~0) (<= main_~i~0 1))} is VALID [2020-07-17 22:50:31,349 INFO L280 TraceCheckUtils]: 6: Hoare triple {798#(and (<= 10 main_~j~0) (<= main_~i~0 1))} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {798#(and (<= 10 main_~j~0) (<= main_~i~0 1))} is VALID [2020-07-17 22:50:31,350 INFO L280 TraceCheckUtils]: 7: Hoare triple {798#(and (<= 10 main_~j~0) (<= main_~i~0 1))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {808#(and (<= 9 main_~j~0) (<= main_~i~0 1))} is VALID [2020-07-17 22:50:31,352 INFO L280 TraceCheckUtils]: 8: Hoare triple {808#(and (<= 9 main_~j~0) (<= main_~i~0 1))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {812#(and (<= 9 main_~j~0) (<= main_~i~0 2))} is VALID [2020-07-17 22:50:31,353 INFO L280 TraceCheckUtils]: 9: Hoare triple {812#(and (<= 9 main_~j~0) (<= main_~i~0 2))} assume !!(~i~0 <= ~n~0); {812#(and (<= 9 main_~j~0) (<= main_~i~0 2))} is VALID [2020-07-17 22:50:31,355 INFO L280 TraceCheckUtils]: 10: Hoare triple {812#(and (<= 9 main_~j~0) (<= main_~i~0 2))} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {812#(and (<= 9 main_~j~0) (<= main_~i~0 2))} is VALID [2020-07-17 22:50:31,356 INFO L280 TraceCheckUtils]: 11: Hoare triple {812#(and (<= 9 main_~j~0) (<= main_~i~0 2))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {822#(and (<= main_~i~0 2) (<= 8 main_~j~0))} is VALID [2020-07-17 22:50:31,358 INFO L280 TraceCheckUtils]: 12: Hoare triple {822#(and (<= main_~i~0 2) (<= 8 main_~j~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {826#(and (<= main_~i~0 3) (<= 8 main_~j~0))} is VALID [2020-07-17 22:50:31,359 INFO L280 TraceCheckUtils]: 13: Hoare triple {826#(and (<= main_~i~0 3) (<= 8 main_~j~0))} assume !!(~i~0 <= ~n~0); {826#(and (<= main_~i~0 3) (<= 8 main_~j~0))} is VALID [2020-07-17 22:50:31,360 INFO L280 TraceCheckUtils]: 14: Hoare triple {826#(and (<= main_~i~0 3) (<= 8 main_~j~0))} assume !(~i~0 < ~j~0); {775#false} is VALID [2020-07-17 22:50:31,361 INFO L280 TraceCheckUtils]: 15: Hoare triple {775#false} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {775#false} is VALID [2020-07-17 22:50:31,361 INFO L280 TraceCheckUtils]: 16: Hoare triple {775#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {775#false} is VALID [2020-07-17 22:50:31,361 INFO L280 TraceCheckUtils]: 17: Hoare triple {775#false} assume !(~i~0 <= ~n~0); {775#false} is VALID [2020-07-17 22:50:31,362 INFO L263 TraceCheckUtils]: 18: Hoare triple {775#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {775#false} is VALID [2020-07-17 22:50:31,362 INFO L280 TraceCheckUtils]: 19: Hoare triple {775#false} ~cond := #in~cond; {775#false} is VALID [2020-07-17 22:50:31,362 INFO L280 TraceCheckUtils]: 20: Hoare triple {775#false} assume 0 == ~cond; {775#false} is VALID [2020-07-17 22:50:31,363 INFO L280 TraceCheckUtils]: 21: Hoare triple {775#false} assume !false; {775#false} is VALID [2020-07-17 22:50:31,364 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:31,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:50:31,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2020-07-17 22:50:31,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057677075] [2020-07-17 22:50:31,366 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-07-17 22:50:31,366 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:31,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-17 22:50:31,408 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:31,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-17 22:50:31,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:31,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-17 22:50:31,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2020-07-17 22:50:31,409 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2020-07-17 22:50:31,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:31,625 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2020-07-17 22:50:31,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:50:31,625 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-07-17 22:50:31,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:31,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-17 22:50:31,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. [2020-07-17 22:50:31,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-17 22:50:31,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. [2020-07-17 22:50:31,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 37 transitions. [2020-07-17 22:50:31,678 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:31,679 INFO L225 Difference]: With dead ends: 34 [2020-07-17 22:50:31,680 INFO L226 Difference]: Without dead ends: 25 [2020-07-17 22:50:31,681 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2020-07-17 22:50:31,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-17 22:50:31,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2020-07-17 22:50:31,702 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:31,702 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 24 states. [2020-07-17 22:50:31,702 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 24 states. [2020-07-17 22:50:31,702 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 24 states. [2020-07-17 22:50:31,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:31,704 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-07-17 22:50:31,705 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-17 22:50:31,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:31,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:31,705 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 25 states. [2020-07-17 22:50:31,706 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 25 states. [2020-07-17 22:50:31,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:31,707 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-07-17 22:50:31,708 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-17 22:50:31,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:31,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:31,709 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:31,709 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:31,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-17 22:50:31,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2020-07-17 22:50:31,711 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2020-07-17 22:50:31,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:31,711 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2020-07-17 22:50:31,711 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-17 22:50:31,711 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-17 22:50:31,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:50:31,712 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:31,712 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:31,916 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:31,917 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:31,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:31,918 INFO L82 PathProgramCache]: Analyzing trace with hash -971600090, now seen corresponding path program 2 times [2020-07-17 22:50:31,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:31,920 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576126566] [2020-07-17 22:50:31,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:31,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:32,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:32,342 INFO L280 TraceCheckUtils]: 0: Hoare triple {984#true} assume true; {984#true} is VALID [2020-07-17 22:50:32,343 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {984#true} {984#true} #39#return; {984#true} is VALID [2020-07-17 22:50:32,343 INFO L263 TraceCheckUtils]: 0: Hoare triple {984#true} call ULTIMATE.init(); {984#true} is VALID [2020-07-17 22:50:32,344 INFO L280 TraceCheckUtils]: 1: Hoare triple {984#true} assume true; {984#true} is VALID [2020-07-17 22:50:32,344 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {984#true} {984#true} #39#return; {984#true} is VALID [2020-07-17 22:50:32,345 INFO L263 TraceCheckUtils]: 3: Hoare triple {984#true} call #t~ret3 := main(); {984#true} is VALID [2020-07-17 22:50:32,349 INFO L280 TraceCheckUtils]: 4: Hoare triple {984#true} havoc ~i~0;~j~0 := 10;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {988#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-17 22:50:32,373 INFO L280 TraceCheckUtils]: 5: Hoare triple {988#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {988#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-17 22:50:32,376 INFO L280 TraceCheckUtils]: 6: Hoare triple {988#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {989#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} is VALID [2020-07-17 22:50:32,378 INFO L280 TraceCheckUtils]: 7: Hoare triple {989#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {989#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} is VALID [2020-07-17 22:50:32,380 INFO L280 TraceCheckUtils]: 8: Hoare triple {989#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {988#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-17 22:50:32,382 INFO L280 TraceCheckUtils]: 9: Hoare triple {988#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {988#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-17 22:50:32,384 INFO L280 TraceCheckUtils]: 10: Hoare triple {988#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {989#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} is VALID [2020-07-17 22:50:32,385 INFO L280 TraceCheckUtils]: 11: Hoare triple {989#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {989#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} is VALID [2020-07-17 22:50:32,387 INFO L280 TraceCheckUtils]: 12: Hoare triple {989#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {988#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-17 22:50:32,389 INFO L280 TraceCheckUtils]: 13: Hoare triple {988#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {990#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-17 22:50:32,393 INFO L280 TraceCheckUtils]: 14: Hoare triple {990#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {991#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} is VALID [2020-07-17 22:50:32,394 INFO L280 TraceCheckUtils]: 15: Hoare triple {991#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {991#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} is VALID [2020-07-17 22:50:32,397 INFO L280 TraceCheckUtils]: 16: Hoare triple {991#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {992#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} is VALID [2020-07-17 22:50:32,399 INFO L280 TraceCheckUtils]: 17: Hoare triple {992#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} assume !(~i~0 <= ~n~0); {993#(and (<= main_~sn~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~sn~0))} is VALID [2020-07-17 22:50:32,402 INFO L263 TraceCheckUtils]: 18: Hoare triple {993#(and (<= main_~sn~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {994#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:50:32,403 INFO L280 TraceCheckUtils]: 19: Hoare triple {994#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {995#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:50:32,405 INFO L280 TraceCheckUtils]: 20: Hoare triple {995#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {985#false} is VALID [2020-07-17 22:50:32,405 INFO L280 TraceCheckUtils]: 21: Hoare triple {985#false} assume !false; {985#false} is VALID [2020-07-17 22:50:32,408 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-17 22:50:32,409 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576126566] [2020-07-17 22:50:32,409 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695041671] [2020-07-17 22:50:32,409 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:32,478 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:50:32,479 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:50:32,480 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-17 22:50:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:32,497 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:32,882 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:50:32,959 INFO L263 TraceCheckUtils]: 0: Hoare triple {984#true} call ULTIMATE.init(); {984#true} is VALID [2020-07-17 22:50:32,959 INFO L280 TraceCheckUtils]: 1: Hoare triple {984#true} assume true; {984#true} is VALID [2020-07-17 22:50:32,960 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {984#true} {984#true} #39#return; {984#true} is VALID [2020-07-17 22:50:32,960 INFO L263 TraceCheckUtils]: 3: Hoare triple {984#true} call #t~ret3 := main(); {984#true} is VALID [2020-07-17 22:50:32,962 INFO L280 TraceCheckUtils]: 4: Hoare triple {984#true} havoc ~i~0;~j~0 := 10;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {1011#(and (= 1 main_~i~0) (= 0 main_~sn~0))} is VALID [2020-07-17 22:50:32,964 INFO L280 TraceCheckUtils]: 5: Hoare triple {1011#(and (= 1 main_~i~0) (= 0 main_~sn~0))} assume !!(~i~0 <= ~n~0); {1011#(and (= 1 main_~i~0) (= 0 main_~sn~0))} is VALID [2020-07-17 22:50:32,964 INFO L280 TraceCheckUtils]: 6: Hoare triple {1011#(and (= 1 main_~i~0) (= 0 main_~sn~0))} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {1018#(and (= 1 main_~i~0) (= 2 main_~sn~0))} is VALID [2020-07-17 22:50:32,966 INFO L280 TraceCheckUtils]: 7: Hoare triple {1018#(and (= 1 main_~i~0) (= 2 main_~sn~0))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1018#(and (= 1 main_~i~0) (= 2 main_~sn~0))} is VALID [2020-07-17 22:50:32,966 INFO L280 TraceCheckUtils]: 8: Hoare triple {1018#(and (= 1 main_~i~0) (= 2 main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1025#(and (= 2 main_~i~0) (= 2 main_~sn~0))} is VALID [2020-07-17 22:50:32,967 INFO L280 TraceCheckUtils]: 9: Hoare triple {1025#(and (= 2 main_~i~0) (= 2 main_~sn~0))} assume !!(~i~0 <= ~n~0); {1025#(and (= 2 main_~i~0) (= 2 main_~sn~0))} is VALID [2020-07-17 22:50:32,972 INFO L280 TraceCheckUtils]: 10: Hoare triple {1025#(and (= 2 main_~i~0) (= 2 main_~sn~0))} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {1032#(and (= 2 main_~i~0) (= 4 main_~sn~0))} is VALID [2020-07-17 22:50:32,973 INFO L280 TraceCheckUtils]: 11: Hoare triple {1032#(and (= 2 main_~i~0) (= 4 main_~sn~0))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1032#(and (= 2 main_~i~0) (= 4 main_~sn~0))} is VALID [2020-07-17 22:50:32,974 INFO L280 TraceCheckUtils]: 12: Hoare triple {1032#(and (= 2 main_~i~0) (= 4 main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1039#(and (= 3 main_~i~0) (= 4 main_~sn~0))} is VALID [2020-07-17 22:50:32,975 INFO L280 TraceCheckUtils]: 13: Hoare triple {1039#(and (= 3 main_~i~0) (= 4 main_~sn~0))} assume !!(~i~0 <= ~n~0); {1043#(and (= 3 main_~i~0) (= 4 main_~sn~0) (<= main_~i~0 main_~n~0))} is VALID [2020-07-17 22:50:32,976 INFO L280 TraceCheckUtils]: 14: Hoare triple {1043#(and (= 3 main_~i~0) (= 4 main_~sn~0) (<= main_~i~0 main_~n~0))} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {1047#(and (= 3 main_~i~0) (<= main_~i~0 main_~n~0) (= 6 main_~sn~0))} is VALID [2020-07-17 22:50:32,977 INFO L280 TraceCheckUtils]: 15: Hoare triple {1047#(and (= 3 main_~i~0) (<= main_~i~0 main_~n~0) (= 6 main_~sn~0))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1047#(and (= 3 main_~i~0) (<= main_~i~0 main_~n~0) (= 6 main_~sn~0))} is VALID [2020-07-17 22:50:32,979 INFO L280 TraceCheckUtils]: 16: Hoare triple {1047#(and (= 3 main_~i~0) (<= main_~i~0 main_~n~0) (= 6 main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1054#(and (<= main_~i~0 4) (= 6 main_~sn~0) (<= 3 main_~n~0))} is VALID [2020-07-17 22:50:32,980 INFO L280 TraceCheckUtils]: 17: Hoare triple {1054#(and (<= main_~i~0 4) (= 6 main_~sn~0) (<= 3 main_~n~0))} assume !(~i~0 <= ~n~0); {1058#(and (<= main_~n~0 3) (= 6 main_~sn~0) (<= 3 main_~n~0))} is VALID [2020-07-17 22:50:32,982 INFO L263 TraceCheckUtils]: 18: Hoare triple {1058#(and (<= main_~n~0 3) (= 6 main_~sn~0) (<= 3 main_~n~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1062#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:50:32,983 INFO L280 TraceCheckUtils]: 19: Hoare triple {1062#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1066#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:50:32,990 INFO L280 TraceCheckUtils]: 20: Hoare triple {1066#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {985#false} is VALID [2020-07-17 22:50:32,991 INFO L280 TraceCheckUtils]: 21: Hoare triple {985#false} assume !false; {985#false} is VALID [2020-07-17 22:50:32,992 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:32,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:50:32,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 21 [2020-07-17 22:50:32,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893426153] [2020-07-17 22:50:32,994 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 22 [2020-07-17 22:50:32,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:32,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2020-07-17 22:50:33,051 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:33,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-17 22:50:33,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:33,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-17 22:50:33,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2020-07-17 22:50:33,053 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 21 states. [2020-07-17 22:50:34,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:34,277 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2020-07-17 22:50:34,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-17 22:50:34,277 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 22 [2020-07-17 22:50:34,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:34,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-17 22:50:34,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 46 transitions. [2020-07-17 22:50:34,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-17 22:50:34,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 46 transitions. [2020-07-17 22:50:34,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 46 transitions. [2020-07-17 22:50:34,370 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:34,371 INFO L225 Difference]: With dead ends: 42 [2020-07-17 22:50:34,371 INFO L226 Difference]: Without dead ends: 36 [2020-07-17 22:50:34,373 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=163, Invalid=1027, Unknown=0, NotChecked=0, Total=1190 [2020-07-17 22:50:34,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-17 22:50:34,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2020-07-17 22:50:34,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:34,399 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 28 states. [2020-07-17 22:50:34,399 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 28 states. [2020-07-17 22:50:34,400 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 28 states. [2020-07-17 22:50:34,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:34,402 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2020-07-17 22:50:34,402 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2020-07-17 22:50:34,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:34,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:34,403 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 36 states. [2020-07-17 22:50:34,403 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 36 states. [2020-07-17 22:50:34,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:34,405 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2020-07-17 22:50:34,406 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2020-07-17 22:50:34,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:34,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:34,406 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:34,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:34,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-17 22:50:34,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2020-07-17 22:50:34,409 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 22 [2020-07-17 22:50:34,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:34,409 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2020-07-17 22:50:34,409 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-17 22:50:34,409 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-17 22:50:34,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-17 22:50:34,411 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:34,411 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:34,626 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:34,627 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:34,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:34,629 INFO L82 PathProgramCache]: Analyzing trace with hash -131462049, now seen corresponding path program 4 times [2020-07-17 22:50:34,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:34,630 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338998073] [2020-07-17 22:50:34,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:34,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:34,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:34,795 INFO L280 TraceCheckUtils]: 0: Hoare triple {1268#true} assume true; {1268#true} is VALID [2020-07-17 22:50:34,796 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1268#true} {1268#true} #39#return; {1268#true} is VALID [2020-07-17 22:50:34,796 INFO L263 TraceCheckUtils]: 0: Hoare triple {1268#true} call ULTIMATE.init(); {1268#true} is VALID [2020-07-17 22:50:34,797 INFO L280 TraceCheckUtils]: 1: Hoare triple {1268#true} assume true; {1268#true} is VALID [2020-07-17 22:50:34,797 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1268#true} {1268#true} #39#return; {1268#true} is VALID [2020-07-17 22:50:34,797 INFO L263 TraceCheckUtils]: 3: Hoare triple {1268#true} call #t~ret3 := main(); {1268#true} is VALID [2020-07-17 22:50:34,798 INFO L280 TraceCheckUtils]: 4: Hoare triple {1268#true} havoc ~i~0;~j~0 := 10;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {1272#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-17 22:50:34,799 INFO L280 TraceCheckUtils]: 5: Hoare triple {1272#(<= (+ main_~i~0 9) main_~j~0)} assume !!(~i~0 <= ~n~0); {1272#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-17 22:50:34,800 INFO L280 TraceCheckUtils]: 6: Hoare triple {1272#(<= (+ main_~i~0 9) main_~j~0)} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {1272#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-17 22:50:34,801 INFO L280 TraceCheckUtils]: 7: Hoare triple {1272#(<= (+ main_~i~0 9) main_~j~0)} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1273#(<= (+ main_~i~0 8) main_~j~0)} is VALID [2020-07-17 22:50:34,803 INFO L280 TraceCheckUtils]: 8: Hoare triple {1273#(<= (+ main_~i~0 8) main_~j~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1274#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-17 22:50:34,803 INFO L280 TraceCheckUtils]: 9: Hoare triple {1274#(<= (+ main_~i~0 7) main_~j~0)} assume !!(~i~0 <= ~n~0); {1274#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-17 22:50:34,804 INFO L280 TraceCheckUtils]: 10: Hoare triple {1274#(<= (+ main_~i~0 7) main_~j~0)} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {1274#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-17 22:50:34,805 INFO L280 TraceCheckUtils]: 11: Hoare triple {1274#(<= (+ main_~i~0 7) main_~j~0)} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1275#(<= (+ main_~i~0 6) main_~j~0)} is VALID [2020-07-17 22:50:34,806 INFO L280 TraceCheckUtils]: 12: Hoare triple {1275#(<= (+ main_~i~0 6) main_~j~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1276#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2020-07-17 22:50:34,807 INFO L280 TraceCheckUtils]: 13: Hoare triple {1276#(<= (+ main_~i~0 5) main_~j~0)} assume !!(~i~0 <= ~n~0); {1276#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2020-07-17 22:50:34,808 INFO L280 TraceCheckUtils]: 14: Hoare triple {1276#(<= (+ main_~i~0 5) main_~j~0)} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {1276#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2020-07-17 22:50:34,809 INFO L280 TraceCheckUtils]: 15: Hoare triple {1276#(<= (+ main_~i~0 5) main_~j~0)} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1277#(<= (+ main_~i~0 4) main_~j~0)} is VALID [2020-07-17 22:50:34,810 INFO L280 TraceCheckUtils]: 16: Hoare triple {1277#(<= (+ main_~i~0 4) main_~j~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1278#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2020-07-17 22:50:34,811 INFO L280 TraceCheckUtils]: 17: Hoare triple {1278#(<= (+ main_~i~0 3) main_~j~0)} assume !!(~i~0 <= ~n~0); {1278#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2020-07-17 22:50:34,812 INFO L280 TraceCheckUtils]: 18: Hoare triple {1278#(<= (+ main_~i~0 3) main_~j~0)} assume !(~i~0 < ~j~0); {1269#false} is VALID [2020-07-17 22:50:34,813 INFO L280 TraceCheckUtils]: 19: Hoare triple {1269#false} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1269#false} is VALID [2020-07-17 22:50:34,813 INFO L280 TraceCheckUtils]: 20: Hoare triple {1269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1269#false} is VALID [2020-07-17 22:50:34,813 INFO L280 TraceCheckUtils]: 21: Hoare triple {1269#false} assume !(~i~0 <= ~n~0); {1269#false} is VALID [2020-07-17 22:50:34,813 INFO L263 TraceCheckUtils]: 22: Hoare triple {1269#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1269#false} is VALID [2020-07-17 22:50:34,814 INFO L280 TraceCheckUtils]: 23: Hoare triple {1269#false} ~cond := #in~cond; {1269#false} is VALID [2020-07-17 22:50:34,814 INFO L280 TraceCheckUtils]: 24: Hoare triple {1269#false} assume 0 == ~cond; {1269#false} is VALID [2020-07-17 22:50:34,814 INFO L280 TraceCheckUtils]: 25: Hoare triple {1269#false} assume !false; {1269#false} is VALID [2020-07-17 22:50:34,815 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:34,816 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338998073] [2020-07-17 22:50:34,816 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329983492] [2020-07-17 22:50:34,816 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:34,859 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-17 22:50:34,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:50:34,860 INFO L264 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-17 22:50:34,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:34,868 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:35,066 INFO L263 TraceCheckUtils]: 0: Hoare triple {1268#true} call ULTIMATE.init(); {1268#true} is VALID [2020-07-17 22:50:35,067 INFO L280 TraceCheckUtils]: 1: Hoare triple {1268#true} assume true; {1268#true} is VALID [2020-07-17 22:50:35,067 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1268#true} {1268#true} #39#return; {1268#true} is VALID [2020-07-17 22:50:35,067 INFO L263 TraceCheckUtils]: 3: Hoare triple {1268#true} call #t~ret3 := main(); {1268#true} is VALID [2020-07-17 22:50:35,068 INFO L280 TraceCheckUtils]: 4: Hoare triple {1268#true} havoc ~i~0;~j~0 := 10;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {1294#(and (<= 10 main_~j~0) (<= main_~i~0 1))} is VALID [2020-07-17 22:50:35,069 INFO L280 TraceCheckUtils]: 5: Hoare triple {1294#(and (<= 10 main_~j~0) (<= main_~i~0 1))} assume !!(~i~0 <= ~n~0); {1294#(and (<= 10 main_~j~0) (<= main_~i~0 1))} is VALID [2020-07-17 22:50:35,069 INFO L280 TraceCheckUtils]: 6: Hoare triple {1294#(and (<= 10 main_~j~0) (<= main_~i~0 1))} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {1294#(and (<= 10 main_~j~0) (<= main_~i~0 1))} is VALID [2020-07-17 22:50:35,070 INFO L280 TraceCheckUtils]: 7: Hoare triple {1294#(and (<= 10 main_~j~0) (<= main_~i~0 1))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1304#(and (<= 9 main_~j~0) (<= main_~i~0 1))} is VALID [2020-07-17 22:50:35,071 INFO L280 TraceCheckUtils]: 8: Hoare triple {1304#(and (<= 9 main_~j~0) (<= main_~i~0 1))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1308#(and (<= 9 main_~j~0) (<= main_~i~0 2))} is VALID [2020-07-17 22:50:35,072 INFO L280 TraceCheckUtils]: 9: Hoare triple {1308#(and (<= 9 main_~j~0) (<= main_~i~0 2))} assume !!(~i~0 <= ~n~0); {1308#(and (<= 9 main_~j~0) (<= main_~i~0 2))} is VALID [2020-07-17 22:50:35,072 INFO L280 TraceCheckUtils]: 10: Hoare triple {1308#(and (<= 9 main_~j~0) (<= main_~i~0 2))} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {1308#(and (<= 9 main_~j~0) (<= main_~i~0 2))} is VALID [2020-07-17 22:50:35,073 INFO L280 TraceCheckUtils]: 11: Hoare triple {1308#(and (<= 9 main_~j~0) (<= main_~i~0 2))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1318#(and (<= main_~i~0 2) (<= 8 main_~j~0))} is VALID [2020-07-17 22:50:35,074 INFO L280 TraceCheckUtils]: 12: Hoare triple {1318#(and (<= main_~i~0 2) (<= 8 main_~j~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1322#(and (<= main_~i~0 3) (<= 8 main_~j~0))} is VALID [2020-07-17 22:50:35,074 INFO L280 TraceCheckUtils]: 13: Hoare triple {1322#(and (<= main_~i~0 3) (<= 8 main_~j~0))} assume !!(~i~0 <= ~n~0); {1322#(and (<= main_~i~0 3) (<= 8 main_~j~0))} is VALID [2020-07-17 22:50:35,075 INFO L280 TraceCheckUtils]: 14: Hoare triple {1322#(and (<= main_~i~0 3) (<= 8 main_~j~0))} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {1322#(and (<= main_~i~0 3) (<= 8 main_~j~0))} is VALID [2020-07-17 22:50:35,076 INFO L280 TraceCheckUtils]: 15: Hoare triple {1322#(and (<= main_~i~0 3) (<= 8 main_~j~0))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1332#(and (<= main_~i~0 3) (<= 7 main_~j~0))} is VALID [2020-07-17 22:50:35,077 INFO L280 TraceCheckUtils]: 16: Hoare triple {1332#(and (<= main_~i~0 3) (<= 7 main_~j~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1336#(and (<= main_~i~0 4) (<= 7 main_~j~0))} is VALID [2020-07-17 22:50:35,077 INFO L280 TraceCheckUtils]: 17: Hoare triple {1336#(and (<= main_~i~0 4) (<= 7 main_~j~0))} assume !!(~i~0 <= ~n~0); {1336#(and (<= main_~i~0 4) (<= 7 main_~j~0))} is VALID [2020-07-17 22:50:35,078 INFO L280 TraceCheckUtils]: 18: Hoare triple {1336#(and (<= main_~i~0 4) (<= 7 main_~j~0))} assume !(~i~0 < ~j~0); {1269#false} is VALID [2020-07-17 22:50:35,079 INFO L280 TraceCheckUtils]: 19: Hoare triple {1269#false} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1269#false} is VALID [2020-07-17 22:50:35,079 INFO L280 TraceCheckUtils]: 20: Hoare triple {1269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1269#false} is VALID [2020-07-17 22:50:35,079 INFO L280 TraceCheckUtils]: 21: Hoare triple {1269#false} assume !(~i~0 <= ~n~0); {1269#false} is VALID [2020-07-17 22:50:35,079 INFO L263 TraceCheckUtils]: 22: Hoare triple {1269#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1269#false} is VALID [2020-07-17 22:50:35,080 INFO L280 TraceCheckUtils]: 23: Hoare triple {1269#false} ~cond := #in~cond; {1269#false} is VALID [2020-07-17 22:50:35,080 INFO L280 TraceCheckUtils]: 24: Hoare triple {1269#false} assume 0 == ~cond; {1269#false} is VALID [2020-07-17 22:50:35,080 INFO L280 TraceCheckUtils]: 25: Hoare triple {1269#false} assume !false; {1269#false} is VALID [2020-07-17 22:50:35,081 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:35,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:50:35,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2020-07-17 22:50:35,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636264844] [2020-07-17 22:50:35,083 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2020-07-17 22:50:35,083 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:35,083 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-17 22:50:35,137 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:35,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-17 22:50:35,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:35,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-17 22:50:35,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2020-07-17 22:50:35,139 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 16 states. [2020-07-17 22:50:35,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:35,470 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2020-07-17 22:50:35,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-17 22:50:35,471 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2020-07-17 22:50:35,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:35,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-17 22:50:35,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2020-07-17 22:50:35,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-17 22:50:35,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2020-07-17 22:50:35,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 41 transitions. [2020-07-17 22:50:35,531 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:35,532 INFO L225 Difference]: With dead ends: 42 [2020-07-17 22:50:35,532 INFO L226 Difference]: Without dead ends: 33 [2020-07-17 22:50:35,533 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2020-07-17 22:50:35,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-17 22:50:35,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2020-07-17 22:50:35,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:35,556 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 32 states. [2020-07-17 22:50:35,556 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 32 states. [2020-07-17 22:50:35,557 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 32 states. [2020-07-17 22:50:35,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:35,559 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2020-07-17 22:50:35,559 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2020-07-17 22:50:35,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:35,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:35,561 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 33 states. [2020-07-17 22:50:35,564 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 33 states. [2020-07-17 22:50:35,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:35,568 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2020-07-17 22:50:35,568 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2020-07-17 22:50:35,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:35,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:35,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:35,569 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:35,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-17 22:50:35,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2020-07-17 22:50:35,570 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 26 [2020-07-17 22:50:35,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:35,571 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2020-07-17 22:50:35,571 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-17 22:50:35,571 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-17 22:50:35,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-17 22:50:35,572 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:35,572 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:35,774 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:35,775 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:35,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:35,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1107887526, now seen corresponding path program 5 times [2020-07-17 22:50:35,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:35,777 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762407566] [2020-07-17 22:50:35,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:35,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:35,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:35,954 INFO L280 TraceCheckUtils]: 0: Hoare triple {1530#true} assume true; {1530#true} is VALID [2020-07-17 22:50:35,954 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1530#true} {1530#true} #39#return; {1530#true} is VALID [2020-07-17 22:50:35,955 INFO L263 TraceCheckUtils]: 0: Hoare triple {1530#true} call ULTIMATE.init(); {1530#true} is VALID [2020-07-17 22:50:35,955 INFO L280 TraceCheckUtils]: 1: Hoare triple {1530#true} assume true; {1530#true} is VALID [2020-07-17 22:50:35,955 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1530#true} {1530#true} #39#return; {1530#true} is VALID [2020-07-17 22:50:35,955 INFO L263 TraceCheckUtils]: 3: Hoare triple {1530#true} call #t~ret3 := main(); {1530#true} is VALID [2020-07-17 22:50:35,956 INFO L280 TraceCheckUtils]: 4: Hoare triple {1530#true} havoc ~i~0;~j~0 := 10;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {1534#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-17 22:50:35,957 INFO L280 TraceCheckUtils]: 5: Hoare triple {1534#(<= (+ main_~i~0 9) main_~j~0)} assume !!(~i~0 <= ~n~0); {1534#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-17 22:50:35,958 INFO L280 TraceCheckUtils]: 6: Hoare triple {1534#(<= (+ main_~i~0 9) main_~j~0)} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {1534#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-17 22:50:35,959 INFO L280 TraceCheckUtils]: 7: Hoare triple {1534#(<= (+ main_~i~0 9) main_~j~0)} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1535#(<= (+ main_~i~0 8) main_~j~0)} is VALID [2020-07-17 22:50:35,960 INFO L280 TraceCheckUtils]: 8: Hoare triple {1535#(<= (+ main_~i~0 8) main_~j~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1536#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-17 22:50:35,961 INFO L280 TraceCheckUtils]: 9: Hoare triple {1536#(<= (+ main_~i~0 7) main_~j~0)} assume !!(~i~0 <= ~n~0); {1536#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-17 22:50:35,962 INFO L280 TraceCheckUtils]: 10: Hoare triple {1536#(<= (+ main_~i~0 7) main_~j~0)} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {1536#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-17 22:50:35,963 INFO L280 TraceCheckUtils]: 11: Hoare triple {1536#(<= (+ main_~i~0 7) main_~j~0)} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1537#(<= (+ main_~i~0 6) main_~j~0)} is VALID [2020-07-17 22:50:35,964 INFO L280 TraceCheckUtils]: 12: Hoare triple {1537#(<= (+ main_~i~0 6) main_~j~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1538#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2020-07-17 22:50:35,965 INFO L280 TraceCheckUtils]: 13: Hoare triple {1538#(<= (+ main_~i~0 5) main_~j~0)} assume !!(~i~0 <= ~n~0); {1538#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2020-07-17 22:50:35,966 INFO L280 TraceCheckUtils]: 14: Hoare triple {1538#(<= (+ main_~i~0 5) main_~j~0)} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {1538#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2020-07-17 22:50:35,967 INFO L280 TraceCheckUtils]: 15: Hoare triple {1538#(<= (+ main_~i~0 5) main_~j~0)} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1539#(<= (+ main_~i~0 4) main_~j~0)} is VALID [2020-07-17 22:50:35,968 INFO L280 TraceCheckUtils]: 16: Hoare triple {1539#(<= (+ main_~i~0 4) main_~j~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1540#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2020-07-17 22:50:35,969 INFO L280 TraceCheckUtils]: 17: Hoare triple {1540#(<= (+ main_~i~0 3) main_~j~0)} assume !!(~i~0 <= ~n~0); {1540#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2020-07-17 22:50:35,970 INFO L280 TraceCheckUtils]: 18: Hoare triple {1540#(<= (+ main_~i~0 3) main_~j~0)} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {1540#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2020-07-17 22:50:35,971 INFO L280 TraceCheckUtils]: 19: Hoare triple {1540#(<= (+ main_~i~0 3) main_~j~0)} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1541#(<= (+ main_~i~0 2) main_~j~0)} is VALID [2020-07-17 22:50:35,972 INFO L280 TraceCheckUtils]: 20: Hoare triple {1541#(<= (+ main_~i~0 2) main_~j~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1542#(<= (+ main_~i~0 1) main_~j~0)} is VALID [2020-07-17 22:50:35,973 INFO L280 TraceCheckUtils]: 21: Hoare triple {1542#(<= (+ main_~i~0 1) main_~j~0)} assume !!(~i~0 <= ~n~0); {1542#(<= (+ main_~i~0 1) main_~j~0)} is VALID [2020-07-17 22:50:35,974 INFO L280 TraceCheckUtils]: 22: Hoare triple {1542#(<= (+ main_~i~0 1) main_~j~0)} assume !(~i~0 < ~j~0); {1531#false} is VALID [2020-07-17 22:50:35,975 INFO L280 TraceCheckUtils]: 23: Hoare triple {1531#false} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1531#false} is VALID [2020-07-17 22:50:35,975 INFO L280 TraceCheckUtils]: 24: Hoare triple {1531#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1531#false} is VALID [2020-07-17 22:50:35,975 INFO L280 TraceCheckUtils]: 25: Hoare triple {1531#false} assume !(~i~0 <= ~n~0); {1531#false} is VALID [2020-07-17 22:50:35,975 INFO L263 TraceCheckUtils]: 26: Hoare triple {1531#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1531#false} is VALID [2020-07-17 22:50:35,975 INFO L280 TraceCheckUtils]: 27: Hoare triple {1531#false} ~cond := #in~cond; {1531#false} is VALID [2020-07-17 22:50:35,976 INFO L280 TraceCheckUtils]: 28: Hoare triple {1531#false} assume 0 == ~cond; {1531#false} is VALID [2020-07-17 22:50:35,976 INFO L280 TraceCheckUtils]: 29: Hoare triple {1531#false} assume !false; {1531#false} is VALID [2020-07-17 22:50:35,977 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 13 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:35,978 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762407566] [2020-07-17 22:50:35,978 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852930366] [2020-07-17 22:50:35,978 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:36,008 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-07-17 22:50:36,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:50:36,009 INFO L264 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-17 22:50:36,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:36,024 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:36,280 INFO L263 TraceCheckUtils]: 0: Hoare triple {1530#true} call ULTIMATE.init(); {1530#true} is VALID [2020-07-17 22:50:36,280 INFO L280 TraceCheckUtils]: 1: Hoare triple {1530#true} assume true; {1530#true} is VALID [2020-07-17 22:50:36,280 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1530#true} {1530#true} #39#return; {1530#true} is VALID [2020-07-17 22:50:36,280 INFO L263 TraceCheckUtils]: 3: Hoare triple {1530#true} call #t~ret3 := main(); {1530#true} is VALID [2020-07-17 22:50:36,281 INFO L280 TraceCheckUtils]: 4: Hoare triple {1530#true} havoc ~i~0;~j~0 := 10;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {1558#(and (<= 10 main_~j~0) (<= main_~i~0 1))} is VALID [2020-07-17 22:50:36,282 INFO L280 TraceCheckUtils]: 5: Hoare triple {1558#(and (<= 10 main_~j~0) (<= main_~i~0 1))} assume !!(~i~0 <= ~n~0); {1558#(and (<= 10 main_~j~0) (<= main_~i~0 1))} is VALID [2020-07-17 22:50:36,282 INFO L280 TraceCheckUtils]: 6: Hoare triple {1558#(and (<= 10 main_~j~0) (<= main_~i~0 1))} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {1558#(and (<= 10 main_~j~0) (<= main_~i~0 1))} is VALID [2020-07-17 22:50:36,283 INFO L280 TraceCheckUtils]: 7: Hoare triple {1558#(and (<= 10 main_~j~0) (<= main_~i~0 1))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1568#(and (<= 9 main_~j~0) (<= main_~i~0 1))} is VALID [2020-07-17 22:50:36,284 INFO L280 TraceCheckUtils]: 8: Hoare triple {1568#(and (<= 9 main_~j~0) (<= main_~i~0 1))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1572#(and (<= 9 main_~j~0) (<= main_~i~0 2))} is VALID [2020-07-17 22:50:36,284 INFO L280 TraceCheckUtils]: 9: Hoare triple {1572#(and (<= 9 main_~j~0) (<= main_~i~0 2))} assume !!(~i~0 <= ~n~0); {1572#(and (<= 9 main_~j~0) (<= main_~i~0 2))} is VALID [2020-07-17 22:50:36,285 INFO L280 TraceCheckUtils]: 10: Hoare triple {1572#(and (<= 9 main_~j~0) (<= main_~i~0 2))} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {1572#(and (<= 9 main_~j~0) (<= main_~i~0 2))} is VALID [2020-07-17 22:50:36,285 INFO L280 TraceCheckUtils]: 11: Hoare triple {1572#(and (<= 9 main_~j~0) (<= main_~i~0 2))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1582#(and (<= main_~i~0 2) (<= 8 main_~j~0))} is VALID [2020-07-17 22:50:36,286 INFO L280 TraceCheckUtils]: 12: Hoare triple {1582#(and (<= main_~i~0 2) (<= 8 main_~j~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1586#(and (<= main_~i~0 3) (<= 8 main_~j~0))} is VALID [2020-07-17 22:50:36,287 INFO L280 TraceCheckUtils]: 13: Hoare triple {1586#(and (<= main_~i~0 3) (<= 8 main_~j~0))} assume !!(~i~0 <= ~n~0); {1586#(and (<= main_~i~0 3) (<= 8 main_~j~0))} is VALID [2020-07-17 22:50:36,287 INFO L280 TraceCheckUtils]: 14: Hoare triple {1586#(and (<= main_~i~0 3) (<= 8 main_~j~0))} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {1586#(and (<= main_~i~0 3) (<= 8 main_~j~0))} is VALID [2020-07-17 22:50:36,288 INFO L280 TraceCheckUtils]: 15: Hoare triple {1586#(and (<= main_~i~0 3) (<= 8 main_~j~0))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1596#(and (<= main_~i~0 3) (<= 7 main_~j~0))} is VALID [2020-07-17 22:50:36,290 INFO L280 TraceCheckUtils]: 16: Hoare triple {1596#(and (<= main_~i~0 3) (<= 7 main_~j~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1600#(and (<= main_~i~0 4) (<= 7 main_~j~0))} is VALID [2020-07-17 22:50:36,291 INFO L280 TraceCheckUtils]: 17: Hoare triple {1600#(and (<= main_~i~0 4) (<= 7 main_~j~0))} assume !!(~i~0 <= ~n~0); {1600#(and (<= main_~i~0 4) (<= 7 main_~j~0))} is VALID [2020-07-17 22:50:36,292 INFO L280 TraceCheckUtils]: 18: Hoare triple {1600#(and (<= main_~i~0 4) (<= 7 main_~j~0))} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {1600#(and (<= main_~i~0 4) (<= 7 main_~j~0))} is VALID [2020-07-17 22:50:36,293 INFO L280 TraceCheckUtils]: 19: Hoare triple {1600#(and (<= main_~i~0 4) (<= 7 main_~j~0))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1610#(and (<= main_~i~0 4) (<= 6 main_~j~0))} is VALID [2020-07-17 22:50:36,294 INFO L280 TraceCheckUtils]: 20: Hoare triple {1610#(and (<= main_~i~0 4) (<= 6 main_~j~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1614#(and (<= main_~i~0 5) (<= 6 main_~j~0))} is VALID [2020-07-17 22:50:36,295 INFO L280 TraceCheckUtils]: 21: Hoare triple {1614#(and (<= main_~i~0 5) (<= 6 main_~j~0))} assume !!(~i~0 <= ~n~0); {1614#(and (<= main_~i~0 5) (<= 6 main_~j~0))} is VALID [2020-07-17 22:50:36,295 INFO L280 TraceCheckUtils]: 22: Hoare triple {1614#(and (<= main_~i~0 5) (<= 6 main_~j~0))} assume !(~i~0 < ~j~0); {1531#false} is VALID [2020-07-17 22:50:36,296 INFO L280 TraceCheckUtils]: 23: Hoare triple {1531#false} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1531#false} is VALID [2020-07-17 22:50:36,296 INFO L280 TraceCheckUtils]: 24: Hoare triple {1531#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1531#false} is VALID [2020-07-17 22:50:36,296 INFO L280 TraceCheckUtils]: 25: Hoare triple {1531#false} assume !(~i~0 <= ~n~0); {1531#false} is VALID [2020-07-17 22:50:36,296 INFO L263 TraceCheckUtils]: 26: Hoare triple {1531#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1531#false} is VALID [2020-07-17 22:50:36,297 INFO L280 TraceCheckUtils]: 27: Hoare triple {1531#false} ~cond := #in~cond; {1531#false} is VALID [2020-07-17 22:50:36,297 INFO L280 TraceCheckUtils]: 28: Hoare triple {1531#false} assume 0 == ~cond; {1531#false} is VALID [2020-07-17 22:50:36,297 INFO L280 TraceCheckUtils]: 29: Hoare triple {1531#false} assume !false; {1531#false} is VALID [2020-07-17 22:50:36,299 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 13 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:36,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:50:36,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2020-07-17 22:50:36,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633261579] [2020-07-17 22:50:36,301 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2020-07-17 22:50:36,301 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:36,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2020-07-17 22:50:36,371 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:36,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-17 22:50:36,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:36,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-17 22:50:36,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2020-07-17 22:50:36,372 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 20 states. [2020-07-17 22:50:36,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:36,658 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2020-07-17 22:50:36,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-17 22:50:36,658 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2020-07-17 22:50:36,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:36,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-17 22:50:36,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 46 transitions. [2020-07-17 22:50:36,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-17 22:50:36,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 46 transitions. [2020-07-17 22:50:36,663 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 46 transitions. [2020-07-17 22:50:36,733 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:36,734 INFO L225 Difference]: With dead ends: 47 [2020-07-17 22:50:36,735 INFO L226 Difference]: Without dead ends: 38 [2020-07-17 22:50:36,736 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2020-07-17 22:50:36,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-17 22:50:36,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2020-07-17 22:50:36,764 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:36,764 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 36 states. [2020-07-17 22:50:36,764 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 36 states. [2020-07-17 22:50:36,764 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 36 states. [2020-07-17 22:50:36,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:36,776 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2020-07-17 22:50:36,776 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2020-07-17 22:50:36,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:36,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:36,777 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 38 states. [2020-07-17 22:50:36,777 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 38 states. [2020-07-17 22:50:36,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:36,783 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2020-07-17 22:50:36,783 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2020-07-17 22:50:36,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:36,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:36,784 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:36,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:36,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-17 22:50:36,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2020-07-17 22:50:36,785 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 30 [2020-07-17 22:50:36,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:36,786 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2020-07-17 22:50:36,786 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-17 22:50:36,786 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2020-07-17 22:50:36,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-17 22:50:36,790 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:36,790 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:37,004 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:37,005 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:37,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:37,005 INFO L82 PathProgramCache]: Analyzing trace with hash -682200363, now seen corresponding path program 6 times [2020-07-17 22:50:37,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:37,006 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853108235] [2020-07-17 22:50:37,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:50:37,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:50:37,093 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 22:50:37,093 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 22:50:37,094 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-17 22:50:37,129 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:50:37,129 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:50:37,130 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:50:37,130 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:50:37,130 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-17 22:50:37,130 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:50:37,130 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:50:37,130 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:50:37,130 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-17 22:50:37,131 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-17 22:50:37,131 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-17 22:50:37,131 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:50:37,131 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:50:37,131 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:50:37,131 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2020-07-17 22:50:37,131 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2020-07-17 22:50:37,131 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-17 22:50:37,131 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-17 22:50:37,132 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-17 22:50:37,132 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-17 22:50:37,132 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-17 22:50:37,132 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:50:37,132 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2020-07-17 22:50:37,132 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:50:37,132 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:50:37,132 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2020-07-17 22:50:37,133 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:50:37,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:50:37 BoogieIcfgContainer [2020-07-17 22:50:37,135 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:50:37,139 INFO L168 Benchmark]: Toolchain (without parser) took 10978.00 ms. Allocated memory was 144.7 MB in the beginning and 309.3 MB in the end (delta: 164.6 MB). Free memory was 101.8 MB in the beginning and 269.5 MB in the end (delta: -167.7 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-17 22:50:37,140 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 144.7 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-17 22:50:37,141 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.93 ms. Allocated memory is still 144.7 MB. Free memory was 101.3 MB in the beginning and 91.7 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:37,141 INFO L168 Benchmark]: Boogie Preprocessor took 130.49 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 91.7 MB in the beginning and 180.5 MB in the end (delta: -88.7 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:37,142 INFO L168 Benchmark]: RCFGBuilder took 360.22 ms. Allocated memory is still 201.3 MB. Free memory was 179.8 MB in the beginning and 163.9 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:37,142 INFO L168 Benchmark]: TraceAbstraction took 10166.21 ms. Allocated memory was 201.3 MB in the beginning and 309.3 MB in the end (delta: 108.0 MB). Free memory was 163.9 MB in the beginning and 269.5 MB in the end (delta: -105.6 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:37,145 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33 ms. Allocated memory is still 144.7 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 309.93 ms. Allocated memory is still 144.7 MB. Free memory was 101.3 MB in the beginning and 91.7 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 130.49 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 91.7 MB in the beginning and 180.5 MB in the end (delta: -88.7 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 360.22 ms. Allocated memory is still 201.3 MB. Free memory was 179.8 MB in the beginning and 163.9 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10166.21 ms. Allocated memory was 201.3 MB in the beginning and 309.3 MB in the end (delta: 108.0 MB). Free memory was 163.9 MB in the beginning and 269.5 MB in the end (delta: -105.6 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int i, j=10, n=__VERIFIER_nondet_uint(), sn=0; [L12] int i, j=10, n=__VERIFIER_nondet_uint(), sn=0; [L13] i=1 VAL [i=1, j=10, n=6, n=0] [L13] COND TRUE i<=n VAL [i=1, j=10, n=0, n=6] [L14] COND TRUE i