/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loops/sum01_bug02.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 02:27:50,604 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 02:27:50,607 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 02:27:50,626 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 02:27:50,626 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 02:27:50,628 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 02:27:50,631 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 02:27:50,641 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 02:27:50,645 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 02:27:50,648 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 02:27:50,650 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 02:27:50,653 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 02:27:50,653 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 02:27:50,655 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 02:27:50,657 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 02:27:50,659 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 02:27:50,660 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 02:27:50,661 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 02:27:50,663 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 02:27:50,668 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 02:27:50,673 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 02:27:50,676 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 02:27:50,678 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 02:27:50,678 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 02:27:50,681 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 02:27:50,681 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 02:27:50,681 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 02:27:50,683 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 02:27:50,684 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 02:27:50,685 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 02:27:50,685 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 02:27:50,686 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 02:27:50,687 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 02:27:50,688 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 02:27:50,689 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 02:27:50,689 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 02:27:50,690 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 02:27:50,690 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 02:27:50,690 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 02:27:50,691 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 02:27:50,692 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 02:27:50,693 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 02:27:50,710 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 02:27:50,710 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 02:27:50,713 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 02:27:50,714 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 02:27:50,714 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 02:27:50,714 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 02:27:50,714 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 02:27:50,715 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 02:27:50,715 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 02:27:50,715 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 02:27:50,715 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 02:27:50,719 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 02:27:50,720 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 02:27:50,720 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 02:27:50,720 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 02:27:50,720 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 02:27:50,721 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 02:27:50,721 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 02:27:50,721 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 02:27:50,721 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 02:27:50,722 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 02:27:50,722 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 02:27:50,722 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 02:27:51,038 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 02:27:51,056 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 02:27:51,060 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 02:27:51,062 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 02:27:51,062 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 02:27:51,062 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-11 02:27:51,142 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/880e904e1/5ad76507f1d641a6ae849a84cc8bc265/FLAGc150a7dcb [2020-07-11 02:27:51,671 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 02:27:51,672 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01_bug02.i [2020-07-11 02:27:51,678 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/880e904e1/5ad76507f1d641a6ae849a84cc8bc265/FLAGc150a7dcb [2020-07-11 02:27:52,030 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/880e904e1/5ad76507f1d641a6ae849a84cc8bc265 [2020-07-11 02:27:52,039 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 02:27:52,041 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 02:27:52,042 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 02:27:52,043 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 02:27:52,048 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 02:27:52,050 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:27:52" (1/1) ... [2020-07-11 02:27:52,054 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bea63f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:52, skipping insertion in model container [2020-07-11 02:27:52,054 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:27:52" (1/1) ... [2020-07-11 02:27:52,063 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 02:27:52,082 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 02:27:52,251 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:27:52,256 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 02:27:52,273 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:27:52,288 INFO L208 MainTranslator]: Completed translation [2020-07-11 02:27:52,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:52 WrapperNode [2020-07-11 02:27:52,289 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 02:27:52,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 02:27:52,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 02:27:52,290 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 02:27:52,303 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:52" (1/1) ... [2020-07-11 02:27:52,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:52" (1/1) ... [2020-07-11 02:27:52,307 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:52" (1/1) ... [2020-07-11 02:27:52,308 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:52" (1/1) ... [2020-07-11 02:27:52,312 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:52" (1/1) ... [2020-07-11 02:27:52,318 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:52" (1/1) ... [2020-07-11 02:27:52,319 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:52" (1/1) ... [2020-07-11 02:27:52,409 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 02:27:52,410 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 02:27:52,410 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 02:27:52,410 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 02:27:52,411 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:52" (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-11 02:27:52,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 02:27:52,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 02:27:52,484 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-11 02:27:52,484 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 02:27:52,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 02:27:52,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-11 02:27:52,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-07-11 02:27:52,485 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 02:27:52,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 02:27:52,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 02:27:52,756 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 02:27:52,756 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-11 02:27:52,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:27:52 BoogieIcfgContainer [2020-07-11 02:27:52,762 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 02:27:52,763 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 02:27:52,763 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 02:27:52,772 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 02:27:52,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 02:27:52" (1/3) ... [2020-07-11 02:27:52,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78064133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:27:52, skipping insertion in model container [2020-07-11 02:27:52,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:52" (2/3) ... [2020-07-11 02:27:52,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78064133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:27:52, skipping insertion in model container [2020-07-11 02:27:52,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:27:52" (3/3) ... [2020-07-11 02:27:52,791 INFO L109 eAbstractionObserver]: Analyzing ICFG sum01_bug02.i [2020-07-11 02:27:52,804 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 02:27:52,812 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 02:27:52,845 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 02:27:52,865 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 02:27:52,865 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 02:27:52,865 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 02:27:52,865 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 02:27:52,865 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 02:27:52,866 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 02:27:52,866 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 02:27:52,866 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 02:27:52,880 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2020-07-11 02:27:52,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-11 02:27:52,892 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:27:52,893 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:27:52,893 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:27:52,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:27:52,901 INFO L82 PathProgramCache]: Analyzing trace with hash 79158399, now seen corresponding path program 1 times [2020-07-11 02:27:52,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:27:52,910 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1379017996] [2020-07-11 02:27:52,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:27:52,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:53,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:53,058 INFO L280 TraceCheckUtils]: 0: Hoare triple {33#true} assume true; {33#true} is VALID [2020-07-11 02:27:53,058 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {33#true} {33#true} #49#return; {33#true} is VALID [2020-07-11 02:27:53,060 INFO L263 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2020-07-11 02:27:53,061 INFO L280 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2020-07-11 02:27:53,061 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #49#return; {33#true} is VALID [2020-07-11 02:27:53,062 INFO L263 TraceCheckUtils]: 3: Hoare triple {33#true} call #t~ret3 := main(); {33#true} is VALID [2020-07-11 02:27:53,062 INFO L280 TraceCheckUtils]: 4: Hoare triple {33#true} havoc ~i~0; {33#true} is VALID [2020-07-11 02:27:53,063 INFO L280 TraceCheckUtils]: 5: Hoare triple {33#true} ~j~0 := 10; {33#true} is VALID [2020-07-11 02:27:53,063 INFO L280 TraceCheckUtils]: 6: Hoare triple {33#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {33#true} is VALID [2020-07-11 02:27:53,064 INFO L280 TraceCheckUtils]: 7: Hoare triple {33#true} havoc #t~nondet0; {33#true} is VALID [2020-07-11 02:27:53,064 INFO L280 TraceCheckUtils]: 8: Hoare triple {33#true} ~sn~0 := 0; {33#true} is VALID [2020-07-11 02:27:53,064 INFO L280 TraceCheckUtils]: 9: Hoare triple {33#true} ~i~0 := 1; {33#true} is VALID [2020-07-11 02:27:53,071 INFO L280 TraceCheckUtils]: 10: Hoare triple {33#true} assume !true; {34#false} is VALID [2020-07-11 02:27:53,072 INFO L263 TraceCheckUtils]: 11: Hoare triple {34#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {34#false} is VALID [2020-07-11 02:27:53,072 INFO L280 TraceCheckUtils]: 12: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2020-07-11 02:27:53,073 INFO L280 TraceCheckUtils]: 13: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2020-07-11 02:27:53,073 INFO L280 TraceCheckUtils]: 14: Hoare triple {34#false} assume !false; {34#false} is VALID [2020-07-11 02:27:53,074 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-11 02:27:53,076 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1379017996] [2020-07-11 02:27:53,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:27:53,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-11 02:27:53,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262323458] [2020-07-11 02:27:53,086 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2020-07-11 02:27:53,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:27:53,093 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-11 02:27:53,127 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:53,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-11 02:27:53,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:27:53,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-11 02:27:53,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-11 02:27:53,140 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2020-07-11 02:27:53,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:53,239 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2020-07-11 02:27:53,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-11 02:27:53,239 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2020-07-11 02:27:53,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:27:53,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-11 02:27:53,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 45 transitions. [2020-07-11 02:27:53,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-11 02:27:53,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 45 transitions. [2020-07-11 02:27:53,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 45 transitions. [2020-07-11 02:27:53,375 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:53,396 INFO L225 Difference]: With dead ends: 41 [2020-07-11 02:27:53,397 INFO L226 Difference]: Without dead ends: 24 [2020-07-11 02:27:53,404 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-11 02:27:53,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-11 02:27:53,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-11 02:27:53,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:27:53,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2020-07-11 02:27:53,490 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-11 02:27:53,490 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-11 02:27:53,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:53,495 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-07-11 02:27:53,495 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-11 02:27:53,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:53,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:53,497 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-11 02:27:53,497 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-11 02:27:53,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:53,501 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-07-11 02:27:53,501 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-11 02:27:53,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:53,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:53,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:27:53,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:27:53,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-11 02:27:53,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2020-07-11 02:27:53,507 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 15 [2020-07-11 02:27:53,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:27:53,508 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2020-07-11 02:27:53,508 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-11 02:27:53,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 25 transitions. [2020-07-11 02:27:53,542 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-11 02:27:53,543 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-11 02:27:53,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-11 02:27:53,543 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:27:53,544 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:27:53,544 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 02:27:53,544 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:27:53,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:27:53,545 INFO L82 PathProgramCache]: Analyzing trace with hash 62535021, now seen corresponding path program 1 times [2020-07-11 02:27:53,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:27:53,545 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2060079808] [2020-07-11 02:27:53,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:27:53,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:53,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:53,647 INFO L280 TraceCheckUtils]: 0: Hoare triple {217#true} assume true; {217#true} is VALID [2020-07-11 02:27:53,648 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {217#true} {217#true} #49#return; {217#true} is VALID [2020-07-11 02:27:53,648 INFO L263 TraceCheckUtils]: 0: Hoare triple {217#true} call ULTIMATE.init(); {217#true} is VALID [2020-07-11 02:27:53,649 INFO L280 TraceCheckUtils]: 1: Hoare triple {217#true} assume true; {217#true} is VALID [2020-07-11 02:27:53,649 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {217#true} {217#true} #49#return; {217#true} is VALID [2020-07-11 02:27:53,649 INFO L263 TraceCheckUtils]: 3: Hoare triple {217#true} call #t~ret3 := main(); {217#true} is VALID [2020-07-11 02:27:53,650 INFO L280 TraceCheckUtils]: 4: Hoare triple {217#true} havoc ~i~0; {217#true} is VALID [2020-07-11 02:27:53,650 INFO L280 TraceCheckUtils]: 5: Hoare triple {217#true} ~j~0 := 10; {217#true} is VALID [2020-07-11 02:27:53,650 INFO L280 TraceCheckUtils]: 6: Hoare triple {217#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {217#true} is VALID [2020-07-11 02:27:53,651 INFO L280 TraceCheckUtils]: 7: Hoare triple {217#true} havoc #t~nondet0; {217#true} is VALID [2020-07-11 02:27:53,652 INFO L280 TraceCheckUtils]: 8: Hoare triple {217#true} ~sn~0 := 0; {221#(= 0 main_~sn~0)} is VALID [2020-07-11 02:27:53,653 INFO L280 TraceCheckUtils]: 9: Hoare triple {221#(= 0 main_~sn~0)} ~i~0 := 1; {221#(= 0 main_~sn~0)} is VALID [2020-07-11 02:27:53,654 INFO L280 TraceCheckUtils]: 10: Hoare triple {221#(= 0 main_~sn~0)} assume !(~i~0 <= ~n~0); {221#(= 0 main_~sn~0)} is VALID [2020-07-11 02:27:53,656 INFO L263 TraceCheckUtils]: 11: Hoare triple {221#(= 0 main_~sn~0)} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {222#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:27:53,657 INFO L280 TraceCheckUtils]: 12: Hoare triple {222#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {223#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:27:53,658 INFO L280 TraceCheckUtils]: 13: Hoare triple {223#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {218#false} is VALID [2020-07-11 02:27:53,659 INFO L280 TraceCheckUtils]: 14: Hoare triple {218#false} assume !false; {218#false} is VALID [2020-07-11 02:27:53,660 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-11 02:27:53,661 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2060079808] [2020-07-11 02:27:53,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:27:53,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-11 02:27:53,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343609286] [2020-07-11 02:27:53,664 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-11 02:27:53,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:27:53,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 02:27:53,687 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:53,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 02:27:53,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:27:53,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 02:27:53,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-11 02:27:53,688 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 5 states. [2020-07-11 02:27:53,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:53,862 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2020-07-11 02:27:53,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-11 02:27:53,862 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-11 02:27:53,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:27:53,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:27:53,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2020-07-11 02:27:53,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:27:53,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2020-07-11 02:27:53,868 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2020-07-11 02:27:53,916 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:53,918 INFO L225 Difference]: With dead ends: 38 [2020-07-11 02:27:53,919 INFO L226 Difference]: Without dead ends: 33 [2020-07-11 02:27:53,920 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-11 02:27:53,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-11 02:27:53,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2020-07-11 02:27:53,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:27:53,945 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 32 states. [2020-07-11 02:27:53,945 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 32 states. [2020-07-11 02:27:53,945 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 32 states. [2020-07-11 02:27:53,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:53,948 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2020-07-11 02:27:53,949 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2020-07-11 02:27:53,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:53,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:53,950 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 33 states. [2020-07-11 02:27:53,950 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 33 states. [2020-07-11 02:27:53,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:53,953 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2020-07-11 02:27:53,953 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2020-07-11 02:27:53,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:53,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:53,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:27:53,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:27:53,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-11 02:27:53,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2020-07-11 02:27:53,957 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 15 [2020-07-11 02:27:53,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:27:53,957 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2020-07-11 02:27:53,958 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 02:27:53,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 34 transitions. [2020-07-11 02:27:54,000 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:54,001 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-11 02:27:54,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-11 02:27:54,002 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:27:54,002 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:27:54,002 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 02:27:54,002 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:27:54,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:27:54,003 INFO L82 PathProgramCache]: Analyzing trace with hash 268436001, now seen corresponding path program 1 times [2020-07-11 02:27:54,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:27:54,003 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2100920927] [2020-07-11 02:27:54,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:27:54,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:54,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:54,412 INFO L280 TraceCheckUtils]: 0: Hoare triple {434#true} assume true; {434#true} is VALID [2020-07-11 02:27:54,412 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {434#true} {434#true} #49#return; {434#true} is VALID [2020-07-11 02:27:54,413 INFO L263 TraceCheckUtils]: 0: Hoare triple {434#true} call ULTIMATE.init(); {434#true} is VALID [2020-07-11 02:27:54,413 INFO L280 TraceCheckUtils]: 1: Hoare triple {434#true} assume true; {434#true} is VALID [2020-07-11 02:27:54,414 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {434#true} {434#true} #49#return; {434#true} is VALID [2020-07-11 02:27:54,414 INFO L263 TraceCheckUtils]: 3: Hoare triple {434#true} call #t~ret3 := main(); {434#true} is VALID [2020-07-11 02:27:54,414 INFO L280 TraceCheckUtils]: 4: Hoare triple {434#true} havoc ~i~0; {434#true} is VALID [2020-07-11 02:27:54,414 INFO L280 TraceCheckUtils]: 5: Hoare triple {434#true} ~j~0 := 10; {434#true} is VALID [2020-07-11 02:27:54,415 INFO L280 TraceCheckUtils]: 6: Hoare triple {434#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {434#true} is VALID [2020-07-11 02:27:54,415 INFO L280 TraceCheckUtils]: 7: Hoare triple {434#true} havoc #t~nondet0; {434#true} is VALID [2020-07-11 02:27:54,416 INFO L280 TraceCheckUtils]: 8: Hoare triple {434#true} ~sn~0 := 0; {438#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-11 02:27:54,417 INFO L280 TraceCheckUtils]: 9: Hoare triple {438#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} ~i~0 := 1; {439#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-11 02:27:54,418 INFO L280 TraceCheckUtils]: 10: Hoare triple {439#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {440#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-11 02:27:54,420 INFO L280 TraceCheckUtils]: 11: Hoare triple {440#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume ~i~0 < ~j~0; {440#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-11 02:27:54,421 INFO L280 TraceCheckUtils]: 12: Hoare triple {440#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} ~sn~0 := 2 + ~sn~0; {441#(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-11 02:27:54,422 INFO L280 TraceCheckUtils]: 13: Hoare triple {441#(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; {441#(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-11 02:27:54,423 INFO L280 TraceCheckUtils]: 14: Hoare triple {441#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} ~j~0 := #t~post2 - 1; {441#(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-11 02:27:54,424 INFO L280 TraceCheckUtils]: 15: Hoare triple {441#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} havoc #t~post2; {441#(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-11 02:27:54,427 INFO L280 TraceCheckUtils]: 16: Hoare triple {441#(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; {442#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 |main_#t~post1|) main_~sn~0)))} is VALID [2020-07-11 02:27:54,429 INFO L280 TraceCheckUtils]: 17: Hoare triple {442#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 |main_#t~post1|) main_~sn~0)))} ~i~0 := 1 + #t~post1; {443#(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-11 02:27:54,430 INFO L280 TraceCheckUtils]: 18: Hoare triple {443#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} havoc #t~post1; {443#(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-11 02:27:54,430 INFO L280 TraceCheckUtils]: 19: Hoare triple {443#(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); {444#(and (<= main_~sn~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~sn~0))} is VALID [2020-07-11 02:27:54,432 INFO L263 TraceCheckUtils]: 20: Hoare triple {444#(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)); {445#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:27:54,432 INFO L280 TraceCheckUtils]: 21: Hoare triple {445#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {446#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:27:54,433 INFO L280 TraceCheckUtils]: 22: Hoare triple {446#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {435#false} is VALID [2020-07-11 02:27:54,433 INFO L280 TraceCheckUtils]: 23: Hoare triple {435#false} assume !false; {435#false} is VALID [2020-07-11 02:27:54,435 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-11 02:27:54,436 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2100920927] [2020-07-11 02:27:54,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:27:54,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-11 02:27:54,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449106464] [2020-07-11 02:27:54,437 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2020-07-11 02:27:54,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:27:54,437 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-11 02:27:54,471 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:54,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-11 02:27:54,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:27:54,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-11 02:27:54,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-07-11 02:27:54,473 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 11 states. [2020-07-11 02:27:55,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:55,177 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2020-07-11 02:27:55,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-11 02:27:55,177 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2020-07-11 02:27:55,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:27:55,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 02:27:55,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 64 transitions. [2020-07-11 02:27:55,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 02:27:55,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 64 transitions. [2020-07-11 02:27:55,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 64 transitions. [2020-07-11 02:27:55,263 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:55,265 INFO L225 Difference]: With dead ends: 60 [2020-07-11 02:27:55,266 INFO L226 Difference]: Without dead ends: 55 [2020-07-11 02:27:55,266 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2020-07-11 02:27:55,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-11 02:27:55,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2020-07-11 02:27:55,327 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:27:55,327 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 42 states. [2020-07-11 02:27:55,327 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 42 states. [2020-07-11 02:27:55,328 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 42 states. [2020-07-11 02:27:55,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:55,332 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2020-07-11 02:27:55,332 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2020-07-11 02:27:55,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:55,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:55,333 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 55 states. [2020-07-11 02:27:55,334 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 55 states. [2020-07-11 02:27:55,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:55,338 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2020-07-11 02:27:55,338 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2020-07-11 02:27:55,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:55,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:55,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:27:55,339 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:27:55,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-11 02:27:55,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2020-07-11 02:27:55,342 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 24 [2020-07-11 02:27:55,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:27:55,342 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2020-07-11 02:27:55,342 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-11 02:27:55,343 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 45 transitions. [2020-07-11 02:27:55,398 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:55,398 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2020-07-11 02:27:55,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-11 02:27:55,399 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:27:55,400 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:27:55,400 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 02:27:55,400 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:27:55,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:27:55,401 INFO L82 PathProgramCache]: Analyzing trace with hash -635017609, now seen corresponding path program 1 times [2020-07-11 02:27:55,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:27:55,401 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1736132987] [2020-07-11 02:27:55,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:27:55,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:55,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:55,528 INFO L280 TraceCheckUtils]: 0: Hoare triple {773#true} assume true; {773#true} is VALID [2020-07-11 02:27:55,528 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {773#true} {773#true} #49#return; {773#true} is VALID [2020-07-11 02:27:55,528 INFO L263 TraceCheckUtils]: 0: Hoare triple {773#true} call ULTIMATE.init(); {773#true} is VALID [2020-07-11 02:27:55,529 INFO L280 TraceCheckUtils]: 1: Hoare triple {773#true} assume true; {773#true} is VALID [2020-07-11 02:27:55,529 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {773#true} {773#true} #49#return; {773#true} is VALID [2020-07-11 02:27:55,529 INFO L263 TraceCheckUtils]: 3: Hoare triple {773#true} call #t~ret3 := main(); {773#true} is VALID [2020-07-11 02:27:55,530 INFO L280 TraceCheckUtils]: 4: Hoare triple {773#true} havoc ~i~0; {773#true} is VALID [2020-07-11 02:27:55,530 INFO L280 TraceCheckUtils]: 5: Hoare triple {773#true} ~j~0 := 10; {777#(<= 10 main_~j~0)} is VALID [2020-07-11 02:27:55,531 INFO L280 TraceCheckUtils]: 6: Hoare triple {777#(<= 10 main_~j~0)} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {777#(<= 10 main_~j~0)} is VALID [2020-07-11 02:27:55,532 INFO L280 TraceCheckUtils]: 7: Hoare triple {777#(<= 10 main_~j~0)} havoc #t~nondet0; {777#(<= 10 main_~j~0)} is VALID [2020-07-11 02:27:55,532 INFO L280 TraceCheckUtils]: 8: Hoare triple {777#(<= 10 main_~j~0)} ~sn~0 := 0; {777#(<= 10 main_~j~0)} is VALID [2020-07-11 02:27:55,533 INFO L280 TraceCheckUtils]: 9: Hoare triple {777#(<= 10 main_~j~0)} ~i~0 := 1; {778#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-11 02:27:55,534 INFO L280 TraceCheckUtils]: 10: 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-11 02:27:55,534 INFO L280 TraceCheckUtils]: 11: Hoare triple {778#(<= (+ main_~i~0 9) main_~j~0)} assume ~i~0 < ~j~0; {778#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-11 02:27:55,535 INFO L280 TraceCheckUtils]: 12: Hoare triple {778#(<= (+ main_~i~0 9) main_~j~0)} ~sn~0 := 2 + ~sn~0; {778#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-11 02:27:55,536 INFO L280 TraceCheckUtils]: 13: Hoare triple {778#(<= (+ main_~i~0 9) main_~j~0)} #t~post2 := ~j~0; {779#(<= (+ main_~i~0 9) |main_#t~post2|)} is VALID [2020-07-11 02:27:55,537 INFO L280 TraceCheckUtils]: 14: Hoare triple {779#(<= (+ main_~i~0 9) |main_#t~post2|)} ~j~0 := #t~post2 - 1; {780#(<= (+ main_~i~0 8) main_~j~0)} is VALID [2020-07-11 02:27:55,537 INFO L280 TraceCheckUtils]: 15: Hoare triple {780#(<= (+ main_~i~0 8) main_~j~0)} havoc #t~post2; {780#(<= (+ main_~i~0 8) main_~j~0)} is VALID [2020-07-11 02:27:55,538 INFO L280 TraceCheckUtils]: 16: Hoare triple {780#(<= (+ main_~i~0 8) main_~j~0)} #t~post1 := ~i~0; {781#(<= (+ |main_#t~post1| 8) main_~j~0)} is VALID [2020-07-11 02:27:55,539 INFO L280 TraceCheckUtils]: 17: Hoare triple {781#(<= (+ |main_#t~post1| 8) main_~j~0)} ~i~0 := 1 + #t~post1; {782#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-11 02:27:55,540 INFO L280 TraceCheckUtils]: 18: Hoare triple {782#(<= (+ main_~i~0 7) main_~j~0)} havoc #t~post1; {782#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-11 02:27:55,541 INFO L280 TraceCheckUtils]: 19: Hoare triple {782#(<= (+ main_~i~0 7) main_~j~0)} assume !!(~i~0 <= ~n~0); {782#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-11 02:27:55,541 INFO L280 TraceCheckUtils]: 20: Hoare triple {782#(<= (+ main_~i~0 7) main_~j~0)} assume !(~i~0 < ~j~0); {774#false} is VALID [2020-07-11 02:27:55,542 INFO L280 TraceCheckUtils]: 21: Hoare triple {774#false} #t~post2 := ~j~0; {774#false} is VALID [2020-07-11 02:27:55,542 INFO L280 TraceCheckUtils]: 22: Hoare triple {774#false} ~j~0 := #t~post2 - 1; {774#false} is VALID [2020-07-11 02:27:55,542 INFO L280 TraceCheckUtils]: 23: Hoare triple {774#false} havoc #t~post2; {774#false} is VALID [2020-07-11 02:27:55,543 INFO L280 TraceCheckUtils]: 24: Hoare triple {774#false} #t~post1 := ~i~0; {774#false} is VALID [2020-07-11 02:27:55,543 INFO L280 TraceCheckUtils]: 25: Hoare triple {774#false} ~i~0 := 1 + #t~post1; {774#false} is VALID [2020-07-11 02:27:55,543 INFO L280 TraceCheckUtils]: 26: Hoare triple {774#false} havoc #t~post1; {774#false} is VALID [2020-07-11 02:27:55,544 INFO L280 TraceCheckUtils]: 27: Hoare triple {774#false} assume !(~i~0 <= ~n~0); {774#false} is VALID [2020-07-11 02:27:55,544 INFO L263 TraceCheckUtils]: 28: Hoare triple {774#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {774#false} is VALID [2020-07-11 02:27:55,544 INFO L280 TraceCheckUtils]: 29: Hoare triple {774#false} ~cond := #in~cond; {774#false} is VALID [2020-07-11 02:27:55,544 INFO L280 TraceCheckUtils]: 30: Hoare triple {774#false} assume 0 == ~cond; {774#false} is VALID [2020-07-11 02:27:55,545 INFO L280 TraceCheckUtils]: 31: Hoare triple {774#false} assume !false; {774#false} is VALID [2020-07-11 02:27:55,547 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 02:27:55,547 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1736132987] [2020-07-11 02:27:55,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:27:55,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-11 02:27:55,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105826965] [2020-07-11 02:27:55,548 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2020-07-11 02:27:55,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:27:55,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-11 02:27:55,581 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:55,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-11 02:27:55,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:27:55,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-11 02:27:55,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-11 02:27:55,583 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 8 states. [2020-07-11 02:27:55,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:55,930 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2020-07-11 02:27:55,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-11 02:27:55,930 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2020-07-11 02:27:55,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:27:55,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 02:27:55,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 56 transitions. [2020-07-11 02:27:55,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 02:27:55,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 56 transitions. [2020-07-11 02:27:55,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 56 transitions. [2020-07-11 02:27:56,006 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:56,009 INFO L225 Difference]: With dead ends: 60 [2020-07-11 02:27:56,009 INFO L226 Difference]: Without dead ends: 38 [2020-07-11 02:27:56,010 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2020-07-11 02:27:56,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-11 02:27:56,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2020-07-11 02:27:56,072 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:27:56,073 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 35 states. [2020-07-11 02:27:56,073 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 35 states. [2020-07-11 02:27:56,073 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 35 states. [2020-07-11 02:27:56,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:56,075 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2020-07-11 02:27:56,075 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-07-11 02:27:56,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:56,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:56,076 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 38 states. [2020-07-11 02:27:56,076 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 38 states. [2020-07-11 02:27:56,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:56,079 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2020-07-11 02:27:56,079 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-07-11 02:27:56,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:56,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:56,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:27:56,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:27:56,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-11 02:27:56,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2020-07-11 02:27:56,082 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2020-07-11 02:27:56,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:27:56,082 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2020-07-11 02:27:56,083 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-11 02:27:56,083 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 36 transitions. [2020-07-11 02:27:56,126 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:56,126 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2020-07-11 02:27:56,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-11 02:27:56,128 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:27:56,128 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:27:56,129 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 02:27:56,129 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:27:56,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:27:56,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1260601325, now seen corresponding path program 2 times [2020-07-11 02:27:56,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:27:56,130 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [420139415] [2020-07-11 02:27:56,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:27:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:56,510 INFO L280 TraceCheckUtils]: 0: Hoare triple {1061#true} assume true; {1061#true} is VALID [2020-07-11 02:27:56,510 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1061#true} {1061#true} #49#return; {1061#true} is VALID [2020-07-11 02:27:56,510 INFO L263 TraceCheckUtils]: 0: Hoare triple {1061#true} call ULTIMATE.init(); {1061#true} is VALID [2020-07-11 02:27:56,511 INFO L280 TraceCheckUtils]: 1: Hoare triple {1061#true} assume true; {1061#true} is VALID [2020-07-11 02:27:56,511 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1061#true} {1061#true} #49#return; {1061#true} is VALID [2020-07-11 02:27:56,511 INFO L263 TraceCheckUtils]: 3: Hoare triple {1061#true} call #t~ret3 := main(); {1061#true} is VALID [2020-07-11 02:27:56,511 INFO L280 TraceCheckUtils]: 4: Hoare triple {1061#true} havoc ~i~0; {1061#true} is VALID [2020-07-11 02:27:56,512 INFO L280 TraceCheckUtils]: 5: Hoare triple {1061#true} ~j~0 := 10; {1061#true} is VALID [2020-07-11 02:27:56,512 INFO L280 TraceCheckUtils]: 6: Hoare triple {1061#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {1061#true} is VALID [2020-07-11 02:27:56,512 INFO L280 TraceCheckUtils]: 7: Hoare triple {1061#true} havoc #t~nondet0; {1061#true} is VALID [2020-07-11 02:27:56,513 INFO L280 TraceCheckUtils]: 8: Hoare triple {1061#true} ~sn~0 := 0; {1065#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-11 02:27:56,516 INFO L280 TraceCheckUtils]: 9: Hoare triple {1065#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} ~i~0 := 1; {1066#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-11 02:27:56,517 INFO L280 TraceCheckUtils]: 10: Hoare triple {1066#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {1066#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-11 02:27:56,518 INFO L280 TraceCheckUtils]: 11: Hoare triple {1066#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume ~i~0 < ~j~0; {1066#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-11 02:27:56,519 INFO L280 TraceCheckUtils]: 12: Hoare triple {1066#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} ~sn~0 := 2 + ~sn~0; {1067#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} is VALID [2020-07-11 02:27:56,520 INFO L280 TraceCheckUtils]: 13: Hoare triple {1067#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} #t~post2 := ~j~0; {1067#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} is VALID [2020-07-11 02:27:56,521 INFO L280 TraceCheckUtils]: 14: Hoare triple {1067#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} ~j~0 := #t~post2 - 1; {1067#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} is VALID [2020-07-11 02:27:56,522 INFO L280 TraceCheckUtils]: 15: Hoare triple {1067#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} havoc #t~post2; {1067#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} is VALID [2020-07-11 02:27:56,523 INFO L280 TraceCheckUtils]: 16: Hoare triple {1067#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} #t~post1 := ~i~0; {1068#(and (<= main_~sn~0 (* 2 |main_#t~post1|)) (<= (* 2 |main_#t~post1|) main_~sn~0))} is VALID [2020-07-11 02:27:56,524 INFO L280 TraceCheckUtils]: 17: Hoare triple {1068#(and (<= main_~sn~0 (* 2 |main_#t~post1|)) (<= (* 2 |main_#t~post1|) main_~sn~0))} ~i~0 := 1 + #t~post1; {1066#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-11 02:27:56,525 INFO L280 TraceCheckUtils]: 18: Hoare triple {1066#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} havoc #t~post1; {1066#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-11 02:27:56,526 INFO L280 TraceCheckUtils]: 19: Hoare triple {1066#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {1069#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-11 02:27:56,527 INFO L280 TraceCheckUtils]: 20: Hoare triple {1069#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume ~i~0 < ~j~0; {1069#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-11 02:27:56,528 INFO L280 TraceCheckUtils]: 21: Hoare triple {1069#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} ~sn~0 := 2 + ~sn~0; {1070#(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-11 02:27:56,529 INFO L280 TraceCheckUtils]: 22: Hoare triple {1070#(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; {1070#(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-11 02:27:56,529 INFO L280 TraceCheckUtils]: 23: Hoare triple {1070#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} ~j~0 := #t~post2 - 1; {1070#(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-11 02:27:56,530 INFO L280 TraceCheckUtils]: 24: Hoare triple {1070#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} havoc #t~post2; {1070#(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-11 02:27:56,531 INFO L280 TraceCheckUtils]: 25: Hoare triple {1070#(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; {1071#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 |main_#t~post1|) main_~sn~0)))} is VALID [2020-07-11 02:27:56,532 INFO L280 TraceCheckUtils]: 26: Hoare triple {1071#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 |main_#t~post1|) main_~sn~0)))} ~i~0 := 1 + #t~post1; {1072#(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-11 02:27:56,533 INFO L280 TraceCheckUtils]: 27: Hoare triple {1072#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} havoc #t~post1; {1072#(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-11 02:27:56,534 INFO L280 TraceCheckUtils]: 28: Hoare triple {1072#(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); {1073#(and (<= main_~sn~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~sn~0))} is VALID [2020-07-11 02:27:56,535 INFO L263 TraceCheckUtils]: 29: Hoare triple {1073#(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)); {1074#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:27:56,536 INFO L280 TraceCheckUtils]: 30: Hoare triple {1074#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1075#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:27:56,537 INFO L280 TraceCheckUtils]: 31: Hoare triple {1075#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1062#false} is VALID [2020-07-11 02:27:56,537 INFO L280 TraceCheckUtils]: 32: Hoare triple {1062#false} assume !false; {1062#false} is VALID [2020-07-11 02:27:56,541 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-11 02:27:56,542 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [420139415] [2020-07-11 02:27:56,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:27:56,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-11 02:27:56,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257338057] [2020-07-11 02:27:56,543 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2020-07-11 02:27:56,543 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:27:56,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-11 02:27:56,580 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-11 02:27:56,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-11 02:27:56,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:27:56,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-11 02:27:56,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-07-11 02:27:56,581 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 13 states. [2020-07-11 02:27:57,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:57,356 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2020-07-11 02:27:57,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-11 02:27:57,357 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2020-07-11 02:27:57,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:27:57,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-11 02:27:57,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 48 transitions. [2020-07-11 02:27:57,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-11 02:27:57,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 48 transitions. [2020-07-11 02:27:57,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 48 transitions. [2020-07-11 02:27:57,425 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:57,427 INFO L225 Difference]: With dead ends: 54 [2020-07-11 02:27:57,427 INFO L226 Difference]: Without dead ends: 49 [2020-07-11 02:27:57,428 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2020-07-11 02:27:57,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-11 02:27:57,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2020-07-11 02:27:57,511 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:27:57,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 44 states. [2020-07-11 02:27:57,512 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 44 states. [2020-07-11 02:27:57,512 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 44 states. [2020-07-11 02:27:57,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:57,514 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2020-07-11 02:27:57,514 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2020-07-11 02:27:57,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:57,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:57,515 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 49 states. [2020-07-11 02:27:57,515 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 49 states. [2020-07-11 02:27:57,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:57,518 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2020-07-11 02:27:57,518 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2020-07-11 02:27:57,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:57,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:57,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:27:57,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:27:57,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-11 02:27:57,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2020-07-11 02:27:57,521 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 33 [2020-07-11 02:27:57,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:27:57,522 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2020-07-11 02:27:57,522 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-11 02:27:57,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states and 46 transitions. [2020-07-11 02:27:57,579 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-11 02:27:57,579 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2020-07-11 02:27:57,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-11 02:27:57,580 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:27:57,581 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:27:57,581 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-11 02:27:57,581 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:27:57,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:27:57,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1220208573, now seen corresponding path program 2 times [2020-07-11 02:27:57,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:27:57,582 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1470265859] [2020-07-11 02:27:57,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:27:57,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:57,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:57,736 INFO L280 TraceCheckUtils]: 0: Hoare triple {1390#true} assume true; {1390#true} is VALID [2020-07-11 02:27:57,736 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1390#true} {1390#true} #49#return; {1390#true} is VALID [2020-07-11 02:27:57,736 INFO L263 TraceCheckUtils]: 0: Hoare triple {1390#true} call ULTIMATE.init(); {1390#true} is VALID [2020-07-11 02:27:57,736 INFO L280 TraceCheckUtils]: 1: Hoare triple {1390#true} assume true; {1390#true} is VALID [2020-07-11 02:27:57,737 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1390#true} {1390#true} #49#return; {1390#true} is VALID [2020-07-11 02:27:57,737 INFO L263 TraceCheckUtils]: 3: Hoare triple {1390#true} call #t~ret3 := main(); {1390#true} is VALID [2020-07-11 02:27:57,737 INFO L280 TraceCheckUtils]: 4: Hoare triple {1390#true} havoc ~i~0; {1390#true} is VALID [2020-07-11 02:27:57,737 INFO L280 TraceCheckUtils]: 5: Hoare triple {1390#true} ~j~0 := 10; {1394#(<= 10 main_~j~0)} is VALID [2020-07-11 02:27:57,738 INFO L280 TraceCheckUtils]: 6: Hoare triple {1394#(<= 10 main_~j~0)} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {1394#(<= 10 main_~j~0)} is VALID [2020-07-11 02:27:57,739 INFO L280 TraceCheckUtils]: 7: Hoare triple {1394#(<= 10 main_~j~0)} havoc #t~nondet0; {1394#(<= 10 main_~j~0)} is VALID [2020-07-11 02:27:57,739 INFO L280 TraceCheckUtils]: 8: Hoare triple {1394#(<= 10 main_~j~0)} ~sn~0 := 0; {1394#(<= 10 main_~j~0)} is VALID [2020-07-11 02:27:57,746 INFO L280 TraceCheckUtils]: 9: Hoare triple {1394#(<= 10 main_~j~0)} ~i~0 := 1; {1395#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-11 02:27:57,746 INFO L280 TraceCheckUtils]: 10: Hoare triple {1395#(<= (+ main_~i~0 9) main_~j~0)} assume !!(~i~0 <= ~n~0); {1395#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-11 02:27:57,747 INFO L280 TraceCheckUtils]: 11: Hoare triple {1395#(<= (+ main_~i~0 9) main_~j~0)} assume ~i~0 < ~j~0; {1395#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-11 02:27:57,748 INFO L280 TraceCheckUtils]: 12: Hoare triple {1395#(<= (+ main_~i~0 9) main_~j~0)} ~sn~0 := 2 + ~sn~0; {1395#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-11 02:27:57,749 INFO L280 TraceCheckUtils]: 13: Hoare triple {1395#(<= (+ main_~i~0 9) main_~j~0)} #t~post2 := ~j~0; {1396#(<= (+ main_~i~0 9) |main_#t~post2|)} is VALID [2020-07-11 02:27:57,750 INFO L280 TraceCheckUtils]: 14: Hoare triple {1396#(<= (+ main_~i~0 9) |main_#t~post2|)} ~j~0 := #t~post2 - 1; {1397#(<= (+ main_~i~0 8) main_~j~0)} is VALID [2020-07-11 02:27:57,750 INFO L280 TraceCheckUtils]: 15: Hoare triple {1397#(<= (+ main_~i~0 8) main_~j~0)} havoc #t~post2; {1397#(<= (+ main_~i~0 8) main_~j~0)} is VALID [2020-07-11 02:27:57,755 INFO L280 TraceCheckUtils]: 16: Hoare triple {1397#(<= (+ main_~i~0 8) main_~j~0)} #t~post1 := ~i~0; {1398#(<= (+ |main_#t~post1| 8) main_~j~0)} is VALID [2020-07-11 02:27:57,756 INFO L280 TraceCheckUtils]: 17: Hoare triple {1398#(<= (+ |main_#t~post1| 8) main_~j~0)} ~i~0 := 1 + #t~post1; {1399#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-11 02:27:57,756 INFO L280 TraceCheckUtils]: 18: Hoare triple {1399#(<= (+ main_~i~0 7) main_~j~0)} havoc #t~post1; {1399#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-11 02:27:57,757 INFO L280 TraceCheckUtils]: 19: Hoare triple {1399#(<= (+ main_~i~0 7) main_~j~0)} assume !!(~i~0 <= ~n~0); {1399#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-11 02:27:57,757 INFO L280 TraceCheckUtils]: 20: Hoare triple {1399#(<= (+ main_~i~0 7) main_~j~0)} assume ~i~0 < ~j~0; {1399#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-11 02:27:57,758 INFO L280 TraceCheckUtils]: 21: Hoare triple {1399#(<= (+ main_~i~0 7) main_~j~0)} ~sn~0 := 2 + ~sn~0; {1399#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-11 02:27:57,759 INFO L280 TraceCheckUtils]: 22: Hoare triple {1399#(<= (+ main_~i~0 7) main_~j~0)} #t~post2 := ~j~0; {1400#(<= (+ main_~i~0 7) |main_#t~post2|)} is VALID [2020-07-11 02:27:57,760 INFO L280 TraceCheckUtils]: 23: Hoare triple {1400#(<= (+ main_~i~0 7) |main_#t~post2|)} ~j~0 := #t~post2 - 1; {1401#(<= (+ main_~i~0 6) main_~j~0)} is VALID [2020-07-11 02:27:57,761 INFO L280 TraceCheckUtils]: 24: Hoare triple {1401#(<= (+ main_~i~0 6) main_~j~0)} havoc #t~post2; {1401#(<= (+ main_~i~0 6) main_~j~0)} is VALID [2020-07-11 02:27:57,762 INFO L280 TraceCheckUtils]: 25: Hoare triple {1401#(<= (+ main_~i~0 6) main_~j~0)} #t~post1 := ~i~0; {1402#(<= (+ |main_#t~post1| 6) main_~j~0)} is VALID [2020-07-11 02:27:57,763 INFO L280 TraceCheckUtils]: 26: Hoare triple {1402#(<= (+ |main_#t~post1| 6) main_~j~0)} ~i~0 := 1 + #t~post1; {1403#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2020-07-11 02:27:57,763 INFO L280 TraceCheckUtils]: 27: Hoare triple {1403#(<= (+ main_~i~0 5) main_~j~0)} havoc #t~post1; {1403#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2020-07-11 02:27:57,763 INFO L280 TraceCheckUtils]: 28: Hoare triple {1403#(<= (+ main_~i~0 5) main_~j~0)} assume !!(~i~0 <= ~n~0); {1403#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2020-07-11 02:27:57,764 INFO L280 TraceCheckUtils]: 29: Hoare triple {1403#(<= (+ main_~i~0 5) main_~j~0)} assume !(~i~0 < ~j~0); {1391#false} is VALID [2020-07-11 02:27:57,764 INFO L280 TraceCheckUtils]: 30: Hoare triple {1391#false} #t~post2 := ~j~0; {1391#false} is VALID [2020-07-11 02:27:57,764 INFO L280 TraceCheckUtils]: 31: Hoare triple {1391#false} ~j~0 := #t~post2 - 1; {1391#false} is VALID [2020-07-11 02:27:57,764 INFO L280 TraceCheckUtils]: 32: Hoare triple {1391#false} havoc #t~post2; {1391#false} is VALID [2020-07-11 02:27:57,765 INFO L280 TraceCheckUtils]: 33: Hoare triple {1391#false} #t~post1 := ~i~0; {1391#false} is VALID [2020-07-11 02:27:57,765 INFO L280 TraceCheckUtils]: 34: Hoare triple {1391#false} ~i~0 := 1 + #t~post1; {1391#false} is VALID [2020-07-11 02:27:57,765 INFO L280 TraceCheckUtils]: 35: Hoare triple {1391#false} havoc #t~post1; {1391#false} is VALID [2020-07-11 02:27:57,765 INFO L280 TraceCheckUtils]: 36: Hoare triple {1391#false} assume !(~i~0 <= ~n~0); {1391#false} is VALID [2020-07-11 02:27:57,766 INFO L263 TraceCheckUtils]: 37: Hoare triple {1391#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1391#false} is VALID [2020-07-11 02:27:57,766 INFO L280 TraceCheckUtils]: 38: Hoare triple {1391#false} ~cond := #in~cond; {1391#false} is VALID [2020-07-11 02:27:57,766 INFO L280 TraceCheckUtils]: 39: Hoare triple {1391#false} assume 0 == ~cond; {1391#false} is VALID [2020-07-11 02:27:57,766 INFO L280 TraceCheckUtils]: 40: Hoare triple {1391#false} assume !false; {1391#false} is VALID [2020-07-11 02:27:57,769 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 02:27:57,769 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1470265859] [2020-07-11 02:27:57,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:27:57,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-07-11 02:27:57,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480885343] [2020-07-11 02:27:57,770 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2020-07-11 02:27:57,771 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:27:57,771 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-11 02:27:57,808 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-11 02:27:57,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-11 02:27:57,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:27:57,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-11 02:27:57,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-07-11 02:27:57,809 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 12 states. [2020-07-11 02:27:58,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:58,391 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2020-07-11 02:27:58,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-11 02:27:58,391 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2020-07-11 02:27:58,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:27:58,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-11 02:27:58,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 64 transitions. [2020-07-11 02:27:58,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-11 02:27:58,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 64 transitions. [2020-07-11 02:27:58,397 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 64 transitions. [2020-07-11 02:27:58,461 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:58,464 INFO L225 Difference]: With dead ends: 70 [2020-07-11 02:27:58,464 INFO L226 Difference]: Without dead ends: 56 [2020-07-11 02:27:58,465 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2020-07-11 02:27:58,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-07-11 02:27:58,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2020-07-11 02:27:58,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:27:58,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 53 states. [2020-07-11 02:27:58,554 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 53 states. [2020-07-11 02:27:58,554 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 53 states. [2020-07-11 02:27:58,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:58,556 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2020-07-11 02:27:58,556 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2020-07-11 02:27:58,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:58,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:58,557 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 56 states. [2020-07-11 02:27:58,557 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 56 states. [2020-07-11 02:27:58,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:58,559 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2020-07-11 02:27:58,560 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2020-07-11 02:27:58,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:58,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:58,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:27:58,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:27:58,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-11 02:27:58,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2020-07-11 02:27:58,563 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 41 [2020-07-11 02:27:58,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:27:58,563 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2020-07-11 02:27:58,563 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-11 02:27:58,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 53 states and 55 transitions. [2020-07-11 02:27:58,633 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:58,633 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2020-07-11 02:27:58,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-11 02:27:58,635 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:27:58,635 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:27:58,635 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-11 02:27:58,636 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:27:58,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:27:58,636 INFO L82 PathProgramCache]: Analyzing trace with hash 765701111, now seen corresponding path program 3 times [2020-07-11 02:27:58,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:27:58,637 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1800915008] [2020-07-11 02:27:58,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:27:58,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:58,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:58,942 INFO L280 TraceCheckUtils]: 0: Hoare triple {1782#true} assume true; {1782#true} is VALID [2020-07-11 02:27:58,943 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1782#true} {1782#true} #49#return; {1782#true} is VALID [2020-07-11 02:27:58,943 INFO L263 TraceCheckUtils]: 0: Hoare triple {1782#true} call ULTIMATE.init(); {1782#true} is VALID [2020-07-11 02:27:58,943 INFO L280 TraceCheckUtils]: 1: Hoare triple {1782#true} assume true; {1782#true} is VALID [2020-07-11 02:27:58,944 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1782#true} {1782#true} #49#return; {1782#true} is VALID [2020-07-11 02:27:58,944 INFO L263 TraceCheckUtils]: 3: Hoare triple {1782#true} call #t~ret3 := main(); {1782#true} is VALID [2020-07-11 02:27:58,946 INFO L280 TraceCheckUtils]: 4: Hoare triple {1782#true} havoc ~i~0; {1782#true} is VALID [2020-07-11 02:27:58,950 INFO L280 TraceCheckUtils]: 5: Hoare triple {1782#true} ~j~0 := 10; {1786#(<= 10 main_~j~0)} is VALID [2020-07-11 02:27:58,951 INFO L280 TraceCheckUtils]: 6: Hoare triple {1786#(<= 10 main_~j~0)} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {1786#(<= 10 main_~j~0)} is VALID [2020-07-11 02:27:58,952 INFO L280 TraceCheckUtils]: 7: Hoare triple {1786#(<= 10 main_~j~0)} havoc #t~nondet0; {1786#(<= 10 main_~j~0)} is VALID [2020-07-11 02:27:58,953 INFO L280 TraceCheckUtils]: 8: Hoare triple {1786#(<= 10 main_~j~0)} ~sn~0 := 0; {1786#(<= 10 main_~j~0)} is VALID [2020-07-11 02:27:58,954 INFO L280 TraceCheckUtils]: 9: Hoare triple {1786#(<= 10 main_~j~0)} ~i~0 := 1; {1787#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-11 02:27:58,954 INFO L280 TraceCheckUtils]: 10: Hoare triple {1787#(<= (+ main_~i~0 9) main_~j~0)} assume !!(~i~0 <= ~n~0); {1787#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-11 02:27:58,955 INFO L280 TraceCheckUtils]: 11: Hoare triple {1787#(<= (+ main_~i~0 9) main_~j~0)} assume ~i~0 < ~j~0; {1787#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-11 02:27:58,956 INFO L280 TraceCheckUtils]: 12: Hoare triple {1787#(<= (+ main_~i~0 9) main_~j~0)} ~sn~0 := 2 + ~sn~0; {1787#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-11 02:27:58,957 INFO L280 TraceCheckUtils]: 13: Hoare triple {1787#(<= (+ main_~i~0 9) main_~j~0)} #t~post2 := ~j~0; {1788#(<= (+ main_~i~0 9) |main_#t~post2|)} is VALID [2020-07-11 02:27:58,959 INFO L280 TraceCheckUtils]: 14: Hoare triple {1788#(<= (+ main_~i~0 9) |main_#t~post2|)} ~j~0 := #t~post2 - 1; {1789#(<= (+ main_~i~0 8) main_~j~0)} is VALID [2020-07-11 02:27:58,960 INFO L280 TraceCheckUtils]: 15: Hoare triple {1789#(<= (+ main_~i~0 8) main_~j~0)} havoc #t~post2; {1789#(<= (+ main_~i~0 8) main_~j~0)} is VALID [2020-07-11 02:27:58,961 INFO L280 TraceCheckUtils]: 16: Hoare triple {1789#(<= (+ main_~i~0 8) main_~j~0)} #t~post1 := ~i~0; {1790#(<= (+ |main_#t~post1| 8) main_~j~0)} is VALID [2020-07-11 02:27:58,962 INFO L280 TraceCheckUtils]: 17: Hoare triple {1790#(<= (+ |main_#t~post1| 8) main_~j~0)} ~i~0 := 1 + #t~post1; {1791#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-11 02:27:58,970 INFO L280 TraceCheckUtils]: 18: Hoare triple {1791#(<= (+ main_~i~0 7) main_~j~0)} havoc #t~post1; {1791#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-11 02:27:58,971 INFO L280 TraceCheckUtils]: 19: Hoare triple {1791#(<= (+ main_~i~0 7) main_~j~0)} assume !!(~i~0 <= ~n~0); {1791#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-11 02:27:58,972 INFO L280 TraceCheckUtils]: 20: Hoare triple {1791#(<= (+ main_~i~0 7) main_~j~0)} assume ~i~0 < ~j~0; {1791#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-11 02:27:58,972 INFO L280 TraceCheckUtils]: 21: Hoare triple {1791#(<= (+ main_~i~0 7) main_~j~0)} ~sn~0 := 2 + ~sn~0; {1791#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-11 02:27:58,973 INFO L280 TraceCheckUtils]: 22: Hoare triple {1791#(<= (+ main_~i~0 7) main_~j~0)} #t~post2 := ~j~0; {1792#(<= (+ main_~i~0 7) |main_#t~post2|)} is VALID [2020-07-11 02:27:58,975 INFO L280 TraceCheckUtils]: 23: Hoare triple {1792#(<= (+ main_~i~0 7) |main_#t~post2|)} ~j~0 := #t~post2 - 1; {1793#(<= (+ main_~i~0 6) main_~j~0)} is VALID [2020-07-11 02:27:58,976 INFO L280 TraceCheckUtils]: 24: Hoare triple {1793#(<= (+ main_~i~0 6) main_~j~0)} havoc #t~post2; {1793#(<= (+ main_~i~0 6) main_~j~0)} is VALID [2020-07-11 02:27:58,977 INFO L280 TraceCheckUtils]: 25: Hoare triple {1793#(<= (+ main_~i~0 6) main_~j~0)} #t~post1 := ~i~0; {1794#(<= (+ |main_#t~post1| 6) main_~j~0)} is VALID [2020-07-11 02:27:58,978 INFO L280 TraceCheckUtils]: 26: Hoare triple {1794#(<= (+ |main_#t~post1| 6) main_~j~0)} ~i~0 := 1 + #t~post1; {1795#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2020-07-11 02:27:58,979 INFO L280 TraceCheckUtils]: 27: Hoare triple {1795#(<= (+ main_~i~0 5) main_~j~0)} havoc #t~post1; {1795#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2020-07-11 02:27:58,990 INFO L280 TraceCheckUtils]: 28: Hoare triple {1795#(<= (+ main_~i~0 5) main_~j~0)} assume !!(~i~0 <= ~n~0); {1795#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2020-07-11 02:27:58,990 INFO L280 TraceCheckUtils]: 29: Hoare triple {1795#(<= (+ main_~i~0 5) main_~j~0)} assume ~i~0 < ~j~0; {1795#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2020-07-11 02:27:58,991 INFO L280 TraceCheckUtils]: 30: Hoare triple {1795#(<= (+ main_~i~0 5) main_~j~0)} ~sn~0 := 2 + ~sn~0; {1795#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2020-07-11 02:27:58,992 INFO L280 TraceCheckUtils]: 31: Hoare triple {1795#(<= (+ main_~i~0 5) main_~j~0)} #t~post2 := ~j~0; {1796#(<= (+ main_~i~0 5) |main_#t~post2|)} is VALID [2020-07-11 02:27:58,993 INFO L280 TraceCheckUtils]: 32: Hoare triple {1796#(<= (+ main_~i~0 5) |main_#t~post2|)} ~j~0 := #t~post2 - 1; {1797#(<= (+ main_~i~0 4) main_~j~0)} is VALID [2020-07-11 02:27:58,993 INFO L280 TraceCheckUtils]: 33: Hoare triple {1797#(<= (+ main_~i~0 4) main_~j~0)} havoc #t~post2; {1797#(<= (+ main_~i~0 4) main_~j~0)} is VALID [2020-07-11 02:27:58,994 INFO L280 TraceCheckUtils]: 34: Hoare triple {1797#(<= (+ main_~i~0 4) main_~j~0)} #t~post1 := ~i~0; {1798#(<= (+ |main_#t~post1| 4) main_~j~0)} is VALID [2020-07-11 02:27:58,995 INFO L280 TraceCheckUtils]: 35: Hoare triple {1798#(<= (+ |main_#t~post1| 4) main_~j~0)} ~i~0 := 1 + #t~post1; {1799#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2020-07-11 02:27:58,996 INFO L280 TraceCheckUtils]: 36: Hoare triple {1799#(<= (+ main_~i~0 3) main_~j~0)} havoc #t~post1; {1799#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2020-07-11 02:27:58,996 INFO L280 TraceCheckUtils]: 37: Hoare triple {1799#(<= (+ main_~i~0 3) main_~j~0)} assume !!(~i~0 <= ~n~0); {1799#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2020-07-11 02:27:58,997 INFO L280 TraceCheckUtils]: 38: Hoare triple {1799#(<= (+ main_~i~0 3) main_~j~0)} assume !(~i~0 < ~j~0); {1783#false} is VALID [2020-07-11 02:27:58,998 INFO L280 TraceCheckUtils]: 39: Hoare triple {1783#false} #t~post2 := ~j~0; {1783#false} is VALID [2020-07-11 02:27:58,998 INFO L280 TraceCheckUtils]: 40: Hoare triple {1783#false} ~j~0 := #t~post2 - 1; {1783#false} is VALID [2020-07-11 02:27:58,998 INFO L280 TraceCheckUtils]: 41: Hoare triple {1783#false} havoc #t~post2; {1783#false} is VALID [2020-07-11 02:27:58,999 INFO L280 TraceCheckUtils]: 42: Hoare triple {1783#false} #t~post1 := ~i~0; {1783#false} is VALID [2020-07-11 02:27:58,999 INFO L280 TraceCheckUtils]: 43: Hoare triple {1783#false} ~i~0 := 1 + #t~post1; {1783#false} is VALID [2020-07-11 02:27:58,999 INFO L280 TraceCheckUtils]: 44: Hoare triple {1783#false} havoc #t~post1; {1783#false} is VALID [2020-07-11 02:27:59,000 INFO L280 TraceCheckUtils]: 45: Hoare triple {1783#false} assume !(~i~0 <= ~n~0); {1783#false} is VALID [2020-07-11 02:27:59,000 INFO L263 TraceCheckUtils]: 46: Hoare triple {1783#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1783#false} is VALID [2020-07-11 02:27:59,001 INFO L280 TraceCheckUtils]: 47: Hoare triple {1783#false} ~cond := #in~cond; {1783#false} is VALID [2020-07-11 02:27:59,001 INFO L280 TraceCheckUtils]: 48: Hoare triple {1783#false} assume 0 == ~cond; {1783#false} is VALID [2020-07-11 02:27:59,001 INFO L280 TraceCheckUtils]: 49: Hoare triple {1783#false} assume !false; {1783#false} is VALID [2020-07-11 02:27:59,009 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 22 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 02:27:59,010 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1800915008] [2020-07-11 02:27:59,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:27:59,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-07-11 02:27:59,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410999619] [2020-07-11 02:27:59,011 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2020-07-11 02:27:59,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:27:59,012 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-11 02:27:59,080 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:59,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-11 02:27:59,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:27:59,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-11 02:27:59,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2020-07-11 02:27:59,082 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 16 states. [2020-07-11 02:27:59,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:59,767 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2020-07-11 02:27:59,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-11 02:27:59,767 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2020-07-11 02:27:59,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:27:59,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-11 02:27:59,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 73 transitions. [2020-07-11 02:27:59,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-11 02:27:59,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 73 transitions. [2020-07-11 02:27:59,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 73 transitions. [2020-07-11 02:27:59,847 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:59,850 INFO L225 Difference]: With dead ends: 79 [2020-07-11 02:27:59,850 INFO L226 Difference]: Without dead ends: 65 [2020-07-11 02:27:59,851 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=194, Invalid=618, Unknown=0, NotChecked=0, Total=812 [2020-07-11 02:27:59,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-07-11 02:27:59,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2020-07-11 02:27:59,972 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:27:59,973 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 62 states. [2020-07-11 02:27:59,973 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 62 states. [2020-07-11 02:27:59,973 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 62 states. [2020-07-11 02:27:59,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:59,975 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2020-07-11 02:27:59,975 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2020-07-11 02:27:59,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:59,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:59,976 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 65 states. [2020-07-11 02:27:59,976 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 65 states. [2020-07-11 02:27:59,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:59,979 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2020-07-11 02:27:59,979 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2020-07-11 02:27:59,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:59,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:59,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:27:59,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:27:59,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-07-11 02:27:59,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2020-07-11 02:27:59,982 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 50 [2020-07-11 02:27:59,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:27:59,982 INFO L479 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2020-07-11 02:27:59,982 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-11 02:27:59,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 62 states and 64 transitions. [2020-07-11 02:28:00,065 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:28:00,065 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2020-07-11 02:28:00,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-07-11 02:28:00,067 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:28:00,067 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:28:00,067 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-11 02:28:00,067 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:28:00,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:28:00,068 INFO L82 PathProgramCache]: Analyzing trace with hash -258080061, now seen corresponding path program 4 times [2020-07-11 02:28:00,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:28:00,068 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2036104200] [2020-07-11 02:28:00,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:28:00,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:00,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:00,407 INFO L280 TraceCheckUtils]: 0: Hoare triple {2240#true} assume true; {2240#true} is VALID [2020-07-11 02:28:00,407 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2240#true} {2240#true} #49#return; {2240#true} is VALID [2020-07-11 02:28:00,408 INFO L263 TraceCheckUtils]: 0: Hoare triple {2240#true} call ULTIMATE.init(); {2240#true} is VALID [2020-07-11 02:28:00,408 INFO L280 TraceCheckUtils]: 1: Hoare triple {2240#true} assume true; {2240#true} is VALID [2020-07-11 02:28:00,408 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2240#true} {2240#true} #49#return; {2240#true} is VALID [2020-07-11 02:28:00,408 INFO L263 TraceCheckUtils]: 3: Hoare triple {2240#true} call #t~ret3 := main(); {2240#true} is VALID [2020-07-11 02:28:00,409 INFO L280 TraceCheckUtils]: 4: Hoare triple {2240#true} havoc ~i~0; {2240#true} is VALID [2020-07-11 02:28:00,409 INFO L280 TraceCheckUtils]: 5: Hoare triple {2240#true} ~j~0 := 10; {2244#(<= 10 main_~j~0)} is VALID [2020-07-11 02:28:00,410 INFO L280 TraceCheckUtils]: 6: Hoare triple {2244#(<= 10 main_~j~0)} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {2244#(<= 10 main_~j~0)} is VALID [2020-07-11 02:28:00,410 INFO L280 TraceCheckUtils]: 7: Hoare triple {2244#(<= 10 main_~j~0)} havoc #t~nondet0; {2244#(<= 10 main_~j~0)} is VALID [2020-07-11 02:28:00,411 INFO L280 TraceCheckUtils]: 8: Hoare triple {2244#(<= 10 main_~j~0)} ~sn~0 := 0; {2244#(<= 10 main_~j~0)} is VALID [2020-07-11 02:28:00,411 INFO L280 TraceCheckUtils]: 9: Hoare triple {2244#(<= 10 main_~j~0)} ~i~0 := 1; {2245#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-11 02:28:00,412 INFO L280 TraceCheckUtils]: 10: Hoare triple {2245#(<= (+ main_~i~0 9) main_~j~0)} assume !!(~i~0 <= ~n~0); {2245#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-11 02:28:00,412 INFO L280 TraceCheckUtils]: 11: Hoare triple {2245#(<= (+ main_~i~0 9) main_~j~0)} assume ~i~0 < ~j~0; {2245#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-11 02:28:00,413 INFO L280 TraceCheckUtils]: 12: Hoare triple {2245#(<= (+ main_~i~0 9) main_~j~0)} ~sn~0 := 2 + ~sn~0; {2245#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-11 02:28:00,414 INFO L280 TraceCheckUtils]: 13: Hoare triple {2245#(<= (+ main_~i~0 9) main_~j~0)} #t~post2 := ~j~0; {2246#(<= (+ main_~i~0 9) |main_#t~post2|)} is VALID [2020-07-11 02:28:00,414 INFO L280 TraceCheckUtils]: 14: Hoare triple {2246#(<= (+ main_~i~0 9) |main_#t~post2|)} ~j~0 := #t~post2 - 1; {2247#(<= (+ main_~i~0 8) main_~j~0)} is VALID [2020-07-11 02:28:00,415 INFO L280 TraceCheckUtils]: 15: Hoare triple {2247#(<= (+ main_~i~0 8) main_~j~0)} havoc #t~post2; {2247#(<= (+ main_~i~0 8) main_~j~0)} is VALID [2020-07-11 02:28:00,415 INFO L280 TraceCheckUtils]: 16: Hoare triple {2247#(<= (+ main_~i~0 8) main_~j~0)} #t~post1 := ~i~0; {2248#(<= (+ |main_#t~post1| 8) main_~j~0)} is VALID [2020-07-11 02:28:00,416 INFO L280 TraceCheckUtils]: 17: Hoare triple {2248#(<= (+ |main_#t~post1| 8) main_~j~0)} ~i~0 := 1 + #t~post1; {2249#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-11 02:28:00,417 INFO L280 TraceCheckUtils]: 18: Hoare triple {2249#(<= (+ main_~i~0 7) main_~j~0)} havoc #t~post1; {2249#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-11 02:28:00,417 INFO L280 TraceCheckUtils]: 19: Hoare triple {2249#(<= (+ main_~i~0 7) main_~j~0)} assume !!(~i~0 <= ~n~0); {2249#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-11 02:28:00,418 INFO L280 TraceCheckUtils]: 20: Hoare triple {2249#(<= (+ main_~i~0 7) main_~j~0)} assume ~i~0 < ~j~0; {2249#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-11 02:28:00,418 INFO L280 TraceCheckUtils]: 21: Hoare triple {2249#(<= (+ main_~i~0 7) main_~j~0)} ~sn~0 := 2 + ~sn~0; {2249#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-11 02:28:00,419 INFO L280 TraceCheckUtils]: 22: Hoare triple {2249#(<= (+ main_~i~0 7) main_~j~0)} #t~post2 := ~j~0; {2250#(<= (+ main_~i~0 7) |main_#t~post2|)} is VALID [2020-07-11 02:28:00,420 INFO L280 TraceCheckUtils]: 23: Hoare triple {2250#(<= (+ main_~i~0 7) |main_#t~post2|)} ~j~0 := #t~post2 - 1; {2251#(<= (+ main_~i~0 6) main_~j~0)} is VALID [2020-07-11 02:28:00,420 INFO L280 TraceCheckUtils]: 24: Hoare triple {2251#(<= (+ main_~i~0 6) main_~j~0)} havoc #t~post2; {2251#(<= (+ main_~i~0 6) main_~j~0)} is VALID [2020-07-11 02:28:00,429 INFO L280 TraceCheckUtils]: 25: Hoare triple {2251#(<= (+ main_~i~0 6) main_~j~0)} #t~post1 := ~i~0; {2252#(<= (+ |main_#t~post1| 6) main_~j~0)} is VALID [2020-07-11 02:28:00,431 INFO L280 TraceCheckUtils]: 26: Hoare triple {2252#(<= (+ |main_#t~post1| 6) main_~j~0)} ~i~0 := 1 + #t~post1; {2253#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2020-07-11 02:28:00,432 INFO L280 TraceCheckUtils]: 27: Hoare triple {2253#(<= (+ main_~i~0 5) main_~j~0)} havoc #t~post1; {2253#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2020-07-11 02:28:00,434 INFO L280 TraceCheckUtils]: 28: Hoare triple {2253#(<= (+ main_~i~0 5) main_~j~0)} assume !!(~i~0 <= ~n~0); {2253#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2020-07-11 02:28:00,438 INFO L280 TraceCheckUtils]: 29: Hoare triple {2253#(<= (+ main_~i~0 5) main_~j~0)} assume ~i~0 < ~j~0; {2253#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2020-07-11 02:28:00,440 INFO L280 TraceCheckUtils]: 30: Hoare triple {2253#(<= (+ main_~i~0 5) main_~j~0)} ~sn~0 := 2 + ~sn~0; {2253#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2020-07-11 02:28:00,441 INFO L280 TraceCheckUtils]: 31: Hoare triple {2253#(<= (+ main_~i~0 5) main_~j~0)} #t~post2 := ~j~0; {2254#(<= (+ main_~i~0 5) |main_#t~post2|)} is VALID [2020-07-11 02:28:00,441 INFO L280 TraceCheckUtils]: 32: Hoare triple {2254#(<= (+ main_~i~0 5) |main_#t~post2|)} ~j~0 := #t~post2 - 1; {2255#(<= (+ main_~i~0 4) main_~j~0)} is VALID [2020-07-11 02:28:00,442 INFO L280 TraceCheckUtils]: 33: Hoare triple {2255#(<= (+ main_~i~0 4) main_~j~0)} havoc #t~post2; {2255#(<= (+ main_~i~0 4) main_~j~0)} is VALID [2020-07-11 02:28:00,443 INFO L280 TraceCheckUtils]: 34: Hoare triple {2255#(<= (+ main_~i~0 4) main_~j~0)} #t~post1 := ~i~0; {2256#(<= (+ |main_#t~post1| 4) main_~j~0)} is VALID [2020-07-11 02:28:00,443 INFO L280 TraceCheckUtils]: 35: Hoare triple {2256#(<= (+ |main_#t~post1| 4) main_~j~0)} ~i~0 := 1 + #t~post1; {2257#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2020-07-11 02:28:00,444 INFO L280 TraceCheckUtils]: 36: Hoare triple {2257#(<= (+ main_~i~0 3) main_~j~0)} havoc #t~post1; {2257#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2020-07-11 02:28:00,445 INFO L280 TraceCheckUtils]: 37: Hoare triple {2257#(<= (+ main_~i~0 3) main_~j~0)} assume !!(~i~0 <= ~n~0); {2257#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2020-07-11 02:28:00,445 INFO L280 TraceCheckUtils]: 38: Hoare triple {2257#(<= (+ main_~i~0 3) main_~j~0)} assume ~i~0 < ~j~0; {2257#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2020-07-11 02:28:00,446 INFO L280 TraceCheckUtils]: 39: Hoare triple {2257#(<= (+ main_~i~0 3) main_~j~0)} ~sn~0 := 2 + ~sn~0; {2257#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2020-07-11 02:28:00,446 INFO L280 TraceCheckUtils]: 40: Hoare triple {2257#(<= (+ main_~i~0 3) main_~j~0)} #t~post2 := ~j~0; {2258#(<= (+ main_~i~0 3) |main_#t~post2|)} is VALID [2020-07-11 02:28:00,447 INFO L280 TraceCheckUtils]: 41: Hoare triple {2258#(<= (+ main_~i~0 3) |main_#t~post2|)} ~j~0 := #t~post2 - 1; {2259#(<= (+ main_~i~0 2) main_~j~0)} is VALID [2020-07-11 02:28:00,448 INFO L280 TraceCheckUtils]: 42: Hoare triple {2259#(<= (+ main_~i~0 2) main_~j~0)} havoc #t~post2; {2259#(<= (+ main_~i~0 2) main_~j~0)} is VALID [2020-07-11 02:28:00,448 INFO L280 TraceCheckUtils]: 43: Hoare triple {2259#(<= (+ main_~i~0 2) main_~j~0)} #t~post1 := ~i~0; {2260#(<= (+ |main_#t~post1| 2) main_~j~0)} is VALID [2020-07-11 02:28:00,449 INFO L280 TraceCheckUtils]: 44: Hoare triple {2260#(<= (+ |main_#t~post1| 2) main_~j~0)} ~i~0 := 1 + #t~post1; {2261#(<= (+ main_~i~0 1) main_~j~0)} is VALID [2020-07-11 02:28:00,450 INFO L280 TraceCheckUtils]: 45: Hoare triple {2261#(<= (+ main_~i~0 1) main_~j~0)} havoc #t~post1; {2261#(<= (+ main_~i~0 1) main_~j~0)} is VALID [2020-07-11 02:28:00,450 INFO L280 TraceCheckUtils]: 46: Hoare triple {2261#(<= (+ main_~i~0 1) main_~j~0)} assume !!(~i~0 <= ~n~0); {2261#(<= (+ main_~i~0 1) main_~j~0)} is VALID [2020-07-11 02:28:00,451 INFO L280 TraceCheckUtils]: 47: Hoare triple {2261#(<= (+ main_~i~0 1) main_~j~0)} assume !(~i~0 < ~j~0); {2241#false} is VALID [2020-07-11 02:28:00,451 INFO L280 TraceCheckUtils]: 48: Hoare triple {2241#false} #t~post2 := ~j~0; {2241#false} is VALID [2020-07-11 02:28:00,451 INFO L280 TraceCheckUtils]: 49: Hoare triple {2241#false} ~j~0 := #t~post2 - 1; {2241#false} is VALID [2020-07-11 02:28:00,452 INFO L280 TraceCheckUtils]: 50: Hoare triple {2241#false} havoc #t~post2; {2241#false} is VALID [2020-07-11 02:28:00,452 INFO L280 TraceCheckUtils]: 51: Hoare triple {2241#false} #t~post1 := ~i~0; {2241#false} is VALID [2020-07-11 02:28:00,452 INFO L280 TraceCheckUtils]: 52: Hoare triple {2241#false} ~i~0 := 1 + #t~post1; {2241#false} is VALID [2020-07-11 02:28:00,452 INFO L280 TraceCheckUtils]: 53: Hoare triple {2241#false} havoc #t~post1; {2241#false} is VALID [2020-07-11 02:28:00,453 INFO L280 TraceCheckUtils]: 54: Hoare triple {2241#false} assume !(~i~0 <= ~n~0); {2241#false} is VALID [2020-07-11 02:28:00,453 INFO L263 TraceCheckUtils]: 55: Hoare triple {2241#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {2241#false} is VALID [2020-07-11 02:28:00,453 INFO L280 TraceCheckUtils]: 56: Hoare triple {2241#false} ~cond := #in~cond; {2241#false} is VALID [2020-07-11 02:28:00,453 INFO L280 TraceCheckUtils]: 57: Hoare triple {2241#false} assume 0 == ~cond; {2241#false} is VALID [2020-07-11 02:28:00,454 INFO L280 TraceCheckUtils]: 58: Hoare triple {2241#false} assume !false; {2241#false} is VALID [2020-07-11 02:28:00,466 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 29 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 02:28:00,467 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2036104200] [2020-07-11 02:28:00,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:28:00,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-07-11 02:28:00,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992409031] [2020-07-11 02:28:00,469 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 59 [2020-07-11 02:28:00,469 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:28:00,470 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2020-07-11 02:28:00,525 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:28:00,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-11 02:28:00,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:28:00,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-11 02:28:00,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2020-07-11 02:28:00,529 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 20 states. [2020-07-11 02:28:01,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:01,556 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2020-07-11 02:28:01,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-07-11 02:28:01,556 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 59 [2020-07-11 02:28:01,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:28:01,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-11 02:28:01,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 81 transitions. [2020-07-11 02:28:01,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-11 02:28:01,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 81 transitions. [2020-07-11 02:28:01,562 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 81 transitions. [2020-07-11 02:28:01,670 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:28:01,671 INFO L225 Difference]: With dead ends: 87 [2020-07-11 02:28:01,671 INFO L226 Difference]: Without dead ends: 73 [2020-07-11 02:28:01,672 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=307, Invalid=1025, Unknown=0, NotChecked=0, Total=1332 [2020-07-11 02:28:01,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-07-11 02:28:01,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2020-07-11 02:28:01,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:28:01,805 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 71 states. [2020-07-11 02:28:01,805 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 71 states. [2020-07-11 02:28:01,806 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 71 states. [2020-07-11 02:28:01,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:01,809 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2020-07-11 02:28:01,809 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2020-07-11 02:28:01,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:01,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:01,809 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 73 states. [2020-07-11 02:28:01,810 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 73 states. [2020-07-11 02:28:01,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:01,812 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2020-07-11 02:28:01,812 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2020-07-11 02:28:01,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:01,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:01,813 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:28:01,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:28:01,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-07-11 02:28:01,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2020-07-11 02:28:01,815 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 59 [2020-07-11 02:28:01,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:28:01,815 INFO L479 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2020-07-11 02:28:01,815 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-11 02:28:01,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 71 states and 73 transitions. [2020-07-11 02:28:01,918 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:28:01,918 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2020-07-11 02:28:01,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-07-11 02:28:01,919 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:28:01,919 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:28:01,920 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-11 02:28:01,920 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:28:01,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:28:01,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1030394231, now seen corresponding path program 5 times [2020-07-11 02:28:01,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:28:01,921 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [574863108] [2020-07-11 02:28:01,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:28:01,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 02:28:02,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 02:28:02,066 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-11 02:28:02,068 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-11 02:28:02,069 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-11 02:28:02,123 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-11 02:28:02,123 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 02:28:02,124 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 02:28:02,124 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-11 02:28:02,124 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-11 02:28:02,124 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-11 02:28:02,124 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 02:28:02,124 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 02:28:02,124 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-11 02:28:02,124 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-11 02:28:02,124 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-11 02:28:02,125 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-11 02:28:02,125 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2020-07-11 02:28:02,125 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-11 02:28:02,125 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-11 02:28:02,125 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-11 02:28:02,125 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2020-07-11 02:28:02,125 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-11 02:28:02,125 WARN L170 areAnnotationChecker]: L12-3 has no Hoare annotation [2020-07-11 02:28:02,125 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-11 02:28:02,126 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-11 02:28:02,126 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-11 02:28:02,126 WARN L170 areAnnotationChecker]: L13-6 has no Hoare annotation [2020-07-11 02:28:02,126 WARN L170 areAnnotationChecker]: L13-6 has no Hoare annotation [2020-07-11 02:28:02,126 WARN L170 areAnnotationChecker]: L13-6 has no Hoare annotation [2020-07-11 02:28:02,126 WARN L170 areAnnotationChecker]: L13-7 has no Hoare annotation [2020-07-11 02:28:02,126 WARN L170 areAnnotationChecker]: L13-7 has no Hoare annotation [2020-07-11 02:28:02,126 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-11 02:28:02,127 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-11 02:28:02,127 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-11 02:28:02,127 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2020-07-11 02:28:02,127 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-11 02:28:02,127 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2020-07-11 02:28:02,127 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-11 02:28:02,127 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2020-07-11 02:28:02,127 WARN L170 areAnnotationChecker]: L13-5 has no Hoare annotation [2020-07-11 02:28:02,128 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-11 02:28:02,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 02:28:02 BoogieIcfgContainer [2020-07-11 02:28:02,132 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 02:28:02,139 INFO L168 Benchmark]: Toolchain (without parser) took 10093.34 ms. Allocated memory was 145.2 MB in the beginning and 317.7 MB in the end (delta: 172.5 MB). Free memory was 103.4 MB in the beginning and 220.1 MB in the end (delta: -116.8 MB). Peak memory consumption was 55.7 MB. Max. memory is 7.1 GB. [2020-07-11 02:28:02,140 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 145.2 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-11 02:28:02,141 INFO L168 Benchmark]: CACSL2BoogieTranslator took 246.67 ms. Allocated memory is still 145.2 MB. Free memory was 103.1 MB in the beginning and 93.5 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-11 02:28:02,142 INFO L168 Benchmark]: Boogie Preprocessor took 120.52 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 93.5 MB in the beginning and 182.6 MB in the end (delta: -89.1 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2020-07-11 02:28:02,143 INFO L168 Benchmark]: RCFGBuilder took 351.77 ms. Allocated memory is still 202.9 MB. Free memory was 182.6 MB in the beginning and 166.0 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 7.1 GB. [2020-07-11 02:28:02,146 INFO L168 Benchmark]: TraceAbstraction took 9368.33 ms. Allocated memory was 202.9 MB in the beginning and 317.7 MB in the end (delta: 114.8 MB). Free memory was 165.3 MB in the beginning and 220.1 MB in the end (delta: -54.8 MB). Peak memory consumption was 60.0 MB. Max. memory is 7.1 GB. [2020-07-11 02:28:02,153 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.24 ms. Allocated memory is still 145.2 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 246.67 ms. Allocated memory is still 145.2 MB. Free memory was 103.1 MB in the beginning and 93.5 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 120.52 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 93.5 MB in the beginning and 182.6 MB in the end (delta: -89.1 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 351.77 ms. Allocated memory is still 202.9 MB. Free memory was 182.6 MB in the beginning and 166.0 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9368.33 ms. Allocated memory was 202.9 MB in the beginning and 317.7 MB in the end (delta: 114.8 MB). Free memory was 165.3 MB in the beginning and 220.1 MB in the end (delta: -54.8 MB). Peak memory consumption was 60.0 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; VAL [__VERIFIER_nondet_uint()=6, j=10, n=6] [L12] int i, j=10, n=__VERIFIER_nondet_uint(), sn=0; VAL [j=10, n=6, n=0] [L13] i=1 VAL [i=1, j=10, n=6, n=0] [L13] COND TRUE i<=n VAL [i=1, j=10, n=6, n=0] [L14] COND TRUE i