/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-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 02:27:47,210 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 02:27:47,213 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 02:27:47,225 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 02:27:47,226 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 02:27:47,227 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 02:27:47,228 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 02:27:47,230 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 02:27:47,232 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 02:27:47,233 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 02:27:47,234 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 02:27:47,235 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 02:27:47,235 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 02:27:47,236 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 02:27:47,237 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 02:27:47,239 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 02:27:47,240 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 02:27:47,241 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 02:27:47,243 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 02:27:47,245 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 02:27:47,247 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 02:27:47,248 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 02:27:47,249 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 02:27:47,250 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 02:27:47,253 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 02:27:47,254 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 02:27:47,254 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 02:27:47,255 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 02:27:47,255 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 02:27:47,256 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 02:27:47,257 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 02:27:47,258 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 02:27:47,259 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 02:27:47,263 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 02:27:47,264 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 02:27:47,264 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 02:27:47,265 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 02:27:47,265 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 02:27:47,267 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 02:27:47,268 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 02:27:47,269 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 02:27:47,270 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:47,282 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 02:27:47,283 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 02:27:47,284 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 02:27:47,284 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 02:27:47,284 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 02:27:47,285 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 02:27:47,285 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 02:27:47,285 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 02:27:47,285 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 02:27:47,285 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 02:27:47,286 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 02:27:47,286 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 02:27:47,286 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 02:27:47,286 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 02:27:47,287 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 02:27:47,287 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 02:27:47,287 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 02:27:47,287 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 02:27:47,287 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 02:27:47,288 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 02:27:47,288 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 02:27:47,288 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 02:27:47,288 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:47,582 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 02:27:47,598 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 02:27:47,601 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 02:27:47,603 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 02:27:47,604 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 02:27:47,604 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01-1.i [2020-07-11 02:27:47,672 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7193077b6/60d7aba7ee2241da9927c021f11ee9fe/FLAG1cb5ebc1a [2020-07-11 02:27:48,102 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 02:27:48,103 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01-1.i [2020-07-11 02:27:48,110 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7193077b6/60d7aba7ee2241da9927c021f11ee9fe/FLAG1cb5ebc1a [2020-07-11 02:27:48,525 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7193077b6/60d7aba7ee2241da9927c021f11ee9fe [2020-07-11 02:27:48,536 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 02:27:48,538 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 02:27:48,539 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 02:27:48,539 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 02:27:48,542 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 02:27:48,544 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:27:48" (1/1) ... [2020-07-11 02:27:48,547 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@582fec3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:48, skipping insertion in model container [2020-07-11 02:27:48,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:27:48" (1/1) ... [2020-07-11 02:27:48,555 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 02:27:48,573 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 02:27:48,798 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:27:48,810 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 02:27:48,831 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:27:48,848 INFO L208 MainTranslator]: Completed translation [2020-07-11 02:27:48,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:48 WrapperNode [2020-07-11 02:27:48,849 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 02:27:48,850 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 02:27:48,850 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 02:27:48,850 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 02:27:48,864 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:48" (1/1) ... [2020-07-11 02:27:48,865 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:48" (1/1) ... [2020-07-11 02:27:48,957 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:48" (1/1) ... [2020-07-11 02:27:48,957 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:48" (1/1) ... [2020-07-11 02:27:48,967 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:48" (1/1) ... [2020-07-11 02:27:48,973 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:48" (1/1) ... [2020-07-11 02:27:48,975 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:48" (1/1) ... [2020-07-11 02:27:48,976 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 02:27:48,977 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 02:27:48,977 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 02:27:48,977 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 02:27:48,980 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:48" (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:49,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 02:27:49,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 02:27:49,051 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-11 02:27:49,051 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 02:27:49,051 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 02:27:49,051 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-11 02:27:49,051 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-07-11 02:27:49,051 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 02:27:49,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 02:27:49,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 02:27:49,274 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 02:27:49,275 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-11 02:27:49,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:27:49 BoogieIcfgContainer [2020-07-11 02:27:49,279 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 02:27:49,280 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 02:27:49,280 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 02:27:49,284 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 02:27:49,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 02:27:48" (1/3) ... [2020-07-11 02:27:49,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69bc4cb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:27:49, skipping insertion in model container [2020-07-11 02:27:49,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:48" (2/3) ... [2020-07-11 02:27:49,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69bc4cb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:27:49, skipping insertion in model container [2020-07-11 02:27:49,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:27:49" (3/3) ... [2020-07-11 02:27:49,288 INFO L109 eAbstractionObserver]: Analyzing ICFG sum01-1.i [2020-07-11 02:27:49,299 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 02:27:49,307 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 02:27:49,329 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 02:27:49,383 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 02:27:49,383 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 02:27:49,383 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 02:27:49,383 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 02:27:49,384 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 02:27:49,384 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 02:27:49,384 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 02:27:49,384 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 02:27:49,407 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2020-07-11 02:27:49,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-11 02:27:49,424 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:27:49,425 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:27:49,426 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:27:49,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:27:49,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1882057920, now seen corresponding path program 1 times [2020-07-11 02:27:49,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:27:49,444 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [20630036] [2020-07-11 02:27:49,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:27:49,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:49,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:49,597 INFO L280 TraceCheckUtils]: 0: Hoare triple {29#true} assume true; {29#true} is VALID [2020-07-11 02:27:49,598 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {29#true} {29#true} #44#return; {29#true} is VALID [2020-07-11 02:27:49,600 INFO L263 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {29#true} is VALID [2020-07-11 02:27:49,601 INFO L280 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2020-07-11 02:27:49,601 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #44#return; {29#true} is VALID [2020-07-11 02:27:49,602 INFO L263 TraceCheckUtils]: 3: Hoare triple {29#true} call #t~ret2 := main(); {29#true} is VALID [2020-07-11 02:27:49,602 INFO L280 TraceCheckUtils]: 4: Hoare triple {29#true} havoc ~i~0; {29#true} is VALID [2020-07-11 02:27:49,603 INFO L280 TraceCheckUtils]: 5: Hoare triple {29#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {29#true} is VALID [2020-07-11 02:27:49,603 INFO L280 TraceCheckUtils]: 6: Hoare triple {29#true} havoc #t~nondet0; {29#true} is VALID [2020-07-11 02:27:49,604 INFO L280 TraceCheckUtils]: 7: Hoare triple {29#true} ~sn~0 := 0; {29#true} is VALID [2020-07-11 02:27:49,604 INFO L280 TraceCheckUtils]: 8: Hoare triple {29#true} ~i~0 := 1; {29#true} is VALID [2020-07-11 02:27:49,606 INFO L280 TraceCheckUtils]: 9: Hoare triple {29#true} assume !true; {30#false} is VALID [2020-07-11 02:27:49,606 INFO L263 TraceCheckUtils]: 10: Hoare triple {30#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {30#false} is VALID [2020-07-11 02:27:49,606 INFO L280 TraceCheckUtils]: 11: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2020-07-11 02:27:49,607 INFO L280 TraceCheckUtils]: 12: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2020-07-11 02:27:49,607 INFO L280 TraceCheckUtils]: 13: Hoare triple {30#false} assume !false; {30#false} is VALID [2020-07-11 02:27:49,609 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:49,609 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [20630036] [2020-07-11 02:27:49,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:27:49,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-11 02:27:49,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217156052] [2020-07-11 02:27:49,620 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2020-07-11 02:27:49,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:27:49,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-11 02:27:49,697 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:49,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-11 02:27:49,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:27:49,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-11 02:27:49,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-11 02:27:49,712 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2020-07-11 02:27:49,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:49,801 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2020-07-11 02:27:49,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-11 02:27:49,802 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2020-07-11 02:27:49,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:27:49,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-11 02:27:49,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 41 transitions. [2020-07-11 02:27:49,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-11 02:27:49,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 41 transitions. [2020-07-11 02:27:49,819 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 41 transitions. [2020-07-11 02:27:49,934 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:49,946 INFO L225 Difference]: With dead ends: 37 [2020-07-11 02:27:49,946 INFO L226 Difference]: Without dead ends: 20 [2020-07-11 02:27:49,950 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:49,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-11 02:27:50,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-11 02:27:50,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:27:50,003 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2020-07-11 02:27:50,003 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-11 02:27:50,004 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-11 02:27:50,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:50,008 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2020-07-11 02:27:50,008 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-07-11 02:27:50,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:50,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:50,009 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-11 02:27:50,010 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-11 02:27:50,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:50,014 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2020-07-11 02:27:50,014 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-07-11 02:27:50,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:50,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:50,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:27:50,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:27:50,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-11 02:27:50,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2020-07-11 02:27:50,020 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 14 [2020-07-11 02:27:50,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:27:50,021 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2020-07-11 02:27:50,021 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-11 02:27:50,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 21 transitions. [2020-07-11 02:27:50,055 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:50,056 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-07-11 02:27:50,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-11 02:27:50,056 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:27:50,057 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:27:50,057 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 02:27:50,057 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:27:50,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:27:50,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1869128626, now seen corresponding path program 1 times [2020-07-11 02:27:50,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:27:50,059 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1578291726] [2020-07-11 02:27:50,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:27:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:50,185 INFO L280 TraceCheckUtils]: 0: Hoare triple {189#true} assume true; {189#true} is VALID [2020-07-11 02:27:50,185 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {189#true} {189#true} #44#return; {189#true} is VALID [2020-07-11 02:27:50,185 INFO L263 TraceCheckUtils]: 0: Hoare triple {189#true} call ULTIMATE.init(); {189#true} is VALID [2020-07-11 02:27:50,186 INFO L280 TraceCheckUtils]: 1: Hoare triple {189#true} assume true; {189#true} is VALID [2020-07-11 02:27:50,186 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {189#true} {189#true} #44#return; {189#true} is VALID [2020-07-11 02:27:50,187 INFO L263 TraceCheckUtils]: 3: Hoare triple {189#true} call #t~ret2 := main(); {189#true} is VALID [2020-07-11 02:27:50,187 INFO L280 TraceCheckUtils]: 4: Hoare triple {189#true} havoc ~i~0; {189#true} is VALID [2020-07-11 02:27:50,187 INFO L280 TraceCheckUtils]: 5: Hoare triple {189#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {189#true} is VALID [2020-07-11 02:27:50,188 INFO L280 TraceCheckUtils]: 6: Hoare triple {189#true} havoc #t~nondet0; {189#true} is VALID [2020-07-11 02:27:50,189 INFO L280 TraceCheckUtils]: 7: Hoare triple {189#true} ~sn~0 := 0; {193#(= 0 main_~sn~0)} is VALID [2020-07-11 02:27:50,190 INFO L280 TraceCheckUtils]: 8: Hoare triple {193#(= 0 main_~sn~0)} ~i~0 := 1; {193#(= 0 main_~sn~0)} is VALID [2020-07-11 02:27:50,191 INFO L280 TraceCheckUtils]: 9: Hoare triple {193#(= 0 main_~sn~0)} assume !(~i~0 <= ~n~0); {193#(= 0 main_~sn~0)} is VALID [2020-07-11 02:27:50,192 INFO L263 TraceCheckUtils]: 10: Hoare triple {193#(= 0 main_~sn~0)} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {194#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:27:50,194 INFO L280 TraceCheckUtils]: 11: Hoare triple {194#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {195#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:27:50,195 INFO L280 TraceCheckUtils]: 12: Hoare triple {195#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {190#false} is VALID [2020-07-11 02:27:50,195 INFO L280 TraceCheckUtils]: 13: Hoare triple {190#false} assume !false; {190#false} is VALID [2020-07-11 02:27:50,197 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:50,197 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1578291726] [2020-07-11 02:27:50,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:27:50,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-11 02:27:50,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597292945] [2020-07-11 02:27:50,200 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-11 02:27:50,200 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:27:50,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 02:27:50,222 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:50,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 02:27:50,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:27:50,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 02:27:50,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-11 02:27:50,224 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 5 states. [2020-07-11 02:27:50,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:50,376 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-07-11 02:27:50,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-11 02:27:50,376 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-11 02:27:50,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:27:50,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:27:50,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-11 02:27:50,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:27:50,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-11 02:27:50,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2020-07-11 02:27:50,429 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:50,431 INFO L225 Difference]: With dead ends: 31 [2020-07-11 02:27:50,432 INFO L226 Difference]: Without dead ends: 26 [2020-07-11 02:27:50,433 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:50,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-11 02:27:50,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2020-07-11 02:27:50,471 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:27:50,471 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 25 states. [2020-07-11 02:27:50,472 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 25 states. [2020-07-11 02:27:50,472 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 25 states. [2020-07-11 02:27:50,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:50,474 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-07-11 02:27:50,475 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-07-11 02:27:50,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:50,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:50,476 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 26 states. [2020-07-11 02:27:50,476 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 26 states. [2020-07-11 02:27:50,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:50,479 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-07-11 02:27:50,479 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-07-11 02:27:50,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:50,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:50,480 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:27:50,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:27:50,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-11 02:27:50,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2020-07-11 02:27:50,482 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 14 [2020-07-11 02:27:50,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:27:50,483 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2020-07-11 02:27:50,483 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 02:27:50,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2020-07-11 02:27:50,518 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:50,518 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-11 02:27:50,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-11 02:27:50,519 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:27:50,519 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] [2020-07-11 02:27:50,520 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 02:27:50,520 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:27:50,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:27:50,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1535432394, now seen corresponding path program 1 times [2020-07-11 02:27:50,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:27:50,521 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [496753740] [2020-07-11 02:27:50,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:27:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:50,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:50,898 INFO L280 TraceCheckUtils]: 0: Hoare triple {364#true} assume true; {364#true} is VALID [2020-07-11 02:27:50,898 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {364#true} {364#true} #44#return; {364#true} is VALID [2020-07-11 02:27:50,899 INFO L263 TraceCheckUtils]: 0: Hoare triple {364#true} call ULTIMATE.init(); {364#true} is VALID [2020-07-11 02:27:50,899 INFO L280 TraceCheckUtils]: 1: Hoare triple {364#true} assume true; {364#true} is VALID [2020-07-11 02:27:50,899 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {364#true} {364#true} #44#return; {364#true} is VALID [2020-07-11 02:27:50,900 INFO L263 TraceCheckUtils]: 3: Hoare triple {364#true} call #t~ret2 := main(); {364#true} is VALID [2020-07-11 02:27:50,900 INFO L280 TraceCheckUtils]: 4: Hoare triple {364#true} havoc ~i~0; {364#true} is VALID [2020-07-11 02:27:50,900 INFO L280 TraceCheckUtils]: 5: Hoare triple {364#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {364#true} is VALID [2020-07-11 02:27:50,900 INFO L280 TraceCheckUtils]: 6: Hoare triple {364#true} havoc #t~nondet0; {364#true} is VALID [2020-07-11 02:27:50,901 INFO L280 TraceCheckUtils]: 7: Hoare triple {364#true} ~sn~0 := 0; {368#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-11 02:27:50,902 INFO L280 TraceCheckUtils]: 8: Hoare triple {368#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} ~i~0 := 1; {369#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-11 02:27:50,904 INFO L280 TraceCheckUtils]: 9: Hoare triple {369#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {370#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-11 02:27:50,905 INFO L280 TraceCheckUtils]: 10: Hoare triple {370#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume ~i~0 < 10; {370#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-11 02:27:50,906 INFO L280 TraceCheckUtils]: 11: Hoare triple {370#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} ~sn~0 := 2 + ~sn~0; {371#(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:50,907 INFO L280 TraceCheckUtils]: 12: Hoare triple {371#(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; {372#(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:50,909 INFO L280 TraceCheckUtils]: 13: Hoare triple {372#(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; {373#(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:50,910 INFO L280 TraceCheckUtils]: 14: Hoare triple {373#(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; {373#(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:50,911 INFO L280 TraceCheckUtils]: 15: Hoare triple {373#(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); {374#(and (<= main_~sn~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~sn~0))} is VALID [2020-07-11 02:27:50,913 INFO L263 TraceCheckUtils]: 16: Hoare triple {374#(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)); {375#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:27:50,914 INFO L280 TraceCheckUtils]: 17: Hoare triple {375#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {376#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:27:50,914 INFO L280 TraceCheckUtils]: 18: Hoare triple {376#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {365#false} is VALID [2020-07-11 02:27:50,915 INFO L280 TraceCheckUtils]: 19: Hoare triple {365#false} assume !false; {365#false} is VALID [2020-07-11 02:27:50,917 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:50,917 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [496753740] [2020-07-11 02:27:50,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:27:50,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-11 02:27:50,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123240092] [2020-07-11 02:27:50,919 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-07-11 02:27:50,919 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:27:50,919 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-11 02:27:50,945 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:50,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-11 02:27:50,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:27:50,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-11 02:27:50,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-07-11 02:27:50,947 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 11 states. [2020-07-11 02:27:51,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:51,543 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2020-07-11 02:27:51,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-11 02:27:51,543 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-07-11 02:27:51,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:27:51,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 02:27:51,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 50 transitions. [2020-07-11 02:27:51,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 02:27:51,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 50 transitions. [2020-07-11 02:27:51,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 50 transitions. [2020-07-11 02:27:51,614 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:51,616 INFO L225 Difference]: With dead ends: 50 [2020-07-11 02:27:51,616 INFO L226 Difference]: Without dead ends: 31 [2020-07-11 02:27:51,617 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:51,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-11 02:27:51,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2020-07-11 02:27:51,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:27:51,660 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 27 states. [2020-07-11 02:27:51,660 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 27 states. [2020-07-11 02:27:51,660 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 27 states. [2020-07-11 02:27:51,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:51,665 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-07-11 02:27:51,666 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-07-11 02:27:51,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:51,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:51,670 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 31 states. [2020-07-11 02:27:51,670 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 31 states. [2020-07-11 02:27:51,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:51,675 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-07-11 02:27:51,675 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-07-11 02:27:51,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:51,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:51,676 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:27:51,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:27:51,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-11 02:27:51,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2020-07-11 02:27:51,681 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 20 [2020-07-11 02:27:51,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:27:51,681 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-07-11 02:27:51,681 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-11 02:27:51,682 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 28 transitions. [2020-07-11 02:27:51,716 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:51,716 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-07-11 02:27:51,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-11 02:27:51,717 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:27:51,717 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:27:51,718 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 02:27:51,718 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:27:51,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:27:51,719 INFO L82 PathProgramCache]: Analyzing trace with hash -927596731, now seen corresponding path program 1 times [2020-07-11 02:27:51,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:27:51,719 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [581032851] [2020-07-11 02:27:51,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:27:51,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:51,795 INFO L280 TraceCheckUtils]: 0: Hoare triple {605#true} assume true; {605#true} is VALID [2020-07-11 02:27:51,795 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {605#true} {605#true} #44#return; {605#true} is VALID [2020-07-11 02:27:51,796 INFO L263 TraceCheckUtils]: 0: Hoare triple {605#true} call ULTIMATE.init(); {605#true} is VALID [2020-07-11 02:27:51,796 INFO L280 TraceCheckUtils]: 1: Hoare triple {605#true} assume true; {605#true} is VALID [2020-07-11 02:27:51,796 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {605#true} {605#true} #44#return; {605#true} is VALID [2020-07-11 02:27:51,797 INFO L263 TraceCheckUtils]: 3: Hoare triple {605#true} call #t~ret2 := main(); {605#true} is VALID [2020-07-11 02:27:51,797 INFO L280 TraceCheckUtils]: 4: Hoare triple {605#true} havoc ~i~0; {605#true} is VALID [2020-07-11 02:27:51,797 INFO L280 TraceCheckUtils]: 5: Hoare triple {605#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {605#true} is VALID [2020-07-11 02:27:51,797 INFO L280 TraceCheckUtils]: 6: Hoare triple {605#true} havoc #t~nondet0; {605#true} is VALID [2020-07-11 02:27:51,798 INFO L280 TraceCheckUtils]: 7: Hoare triple {605#true} ~sn~0 := 0; {605#true} is VALID [2020-07-11 02:27:51,799 INFO L280 TraceCheckUtils]: 8: Hoare triple {605#true} ~i~0 := 1; {609#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:51,800 INFO L280 TraceCheckUtils]: 9: Hoare triple {609#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {609#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:51,801 INFO L280 TraceCheckUtils]: 10: Hoare triple {609#(<= main_~i~0 1)} assume ~i~0 < 10; {609#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:51,801 INFO L280 TraceCheckUtils]: 11: Hoare triple {609#(<= main_~i~0 1)} ~sn~0 := 2 + ~sn~0; {609#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:51,802 INFO L280 TraceCheckUtils]: 12: Hoare triple {609#(<= main_~i~0 1)} #t~post1 := ~i~0; {610#(<= |main_#t~post1| 1)} is VALID [2020-07-11 02:27:51,803 INFO L280 TraceCheckUtils]: 13: Hoare triple {610#(<= |main_#t~post1| 1)} ~i~0 := 1 + #t~post1; {611#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:51,808 INFO L280 TraceCheckUtils]: 14: Hoare triple {611#(<= main_~i~0 2)} havoc #t~post1; {611#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:51,809 INFO L280 TraceCheckUtils]: 15: Hoare triple {611#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {611#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:51,810 INFO L280 TraceCheckUtils]: 16: Hoare triple {611#(<= main_~i~0 2)} assume !(~i~0 < 10); {606#false} is VALID [2020-07-11 02:27:51,810 INFO L280 TraceCheckUtils]: 17: Hoare triple {606#false} #t~post1 := ~i~0; {606#false} is VALID [2020-07-11 02:27:51,811 INFO L280 TraceCheckUtils]: 18: Hoare triple {606#false} ~i~0 := 1 + #t~post1; {606#false} is VALID [2020-07-11 02:27:51,811 INFO L280 TraceCheckUtils]: 19: Hoare triple {606#false} havoc #t~post1; {606#false} is VALID [2020-07-11 02:27:51,811 INFO L280 TraceCheckUtils]: 20: Hoare triple {606#false} assume !(~i~0 <= ~n~0); {606#false} is VALID [2020-07-11 02:27:51,811 INFO L263 TraceCheckUtils]: 21: Hoare triple {606#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {606#false} is VALID [2020-07-11 02:27:51,812 INFO L280 TraceCheckUtils]: 22: Hoare triple {606#false} ~cond := #in~cond; {606#false} is VALID [2020-07-11 02:27:51,812 INFO L280 TraceCheckUtils]: 23: Hoare triple {606#false} assume 0 == ~cond; {606#false} is VALID [2020-07-11 02:27:51,812 INFO L280 TraceCheckUtils]: 24: Hoare triple {606#false} assume !false; {606#false} is VALID [2020-07-11 02:27:51,813 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 02:27:51,814 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [581032851] [2020-07-11 02:27:51,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:27:51,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-07-11 02:27:51,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308581014] [2020-07-11 02:27:51,815 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-07-11 02:27:51,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:27:51,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 02:27:51,840 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:51,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 02:27:51,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:27:51,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 02:27:51,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-11 02:27:51,841 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 5 states. [2020-07-11 02:27:51,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:51,994 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2020-07-11 02:27:51,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 02:27:51,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-07-11 02:27:51,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:27:51,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:27:51,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2020-07-11 02:27:51,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:27:52,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2020-07-11 02:27:52,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2020-07-11 02:27:52,051 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:52,054 INFO L225 Difference]: With dead ends: 42 [2020-07-11 02:27:52,054 INFO L226 Difference]: Without dead ends: 31 [2020-07-11 02:27:52,055 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-11 02:27:52,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-11 02:27:52,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2020-07-11 02:27:52,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:27:52,098 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 28 states. [2020-07-11 02:27:52,098 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 28 states. [2020-07-11 02:27:52,099 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 28 states. [2020-07-11 02:27:52,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:52,101 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-07-11 02:27:52,101 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2020-07-11 02:27:52,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:52,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:52,102 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 31 states. [2020-07-11 02:27:52,102 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 31 states. [2020-07-11 02:27:52,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:52,106 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-07-11 02:27:52,106 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2020-07-11 02:27:52,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:52,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:52,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:27:52,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:27:52,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-11 02:27:52,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2020-07-11 02:27:52,111 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 25 [2020-07-11 02:27:52,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:27:52,113 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2020-07-11 02:27:52,113 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 02:27:52,113 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 29 transitions. [2020-07-11 02:27:52,152 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:52,152 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-11 02:27:52,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-11 02:27:52,154 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:27:52,154 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:27:52,154 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 02:27:52,155 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:27:52,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:27:52,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1778100254, now seen corresponding path program 2 times [2020-07-11 02:27:52,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:27:52,156 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1994650192] [2020-07-11 02:27:52,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:27:52,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:52,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:52,585 INFO L280 TraceCheckUtils]: 0: Hoare triple {820#true} assume true; {820#true} is VALID [2020-07-11 02:27:52,586 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {820#true} {820#true} #44#return; {820#true} is VALID [2020-07-11 02:27:52,586 INFO L263 TraceCheckUtils]: 0: Hoare triple {820#true} call ULTIMATE.init(); {820#true} is VALID [2020-07-11 02:27:52,587 INFO L280 TraceCheckUtils]: 1: Hoare triple {820#true} assume true; {820#true} is VALID [2020-07-11 02:27:52,587 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {820#true} {820#true} #44#return; {820#true} is VALID [2020-07-11 02:27:52,587 INFO L263 TraceCheckUtils]: 3: Hoare triple {820#true} call #t~ret2 := main(); {820#true} is VALID [2020-07-11 02:27:52,587 INFO L280 TraceCheckUtils]: 4: Hoare triple {820#true} havoc ~i~0; {820#true} is VALID [2020-07-11 02:27:52,588 INFO L280 TraceCheckUtils]: 5: Hoare triple {820#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {820#true} is VALID [2020-07-11 02:27:52,588 INFO L280 TraceCheckUtils]: 6: Hoare triple {820#true} havoc #t~nondet0; {820#true} is VALID [2020-07-11 02:27:52,590 INFO L280 TraceCheckUtils]: 7: Hoare triple {820#true} ~sn~0 := 0; {824#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-11 02:27:52,593 INFO L280 TraceCheckUtils]: 8: Hoare triple {824#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} ~i~0 := 1; {825#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-11 02:27:52,594 INFO L280 TraceCheckUtils]: 9: Hoare triple {825#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {825#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-11 02:27:52,595 INFO L280 TraceCheckUtils]: 10: Hoare triple {825#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume ~i~0 < 10; {825#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-11 02:27:52,598 INFO L280 TraceCheckUtils]: 11: Hoare triple {825#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} ~sn~0 := 2 + ~sn~0; {826#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} is VALID [2020-07-11 02:27:52,601 INFO L280 TraceCheckUtils]: 12: Hoare triple {826#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} #t~post1 := ~i~0; {827#(and (<= main_~sn~0 (* 2 |main_#t~post1|)) (<= (* 2 |main_#t~post1|) main_~sn~0))} is VALID [2020-07-11 02:27:52,603 INFO L280 TraceCheckUtils]: 13: Hoare triple {827#(and (<= main_~sn~0 (* 2 |main_#t~post1|)) (<= (* 2 |main_#t~post1|) main_~sn~0))} ~i~0 := 1 + #t~post1; {825#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-11 02:27:52,604 INFO L280 TraceCheckUtils]: 14: Hoare triple {825#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} havoc #t~post1; {825#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-11 02:27:52,604 INFO L280 TraceCheckUtils]: 15: Hoare triple {825#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {828#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-11 02:27:52,605 INFO L280 TraceCheckUtils]: 16: Hoare triple {828#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume ~i~0 < 10; {828#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-11 02:27:52,606 INFO L280 TraceCheckUtils]: 17: Hoare triple {828#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} ~sn~0 := 2 + ~sn~0; {829#(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:52,607 INFO L280 TraceCheckUtils]: 18: Hoare triple {829#(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; {830#(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:52,609 INFO L280 TraceCheckUtils]: 19: Hoare triple {830#(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; {831#(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:52,609 INFO L280 TraceCheckUtils]: 20: Hoare triple {831#(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; {831#(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:52,614 INFO L280 TraceCheckUtils]: 21: Hoare triple {831#(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); {832#(and (<= main_~sn~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~sn~0))} is VALID [2020-07-11 02:27:52,615 INFO L263 TraceCheckUtils]: 22: Hoare triple {832#(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)); {833#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:27:52,616 INFO L280 TraceCheckUtils]: 23: Hoare triple {833#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {834#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:27:52,616 INFO L280 TraceCheckUtils]: 24: Hoare triple {834#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {821#false} is VALID [2020-07-11 02:27:52,616 INFO L280 TraceCheckUtils]: 25: Hoare triple {821#false} assume !false; {821#false} is VALID [2020-07-11 02:27:52,618 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-11 02:27:52,620 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1994650192] [2020-07-11 02:27:52,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:27:52,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-11 02:27:52,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104023842] [2020-07-11 02:27:52,621 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2020-07-11 02:27:52,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:27:52,621 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-11 02:27:52,656 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:52,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-11 02:27:52,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:27:52,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-11 02:27:52,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-07-11 02:27:52,658 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 13 states. [2020-07-11 02:27:53,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:53,429 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2020-07-11 02:27:53,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-11 02:27:53,429 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2020-07-11 02:27:53,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:27:53,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-11 02:27:53,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 38 transitions. [2020-07-11 02:27:53,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-11 02:27:53,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 38 transitions. [2020-07-11 02:27:53,433 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 38 transitions. [2020-07-11 02:27:53,487 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:53,488 INFO L225 Difference]: With dead ends: 41 [2020-07-11 02:27:53,489 INFO L226 Difference]: Without dead ends: 36 [2020-07-11 02:27:53,490 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2020-07-11 02:27:53,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-11 02:27:53,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2020-07-11 02:27:53,554 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:27:53,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 34 states. [2020-07-11 02:27:53,555 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 34 states. [2020-07-11 02:27:53,555 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 34 states. [2020-07-11 02:27:53,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:53,558 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2020-07-11 02:27:53,558 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2020-07-11 02:27:53,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:53,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:53,559 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 36 states. [2020-07-11 02:27:53,559 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 36 states. [2020-07-11 02:27:53,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:53,564 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2020-07-11 02:27:53,564 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2020-07-11 02:27:53,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:53,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:53,565 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:27:53,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:27:53,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-11 02:27:53,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2020-07-11 02:27:53,571 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 26 [2020-07-11 02:27:53,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:27:53,572 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2020-07-11 02:27:53,572 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-11 02:27:53,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 36 transitions. [2020-07-11 02:27:53,631 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:53,631 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2020-07-11 02:27:53,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-11 02:27:53,632 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:27:53,632 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:27:53,632 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-11 02:27:53,632 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:27:53,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:27:53,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1884066515, now seen corresponding path program 2 times [2020-07-11 02:27:53,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:27:53,633 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1288982174] [2020-07-11 02:27:53,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:27:53,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:53,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:53,709 INFO L280 TraceCheckUtils]: 0: Hoare triple {1077#true} assume true; {1077#true} is VALID [2020-07-11 02:27:53,710 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1077#true} {1077#true} #44#return; {1077#true} is VALID [2020-07-11 02:27:53,710 INFO L263 TraceCheckUtils]: 0: Hoare triple {1077#true} call ULTIMATE.init(); {1077#true} is VALID [2020-07-11 02:27:53,711 INFO L280 TraceCheckUtils]: 1: Hoare triple {1077#true} assume true; {1077#true} is VALID [2020-07-11 02:27:53,711 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1077#true} {1077#true} #44#return; {1077#true} is VALID [2020-07-11 02:27:53,711 INFO L263 TraceCheckUtils]: 3: Hoare triple {1077#true} call #t~ret2 := main(); {1077#true} is VALID [2020-07-11 02:27:53,711 INFO L280 TraceCheckUtils]: 4: Hoare triple {1077#true} havoc ~i~0; {1077#true} is VALID [2020-07-11 02:27:53,712 INFO L280 TraceCheckUtils]: 5: Hoare triple {1077#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {1077#true} is VALID [2020-07-11 02:27:53,712 INFO L280 TraceCheckUtils]: 6: Hoare triple {1077#true} havoc #t~nondet0; {1077#true} is VALID [2020-07-11 02:27:53,712 INFO L280 TraceCheckUtils]: 7: Hoare triple {1077#true} ~sn~0 := 0; {1077#true} is VALID [2020-07-11 02:27:53,713 INFO L280 TraceCheckUtils]: 8: Hoare triple {1077#true} ~i~0 := 1; {1081#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:53,714 INFO L280 TraceCheckUtils]: 9: Hoare triple {1081#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {1081#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:53,714 INFO L280 TraceCheckUtils]: 10: Hoare triple {1081#(<= main_~i~0 1)} assume ~i~0 < 10; {1081#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:53,715 INFO L280 TraceCheckUtils]: 11: Hoare triple {1081#(<= main_~i~0 1)} ~sn~0 := 2 + ~sn~0; {1081#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:53,716 INFO L280 TraceCheckUtils]: 12: Hoare triple {1081#(<= main_~i~0 1)} #t~post1 := ~i~0; {1082#(<= |main_#t~post1| 1)} is VALID [2020-07-11 02:27:53,716 INFO L280 TraceCheckUtils]: 13: Hoare triple {1082#(<= |main_#t~post1| 1)} ~i~0 := 1 + #t~post1; {1083#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:53,717 INFO L280 TraceCheckUtils]: 14: Hoare triple {1083#(<= main_~i~0 2)} havoc #t~post1; {1083#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:53,718 INFO L280 TraceCheckUtils]: 15: Hoare triple {1083#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {1083#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:53,718 INFO L280 TraceCheckUtils]: 16: Hoare triple {1083#(<= main_~i~0 2)} assume ~i~0 < 10; {1083#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:53,719 INFO L280 TraceCheckUtils]: 17: Hoare triple {1083#(<= main_~i~0 2)} ~sn~0 := 2 + ~sn~0; {1083#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:53,720 INFO L280 TraceCheckUtils]: 18: Hoare triple {1083#(<= main_~i~0 2)} #t~post1 := ~i~0; {1084#(<= |main_#t~post1| 2)} is VALID [2020-07-11 02:27:53,721 INFO L280 TraceCheckUtils]: 19: Hoare triple {1084#(<= |main_#t~post1| 2)} ~i~0 := 1 + #t~post1; {1085#(<= main_~i~0 3)} is VALID [2020-07-11 02:27:53,721 INFO L280 TraceCheckUtils]: 20: Hoare triple {1085#(<= main_~i~0 3)} havoc #t~post1; {1085#(<= main_~i~0 3)} is VALID [2020-07-11 02:27:53,722 INFO L280 TraceCheckUtils]: 21: Hoare triple {1085#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {1085#(<= main_~i~0 3)} is VALID [2020-07-11 02:27:53,723 INFO L280 TraceCheckUtils]: 22: Hoare triple {1085#(<= main_~i~0 3)} assume !(~i~0 < 10); {1078#false} is VALID [2020-07-11 02:27:53,723 INFO L280 TraceCheckUtils]: 23: Hoare triple {1078#false} #t~post1 := ~i~0; {1078#false} is VALID [2020-07-11 02:27:53,724 INFO L280 TraceCheckUtils]: 24: Hoare triple {1078#false} ~i~0 := 1 + #t~post1; {1078#false} is VALID [2020-07-11 02:27:53,724 INFO L280 TraceCheckUtils]: 25: Hoare triple {1078#false} havoc #t~post1; {1078#false} is VALID [2020-07-11 02:27:53,724 INFO L280 TraceCheckUtils]: 26: Hoare triple {1078#false} assume !(~i~0 <= ~n~0); {1078#false} is VALID [2020-07-11 02:27:53,724 INFO L263 TraceCheckUtils]: 27: Hoare triple {1078#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1078#false} is VALID [2020-07-11 02:27:53,725 INFO L280 TraceCheckUtils]: 28: Hoare triple {1078#false} ~cond := #in~cond; {1078#false} is VALID [2020-07-11 02:27:53,725 INFO L280 TraceCheckUtils]: 29: Hoare triple {1078#false} assume 0 == ~cond; {1078#false} is VALID [2020-07-11 02:27:53,725 INFO L280 TraceCheckUtils]: 30: Hoare triple {1078#false} assume !false; {1078#false} is VALID [2020-07-11 02:27:53,727 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 02:27:53,727 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1288982174] [2020-07-11 02:27:53,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:27:53,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-11 02:27:53,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075029381] [2020-07-11 02:27:53,728 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2020-07-11 02:27:53,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:27:53,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-11 02:27:53,778 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:53,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-11 02:27:53,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:27:53,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-11 02:27:53,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-11 02:27:53,779 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 7 states. [2020-07-11 02:27:54,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:54,025 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2020-07-11 02:27:54,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-11 02:27:54,025 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2020-07-11 02:27:54,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:27:54,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 02:27:54,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2020-07-11 02:27:54,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 02:27:54,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2020-07-11 02:27:54,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 51 transitions. [2020-07-11 02:27:54,076 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:54,078 INFO L225 Difference]: With dead ends: 54 [2020-07-11 02:27:54,078 INFO L226 Difference]: Without dead ends: 43 [2020-07-11 02:27:54,079 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2020-07-11 02:27:54,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-11 02:27:54,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2020-07-11 02:27:54,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:27:54,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 40 states. [2020-07-11 02:27:54,152 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 40 states. [2020-07-11 02:27:54,152 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 40 states. [2020-07-11 02:27:54,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:54,155 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2020-07-11 02:27:54,155 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2020-07-11 02:27:54,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:54,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:54,156 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 43 states. [2020-07-11 02:27:54,156 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 43 states. [2020-07-11 02:27:54,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:54,158 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2020-07-11 02:27:54,158 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2020-07-11 02:27:54,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:54,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:54,159 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:27:54,159 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:27:54,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-11 02:27:54,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2020-07-11 02:27:54,161 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 31 [2020-07-11 02:27:54,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:27:54,162 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2020-07-11 02:27:54,162 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-11 02:27:54,162 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 42 transitions. [2020-07-11 02:27:54,221 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:54,221 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2020-07-11 02:27:54,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-11 02:27:54,223 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:27:54,223 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:27:54,223 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-11 02:27:54,223 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:27:54,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:27:54,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1557187861, now seen corresponding path program 3 times [2020-07-11 02:27:54,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:27:54,225 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [500423110] [2020-07-11 02:27:54,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:27:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:54,353 INFO L280 TraceCheckUtils]: 0: Hoare triple {1370#true} assume true; {1370#true} is VALID [2020-07-11 02:27:54,353 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1370#true} {1370#true} #44#return; {1370#true} is VALID [2020-07-11 02:27:54,353 INFO L263 TraceCheckUtils]: 0: Hoare triple {1370#true} call ULTIMATE.init(); {1370#true} is VALID [2020-07-11 02:27:54,354 INFO L280 TraceCheckUtils]: 1: Hoare triple {1370#true} assume true; {1370#true} is VALID [2020-07-11 02:27:54,354 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1370#true} {1370#true} #44#return; {1370#true} is VALID [2020-07-11 02:27:54,354 INFO L263 TraceCheckUtils]: 3: Hoare triple {1370#true} call #t~ret2 := main(); {1370#true} is VALID [2020-07-11 02:27:54,354 INFO L280 TraceCheckUtils]: 4: Hoare triple {1370#true} havoc ~i~0; {1370#true} is VALID [2020-07-11 02:27:54,354 INFO L280 TraceCheckUtils]: 5: Hoare triple {1370#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {1370#true} is VALID [2020-07-11 02:27:54,354 INFO L280 TraceCheckUtils]: 6: Hoare triple {1370#true} havoc #t~nondet0; {1370#true} is VALID [2020-07-11 02:27:54,355 INFO L280 TraceCheckUtils]: 7: Hoare triple {1370#true} ~sn~0 := 0; {1370#true} is VALID [2020-07-11 02:27:54,355 INFO L280 TraceCheckUtils]: 8: Hoare triple {1370#true} ~i~0 := 1; {1374#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:54,356 INFO L280 TraceCheckUtils]: 9: Hoare triple {1374#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {1374#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:54,356 INFO L280 TraceCheckUtils]: 10: Hoare triple {1374#(<= main_~i~0 1)} assume ~i~0 < 10; {1374#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:54,356 INFO L280 TraceCheckUtils]: 11: Hoare triple {1374#(<= main_~i~0 1)} ~sn~0 := 2 + ~sn~0; {1374#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:54,357 INFO L280 TraceCheckUtils]: 12: Hoare triple {1374#(<= main_~i~0 1)} #t~post1 := ~i~0; {1375#(<= |main_#t~post1| 1)} is VALID [2020-07-11 02:27:54,357 INFO L280 TraceCheckUtils]: 13: Hoare triple {1375#(<= |main_#t~post1| 1)} ~i~0 := 1 + #t~post1; {1376#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:54,358 INFO L280 TraceCheckUtils]: 14: Hoare triple {1376#(<= main_~i~0 2)} havoc #t~post1; {1376#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:54,358 INFO L280 TraceCheckUtils]: 15: Hoare triple {1376#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {1376#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:54,359 INFO L280 TraceCheckUtils]: 16: Hoare triple {1376#(<= main_~i~0 2)} assume ~i~0 < 10; {1376#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:54,359 INFO L280 TraceCheckUtils]: 17: Hoare triple {1376#(<= main_~i~0 2)} ~sn~0 := 2 + ~sn~0; {1376#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:54,360 INFO L280 TraceCheckUtils]: 18: Hoare triple {1376#(<= main_~i~0 2)} #t~post1 := ~i~0; {1377#(<= |main_#t~post1| 2)} is VALID [2020-07-11 02:27:54,360 INFO L280 TraceCheckUtils]: 19: Hoare triple {1377#(<= |main_#t~post1| 2)} ~i~0 := 1 + #t~post1; {1378#(<= main_~i~0 3)} is VALID [2020-07-11 02:27:54,361 INFO L280 TraceCheckUtils]: 20: Hoare triple {1378#(<= main_~i~0 3)} havoc #t~post1; {1378#(<= main_~i~0 3)} is VALID [2020-07-11 02:27:54,361 INFO L280 TraceCheckUtils]: 21: Hoare triple {1378#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {1378#(<= main_~i~0 3)} is VALID [2020-07-11 02:27:54,361 INFO L280 TraceCheckUtils]: 22: Hoare triple {1378#(<= main_~i~0 3)} assume ~i~0 < 10; {1378#(<= main_~i~0 3)} is VALID [2020-07-11 02:27:54,362 INFO L280 TraceCheckUtils]: 23: Hoare triple {1378#(<= main_~i~0 3)} ~sn~0 := 2 + ~sn~0; {1378#(<= main_~i~0 3)} is VALID [2020-07-11 02:27:54,362 INFO L280 TraceCheckUtils]: 24: Hoare triple {1378#(<= main_~i~0 3)} #t~post1 := ~i~0; {1379#(<= |main_#t~post1| 3)} is VALID [2020-07-11 02:27:54,363 INFO L280 TraceCheckUtils]: 25: Hoare triple {1379#(<= |main_#t~post1| 3)} ~i~0 := 1 + #t~post1; {1380#(<= main_~i~0 4)} is VALID [2020-07-11 02:27:54,364 INFO L280 TraceCheckUtils]: 26: Hoare triple {1380#(<= main_~i~0 4)} havoc #t~post1; {1380#(<= main_~i~0 4)} is VALID [2020-07-11 02:27:54,364 INFO L280 TraceCheckUtils]: 27: Hoare triple {1380#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {1380#(<= main_~i~0 4)} is VALID [2020-07-11 02:27:54,365 INFO L280 TraceCheckUtils]: 28: Hoare triple {1380#(<= main_~i~0 4)} assume !(~i~0 < 10); {1371#false} is VALID [2020-07-11 02:27:54,365 INFO L280 TraceCheckUtils]: 29: Hoare triple {1371#false} #t~post1 := ~i~0; {1371#false} is VALID [2020-07-11 02:27:54,365 INFO L280 TraceCheckUtils]: 30: Hoare triple {1371#false} ~i~0 := 1 + #t~post1; {1371#false} is VALID [2020-07-11 02:27:54,366 INFO L280 TraceCheckUtils]: 31: Hoare triple {1371#false} havoc #t~post1; {1371#false} is VALID [2020-07-11 02:27:54,366 INFO L280 TraceCheckUtils]: 32: Hoare triple {1371#false} assume !(~i~0 <= ~n~0); {1371#false} is VALID [2020-07-11 02:27:54,367 INFO L263 TraceCheckUtils]: 33: Hoare triple {1371#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1371#false} is VALID [2020-07-11 02:27:54,367 INFO L280 TraceCheckUtils]: 34: Hoare triple {1371#false} ~cond := #in~cond; {1371#false} is VALID [2020-07-11 02:27:54,367 INFO L280 TraceCheckUtils]: 35: Hoare triple {1371#false} assume 0 == ~cond; {1371#false} is VALID [2020-07-11 02:27:54,367 INFO L280 TraceCheckUtils]: 36: Hoare triple {1371#false} assume !false; {1371#false} is VALID [2020-07-11 02:27:54,369 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 13 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 02:27:54,369 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [500423110] [2020-07-11 02:27:54,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:27:54,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-11 02:27:54,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697182564] [2020-07-11 02:27:54,370 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2020-07-11 02:27:54,371 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:27:54,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-11 02:27:54,412 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:54,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-11 02:27:54,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:27:54,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-11 02:27:54,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-11 02:27:54,413 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 9 states. [2020-07-11 02:27:54,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:54,758 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2020-07-11 02:27:54,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-11 02:27:54,759 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2020-07-11 02:27:54,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:27:54,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-11 02:27:54,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 57 transitions. [2020-07-11 02:27:54,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-11 02:27:54,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 57 transitions. [2020-07-11 02:27:54,764 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 57 transitions. [2020-07-11 02:27:54,820 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:54,821 INFO L225 Difference]: With dead ends: 60 [2020-07-11 02:27:54,821 INFO L226 Difference]: Without dead ends: 49 [2020-07-11 02:27:54,822 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2020-07-11 02:27:54,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-11 02:27:54,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2020-07-11 02:27:54,926 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:27:54,926 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 46 states. [2020-07-11 02:27:54,926 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 46 states. [2020-07-11 02:27:54,926 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 46 states. [2020-07-11 02:27:54,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:54,929 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2020-07-11 02:27:54,929 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2020-07-11 02:27:54,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:54,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:54,930 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 49 states. [2020-07-11 02:27:54,930 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 49 states. [2020-07-11 02:27:54,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:54,933 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2020-07-11 02:27:54,933 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2020-07-11 02:27:54,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:54,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:54,934 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:27:54,934 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:27:54,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-11 02:27:54,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2020-07-11 02:27:54,937 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 37 [2020-07-11 02:27:54,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:27:54,937 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2020-07-11 02:27:54,937 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-11 02:27:54,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states and 48 transitions. [2020-07-11 02:27:55,020 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:55,021 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2020-07-11 02:27:55,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-11 02:27:55,021 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:27:55,022 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:27:55,022 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-11 02:27:55,022 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:27:55,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:27:55,022 INFO L82 PathProgramCache]: Analyzing trace with hash -2133811459, now seen corresponding path program 4 times [2020-07-11 02:27:55,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:27:55,023 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [347252379] [2020-07-11 02:27:55,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:27:55,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:55,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:55,153 INFO L280 TraceCheckUtils]: 0: Hoare triple {1705#true} assume true; {1705#true} is VALID [2020-07-11 02:27:55,153 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1705#true} {1705#true} #44#return; {1705#true} is VALID [2020-07-11 02:27:55,153 INFO L263 TraceCheckUtils]: 0: Hoare triple {1705#true} call ULTIMATE.init(); {1705#true} is VALID [2020-07-11 02:27:55,153 INFO L280 TraceCheckUtils]: 1: Hoare triple {1705#true} assume true; {1705#true} is VALID [2020-07-11 02:27:55,154 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1705#true} {1705#true} #44#return; {1705#true} is VALID [2020-07-11 02:27:55,154 INFO L263 TraceCheckUtils]: 3: Hoare triple {1705#true} call #t~ret2 := main(); {1705#true} is VALID [2020-07-11 02:27:55,154 INFO L280 TraceCheckUtils]: 4: Hoare triple {1705#true} havoc ~i~0; {1705#true} is VALID [2020-07-11 02:27:55,154 INFO L280 TraceCheckUtils]: 5: Hoare triple {1705#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {1705#true} is VALID [2020-07-11 02:27:55,154 INFO L280 TraceCheckUtils]: 6: Hoare triple {1705#true} havoc #t~nondet0; {1705#true} is VALID [2020-07-11 02:27:55,155 INFO L280 TraceCheckUtils]: 7: Hoare triple {1705#true} ~sn~0 := 0; {1705#true} is VALID [2020-07-11 02:27:55,155 INFO L280 TraceCheckUtils]: 8: Hoare triple {1705#true} ~i~0 := 1; {1709#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:55,159 INFO L280 TraceCheckUtils]: 9: Hoare triple {1709#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {1709#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:55,159 INFO L280 TraceCheckUtils]: 10: Hoare triple {1709#(<= main_~i~0 1)} assume ~i~0 < 10; {1709#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:55,160 INFO L280 TraceCheckUtils]: 11: Hoare triple {1709#(<= main_~i~0 1)} ~sn~0 := 2 + ~sn~0; {1709#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:55,160 INFO L280 TraceCheckUtils]: 12: Hoare triple {1709#(<= main_~i~0 1)} #t~post1 := ~i~0; {1710#(<= |main_#t~post1| 1)} is VALID [2020-07-11 02:27:55,161 INFO L280 TraceCheckUtils]: 13: Hoare triple {1710#(<= |main_#t~post1| 1)} ~i~0 := 1 + #t~post1; {1711#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:55,161 INFO L280 TraceCheckUtils]: 14: Hoare triple {1711#(<= main_~i~0 2)} havoc #t~post1; {1711#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:55,161 INFO L280 TraceCheckUtils]: 15: Hoare triple {1711#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {1711#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:55,162 INFO L280 TraceCheckUtils]: 16: Hoare triple {1711#(<= main_~i~0 2)} assume ~i~0 < 10; {1711#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:55,162 INFO L280 TraceCheckUtils]: 17: Hoare triple {1711#(<= main_~i~0 2)} ~sn~0 := 2 + ~sn~0; {1711#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:55,163 INFO L280 TraceCheckUtils]: 18: Hoare triple {1711#(<= main_~i~0 2)} #t~post1 := ~i~0; {1712#(<= |main_#t~post1| 2)} is VALID [2020-07-11 02:27:55,168 INFO L280 TraceCheckUtils]: 19: Hoare triple {1712#(<= |main_#t~post1| 2)} ~i~0 := 1 + #t~post1; {1713#(<= main_~i~0 3)} is VALID [2020-07-11 02:27:55,169 INFO L280 TraceCheckUtils]: 20: Hoare triple {1713#(<= main_~i~0 3)} havoc #t~post1; {1713#(<= main_~i~0 3)} is VALID [2020-07-11 02:27:55,169 INFO L280 TraceCheckUtils]: 21: Hoare triple {1713#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {1713#(<= main_~i~0 3)} is VALID [2020-07-11 02:27:55,169 INFO L280 TraceCheckUtils]: 22: Hoare triple {1713#(<= main_~i~0 3)} assume ~i~0 < 10; {1713#(<= main_~i~0 3)} is VALID [2020-07-11 02:27:55,170 INFO L280 TraceCheckUtils]: 23: Hoare triple {1713#(<= main_~i~0 3)} ~sn~0 := 2 + ~sn~0; {1713#(<= main_~i~0 3)} is VALID [2020-07-11 02:27:55,170 INFO L280 TraceCheckUtils]: 24: Hoare triple {1713#(<= main_~i~0 3)} #t~post1 := ~i~0; {1714#(<= |main_#t~post1| 3)} is VALID [2020-07-11 02:27:55,171 INFO L280 TraceCheckUtils]: 25: Hoare triple {1714#(<= |main_#t~post1| 3)} ~i~0 := 1 + #t~post1; {1715#(<= main_~i~0 4)} is VALID [2020-07-11 02:27:55,171 INFO L280 TraceCheckUtils]: 26: Hoare triple {1715#(<= main_~i~0 4)} havoc #t~post1; {1715#(<= main_~i~0 4)} is VALID [2020-07-11 02:27:55,172 INFO L280 TraceCheckUtils]: 27: Hoare triple {1715#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {1715#(<= main_~i~0 4)} is VALID [2020-07-11 02:27:55,172 INFO L280 TraceCheckUtils]: 28: Hoare triple {1715#(<= main_~i~0 4)} assume ~i~0 < 10; {1715#(<= main_~i~0 4)} is VALID [2020-07-11 02:27:55,173 INFO L280 TraceCheckUtils]: 29: Hoare triple {1715#(<= main_~i~0 4)} ~sn~0 := 2 + ~sn~0; {1715#(<= main_~i~0 4)} is VALID [2020-07-11 02:27:55,173 INFO L280 TraceCheckUtils]: 30: Hoare triple {1715#(<= main_~i~0 4)} #t~post1 := ~i~0; {1716#(<= |main_#t~post1| 4)} is VALID [2020-07-11 02:27:55,174 INFO L280 TraceCheckUtils]: 31: Hoare triple {1716#(<= |main_#t~post1| 4)} ~i~0 := 1 + #t~post1; {1717#(<= main_~i~0 5)} is VALID [2020-07-11 02:27:55,174 INFO L280 TraceCheckUtils]: 32: Hoare triple {1717#(<= main_~i~0 5)} havoc #t~post1; {1717#(<= main_~i~0 5)} is VALID [2020-07-11 02:27:55,175 INFO L280 TraceCheckUtils]: 33: Hoare triple {1717#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {1717#(<= main_~i~0 5)} is VALID [2020-07-11 02:27:55,175 INFO L280 TraceCheckUtils]: 34: Hoare triple {1717#(<= main_~i~0 5)} assume !(~i~0 < 10); {1706#false} is VALID [2020-07-11 02:27:55,175 INFO L280 TraceCheckUtils]: 35: Hoare triple {1706#false} #t~post1 := ~i~0; {1706#false} is VALID [2020-07-11 02:27:55,176 INFO L280 TraceCheckUtils]: 36: Hoare triple {1706#false} ~i~0 := 1 + #t~post1; {1706#false} is VALID [2020-07-11 02:27:55,176 INFO L280 TraceCheckUtils]: 37: Hoare triple {1706#false} havoc #t~post1; {1706#false} is VALID [2020-07-11 02:27:55,176 INFO L280 TraceCheckUtils]: 38: Hoare triple {1706#false} assume !(~i~0 <= ~n~0); {1706#false} is VALID [2020-07-11 02:27:55,177 INFO L263 TraceCheckUtils]: 39: Hoare triple {1706#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1706#false} is VALID [2020-07-11 02:27:55,177 INFO L280 TraceCheckUtils]: 40: Hoare triple {1706#false} ~cond := #in~cond; {1706#false} is VALID [2020-07-11 02:27:55,177 INFO L280 TraceCheckUtils]: 41: Hoare triple {1706#false} assume 0 == ~cond; {1706#false} is VALID [2020-07-11 02:27:55,178 INFO L280 TraceCheckUtils]: 42: Hoare triple {1706#false} assume !false; {1706#false} is VALID [2020-07-11 02:27:55,180 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 17 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 02:27:55,180 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [347252379] [2020-07-11 02:27:55,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:27:55,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-11 02:27:55,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109303443] [2020-07-11 02:27:55,181 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2020-07-11 02:27:55,182 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:27:55,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-11 02:27:55,233 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:55,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-11 02:27:55,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:27:55,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-11 02:27:55,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-07-11 02:27:55,235 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 11 states. [2020-07-11 02:27:55,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:55,599 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2020-07-11 02:27:55,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-11 02:27:55,599 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2020-07-11 02:27:55,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:27:55,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 02:27:55,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 63 transitions. [2020-07-11 02:27:55,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 02:27:55,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 63 transitions. [2020-07-11 02:27:55,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 63 transitions. [2020-07-11 02:27:55,676 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:55,678 INFO L225 Difference]: With dead ends: 66 [2020-07-11 02:27:55,678 INFO L226 Difference]: Without dead ends: 55 [2020-07-11 02:27:55,679 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2020-07-11 02:27:55,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-11 02:27:55,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2020-07-11 02:27:55,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:27:55,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 52 states. [2020-07-11 02:27:55,780 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 52 states. [2020-07-11 02:27:55,780 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 52 states. [2020-07-11 02:27:55,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:55,782 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2020-07-11 02:27:55,782 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2020-07-11 02:27:55,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:55,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:55,783 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 55 states. [2020-07-11 02:27:55,783 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 55 states. [2020-07-11 02:27:55,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:55,785 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2020-07-11 02:27:55,786 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2020-07-11 02:27:55,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:55,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:55,786 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:27:55,786 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:27:55,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-11 02:27:55,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2020-07-11 02:27:55,788 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 43 [2020-07-11 02:27:55,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:27:55,789 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2020-07-11 02:27:55,789 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-11 02:27:55,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states and 54 transitions. [2020-07-11 02:27:55,866 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:55,866 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2020-07-11 02:27:55,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-11 02:27:55,868 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:27:55,868 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:27:55,868 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-11 02:27:55,869 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:27:55,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:27:55,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1351967461, now seen corresponding path program 5 times [2020-07-11 02:27:55,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:27:55,870 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [736115091] [2020-07-11 02:27:55,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:27:55,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:56,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:56,039 INFO L280 TraceCheckUtils]: 0: Hoare triple {2082#true} assume true; {2082#true} is VALID [2020-07-11 02:27:56,039 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2082#true} {2082#true} #44#return; {2082#true} is VALID [2020-07-11 02:27:56,040 INFO L263 TraceCheckUtils]: 0: Hoare triple {2082#true} call ULTIMATE.init(); {2082#true} is VALID [2020-07-11 02:27:56,040 INFO L280 TraceCheckUtils]: 1: Hoare triple {2082#true} assume true; {2082#true} is VALID [2020-07-11 02:27:56,040 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2082#true} {2082#true} #44#return; {2082#true} is VALID [2020-07-11 02:27:56,040 INFO L263 TraceCheckUtils]: 3: Hoare triple {2082#true} call #t~ret2 := main(); {2082#true} is VALID [2020-07-11 02:27:56,040 INFO L280 TraceCheckUtils]: 4: Hoare triple {2082#true} havoc ~i~0; {2082#true} is VALID [2020-07-11 02:27:56,041 INFO L280 TraceCheckUtils]: 5: Hoare triple {2082#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {2082#true} is VALID [2020-07-11 02:27:56,041 INFO L280 TraceCheckUtils]: 6: Hoare triple {2082#true} havoc #t~nondet0; {2082#true} is VALID [2020-07-11 02:27:56,041 INFO L280 TraceCheckUtils]: 7: Hoare triple {2082#true} ~sn~0 := 0; {2082#true} is VALID [2020-07-11 02:27:56,041 INFO L280 TraceCheckUtils]: 8: Hoare triple {2082#true} ~i~0 := 1; {2086#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:56,042 INFO L280 TraceCheckUtils]: 9: Hoare triple {2086#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {2086#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:56,042 INFO L280 TraceCheckUtils]: 10: Hoare triple {2086#(<= main_~i~0 1)} assume ~i~0 < 10; {2086#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:56,043 INFO L280 TraceCheckUtils]: 11: Hoare triple {2086#(<= main_~i~0 1)} ~sn~0 := 2 + ~sn~0; {2086#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:56,043 INFO L280 TraceCheckUtils]: 12: Hoare triple {2086#(<= main_~i~0 1)} #t~post1 := ~i~0; {2087#(<= |main_#t~post1| 1)} is VALID [2020-07-11 02:27:56,052 INFO L280 TraceCheckUtils]: 13: Hoare triple {2087#(<= |main_#t~post1| 1)} ~i~0 := 1 + #t~post1; {2088#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:56,052 INFO L280 TraceCheckUtils]: 14: Hoare triple {2088#(<= main_~i~0 2)} havoc #t~post1; {2088#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:56,053 INFO L280 TraceCheckUtils]: 15: Hoare triple {2088#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {2088#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:56,053 INFO L280 TraceCheckUtils]: 16: Hoare triple {2088#(<= main_~i~0 2)} assume ~i~0 < 10; {2088#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:56,053 INFO L280 TraceCheckUtils]: 17: Hoare triple {2088#(<= main_~i~0 2)} ~sn~0 := 2 + ~sn~0; {2088#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:56,054 INFO L280 TraceCheckUtils]: 18: Hoare triple {2088#(<= main_~i~0 2)} #t~post1 := ~i~0; {2089#(<= |main_#t~post1| 2)} is VALID [2020-07-11 02:27:56,055 INFO L280 TraceCheckUtils]: 19: Hoare triple {2089#(<= |main_#t~post1| 2)} ~i~0 := 1 + #t~post1; {2090#(<= main_~i~0 3)} is VALID [2020-07-11 02:27:56,056 INFO L280 TraceCheckUtils]: 20: Hoare triple {2090#(<= main_~i~0 3)} havoc #t~post1; {2090#(<= main_~i~0 3)} is VALID [2020-07-11 02:27:56,056 INFO L280 TraceCheckUtils]: 21: Hoare triple {2090#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {2090#(<= main_~i~0 3)} is VALID [2020-07-11 02:27:56,056 INFO L280 TraceCheckUtils]: 22: Hoare triple {2090#(<= main_~i~0 3)} assume ~i~0 < 10; {2090#(<= main_~i~0 3)} is VALID [2020-07-11 02:27:56,057 INFO L280 TraceCheckUtils]: 23: Hoare triple {2090#(<= main_~i~0 3)} ~sn~0 := 2 + ~sn~0; {2090#(<= main_~i~0 3)} is VALID [2020-07-11 02:27:56,058 INFO L280 TraceCheckUtils]: 24: Hoare triple {2090#(<= main_~i~0 3)} #t~post1 := ~i~0; {2091#(<= |main_#t~post1| 3)} is VALID [2020-07-11 02:27:56,059 INFO L280 TraceCheckUtils]: 25: Hoare triple {2091#(<= |main_#t~post1| 3)} ~i~0 := 1 + #t~post1; {2092#(<= main_~i~0 4)} is VALID [2020-07-11 02:27:56,062 INFO L280 TraceCheckUtils]: 26: Hoare triple {2092#(<= main_~i~0 4)} havoc #t~post1; {2092#(<= main_~i~0 4)} is VALID [2020-07-11 02:27:56,065 INFO L280 TraceCheckUtils]: 27: Hoare triple {2092#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {2092#(<= main_~i~0 4)} is VALID [2020-07-11 02:27:56,066 INFO L280 TraceCheckUtils]: 28: Hoare triple {2092#(<= main_~i~0 4)} assume ~i~0 < 10; {2092#(<= main_~i~0 4)} is VALID [2020-07-11 02:27:56,067 INFO L280 TraceCheckUtils]: 29: Hoare triple {2092#(<= main_~i~0 4)} ~sn~0 := 2 + ~sn~0; {2092#(<= main_~i~0 4)} is VALID [2020-07-11 02:27:56,067 INFO L280 TraceCheckUtils]: 30: Hoare triple {2092#(<= main_~i~0 4)} #t~post1 := ~i~0; {2093#(<= |main_#t~post1| 4)} is VALID [2020-07-11 02:27:56,068 INFO L280 TraceCheckUtils]: 31: Hoare triple {2093#(<= |main_#t~post1| 4)} ~i~0 := 1 + #t~post1; {2094#(<= main_~i~0 5)} is VALID [2020-07-11 02:27:56,068 INFO L280 TraceCheckUtils]: 32: Hoare triple {2094#(<= main_~i~0 5)} havoc #t~post1; {2094#(<= main_~i~0 5)} is VALID [2020-07-11 02:27:56,069 INFO L280 TraceCheckUtils]: 33: Hoare triple {2094#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {2094#(<= main_~i~0 5)} is VALID [2020-07-11 02:27:56,069 INFO L280 TraceCheckUtils]: 34: Hoare triple {2094#(<= main_~i~0 5)} assume ~i~0 < 10; {2094#(<= main_~i~0 5)} is VALID [2020-07-11 02:27:56,069 INFO L280 TraceCheckUtils]: 35: Hoare triple {2094#(<= main_~i~0 5)} ~sn~0 := 2 + ~sn~0; {2094#(<= main_~i~0 5)} is VALID [2020-07-11 02:27:56,070 INFO L280 TraceCheckUtils]: 36: Hoare triple {2094#(<= main_~i~0 5)} #t~post1 := ~i~0; {2095#(<= |main_#t~post1| 5)} is VALID [2020-07-11 02:27:56,070 INFO L280 TraceCheckUtils]: 37: Hoare triple {2095#(<= |main_#t~post1| 5)} ~i~0 := 1 + #t~post1; {2096#(<= main_~i~0 6)} is VALID [2020-07-11 02:27:56,071 INFO L280 TraceCheckUtils]: 38: Hoare triple {2096#(<= main_~i~0 6)} havoc #t~post1; {2096#(<= main_~i~0 6)} is VALID [2020-07-11 02:27:56,071 INFO L280 TraceCheckUtils]: 39: Hoare triple {2096#(<= main_~i~0 6)} assume !!(~i~0 <= ~n~0); {2096#(<= main_~i~0 6)} is VALID [2020-07-11 02:27:56,072 INFO L280 TraceCheckUtils]: 40: Hoare triple {2096#(<= main_~i~0 6)} assume !(~i~0 < 10); {2083#false} is VALID [2020-07-11 02:27:56,072 INFO L280 TraceCheckUtils]: 41: Hoare triple {2083#false} #t~post1 := ~i~0; {2083#false} is VALID [2020-07-11 02:27:56,072 INFO L280 TraceCheckUtils]: 42: Hoare triple {2083#false} ~i~0 := 1 + #t~post1; {2083#false} is VALID [2020-07-11 02:27:56,072 INFO L280 TraceCheckUtils]: 43: Hoare triple {2083#false} havoc #t~post1; {2083#false} is VALID [2020-07-11 02:27:56,072 INFO L280 TraceCheckUtils]: 44: Hoare triple {2083#false} assume !(~i~0 <= ~n~0); {2083#false} is VALID [2020-07-11 02:27:56,073 INFO L263 TraceCheckUtils]: 45: Hoare triple {2083#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {2083#false} is VALID [2020-07-11 02:27:56,073 INFO L280 TraceCheckUtils]: 46: Hoare triple {2083#false} ~cond := #in~cond; {2083#false} is VALID [2020-07-11 02:27:56,073 INFO L280 TraceCheckUtils]: 47: Hoare triple {2083#false} assume 0 == ~cond; {2083#false} is VALID [2020-07-11 02:27:56,073 INFO L280 TraceCheckUtils]: 48: Hoare triple {2083#false} assume !false; {2083#false} is VALID [2020-07-11 02:27:56,075 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 21 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 02:27:56,075 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [736115091] [2020-07-11 02:27:56,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:27:56,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-11 02:27:56,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169498005] [2020-07-11 02:27:56,076 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 49 [2020-07-11 02:27:56,076 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:27:56,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-11 02:27:56,128 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:56,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-11 02:27:56,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:27:56,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-11 02:27:56,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-07-11 02:27:56,129 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 13 states. [2020-07-11 02:27:56,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:56,592 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2020-07-11 02:27:56,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-11 02:27:56,592 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 49 [2020-07-11 02:27:56,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:27:56,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-11 02:27:56,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 69 transitions. [2020-07-11 02:27:56,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-11 02:27:56,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 69 transitions. [2020-07-11 02:27:56,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 69 transitions. [2020-07-11 02:27:56,671 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:56,673 INFO L225 Difference]: With dead ends: 72 [2020-07-11 02:27:56,673 INFO L226 Difference]: Without dead ends: 61 [2020-07-11 02:27:56,674 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=328, Unknown=0, NotChecked=0, Total=506 [2020-07-11 02:27:56,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-07-11 02:27:56,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2020-07-11 02:27:56,794 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:27:56,794 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 58 states. [2020-07-11 02:27:56,794 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 58 states. [2020-07-11 02:27:56,794 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 58 states. [2020-07-11 02:27:56,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:56,797 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2020-07-11 02:27:56,797 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2020-07-11 02:27:56,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:56,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:56,798 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 61 states. [2020-07-11 02:27:56,798 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 61 states. [2020-07-11 02:27:56,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:56,800 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2020-07-11 02:27:56,800 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2020-07-11 02:27:56,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:56,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:56,802 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:27:56,802 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:27:56,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-07-11 02:27:56,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2020-07-11 02:27:56,805 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 49 [2020-07-11 02:27:56,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:27:56,805 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2020-07-11 02:27:56,805 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-11 02:27:56,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 58 states and 60 transitions. [2020-07-11 02:27:56,875 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:56,876 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2020-07-11 02:27:56,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-11 02:27:56,877 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:27:56,877 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:27:56,877 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-11 02:27:56,877 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:27:56,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:27:56,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1927178035, now seen corresponding path program 6 times [2020-07-11 02:27:56,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:27:56,878 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [830205305] [2020-07-11 02:27:56,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:27:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:57,067 INFO L280 TraceCheckUtils]: 0: Hoare triple {2501#true} assume true; {2501#true} is VALID [2020-07-11 02:27:57,068 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2501#true} {2501#true} #44#return; {2501#true} is VALID [2020-07-11 02:27:57,068 INFO L263 TraceCheckUtils]: 0: Hoare triple {2501#true} call ULTIMATE.init(); {2501#true} is VALID [2020-07-11 02:27:57,068 INFO L280 TraceCheckUtils]: 1: Hoare triple {2501#true} assume true; {2501#true} is VALID [2020-07-11 02:27:57,069 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2501#true} {2501#true} #44#return; {2501#true} is VALID [2020-07-11 02:27:57,069 INFO L263 TraceCheckUtils]: 3: Hoare triple {2501#true} call #t~ret2 := main(); {2501#true} is VALID [2020-07-11 02:27:57,069 INFO L280 TraceCheckUtils]: 4: Hoare triple {2501#true} havoc ~i~0; {2501#true} is VALID [2020-07-11 02:27:57,069 INFO L280 TraceCheckUtils]: 5: Hoare triple {2501#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {2501#true} is VALID [2020-07-11 02:27:57,069 INFO L280 TraceCheckUtils]: 6: Hoare triple {2501#true} havoc #t~nondet0; {2501#true} is VALID [2020-07-11 02:27:57,070 INFO L280 TraceCheckUtils]: 7: Hoare triple {2501#true} ~sn~0 := 0; {2501#true} is VALID [2020-07-11 02:27:57,071 INFO L280 TraceCheckUtils]: 8: Hoare triple {2501#true} ~i~0 := 1; {2505#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:57,072 INFO L280 TraceCheckUtils]: 9: Hoare triple {2505#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {2505#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:57,073 INFO L280 TraceCheckUtils]: 10: Hoare triple {2505#(<= main_~i~0 1)} assume ~i~0 < 10; {2505#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:57,073 INFO L280 TraceCheckUtils]: 11: Hoare triple {2505#(<= main_~i~0 1)} ~sn~0 := 2 + ~sn~0; {2505#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:57,074 INFO L280 TraceCheckUtils]: 12: Hoare triple {2505#(<= main_~i~0 1)} #t~post1 := ~i~0; {2506#(<= |main_#t~post1| 1)} is VALID [2020-07-11 02:27:57,075 INFO L280 TraceCheckUtils]: 13: Hoare triple {2506#(<= |main_#t~post1| 1)} ~i~0 := 1 + #t~post1; {2507#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:57,076 INFO L280 TraceCheckUtils]: 14: Hoare triple {2507#(<= main_~i~0 2)} havoc #t~post1; {2507#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:57,077 INFO L280 TraceCheckUtils]: 15: Hoare triple {2507#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {2507#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:57,077 INFO L280 TraceCheckUtils]: 16: Hoare triple {2507#(<= main_~i~0 2)} assume ~i~0 < 10; {2507#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:57,078 INFO L280 TraceCheckUtils]: 17: Hoare triple {2507#(<= main_~i~0 2)} ~sn~0 := 2 + ~sn~0; {2507#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:57,079 INFO L280 TraceCheckUtils]: 18: Hoare triple {2507#(<= main_~i~0 2)} #t~post1 := ~i~0; {2508#(<= |main_#t~post1| 2)} is VALID [2020-07-11 02:27:57,080 INFO L280 TraceCheckUtils]: 19: Hoare triple {2508#(<= |main_#t~post1| 2)} ~i~0 := 1 + #t~post1; {2509#(<= main_~i~0 3)} is VALID [2020-07-11 02:27:57,081 INFO L280 TraceCheckUtils]: 20: Hoare triple {2509#(<= main_~i~0 3)} havoc #t~post1; {2509#(<= main_~i~0 3)} is VALID [2020-07-11 02:27:57,081 INFO L280 TraceCheckUtils]: 21: Hoare triple {2509#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {2509#(<= main_~i~0 3)} is VALID [2020-07-11 02:27:57,082 INFO L280 TraceCheckUtils]: 22: Hoare triple {2509#(<= main_~i~0 3)} assume ~i~0 < 10; {2509#(<= main_~i~0 3)} is VALID [2020-07-11 02:27:57,083 INFO L280 TraceCheckUtils]: 23: Hoare triple {2509#(<= main_~i~0 3)} ~sn~0 := 2 + ~sn~0; {2509#(<= main_~i~0 3)} is VALID [2020-07-11 02:27:57,084 INFO L280 TraceCheckUtils]: 24: Hoare triple {2509#(<= main_~i~0 3)} #t~post1 := ~i~0; {2510#(<= |main_#t~post1| 3)} is VALID [2020-07-11 02:27:57,085 INFO L280 TraceCheckUtils]: 25: Hoare triple {2510#(<= |main_#t~post1| 3)} ~i~0 := 1 + #t~post1; {2511#(<= main_~i~0 4)} is VALID [2020-07-11 02:27:57,087 INFO L280 TraceCheckUtils]: 26: Hoare triple {2511#(<= main_~i~0 4)} havoc #t~post1; {2511#(<= main_~i~0 4)} is VALID [2020-07-11 02:27:57,088 INFO L280 TraceCheckUtils]: 27: Hoare triple {2511#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {2511#(<= main_~i~0 4)} is VALID [2020-07-11 02:27:57,089 INFO L280 TraceCheckUtils]: 28: Hoare triple {2511#(<= main_~i~0 4)} assume ~i~0 < 10; {2511#(<= main_~i~0 4)} is VALID [2020-07-11 02:27:57,089 INFO L280 TraceCheckUtils]: 29: Hoare triple {2511#(<= main_~i~0 4)} ~sn~0 := 2 + ~sn~0; {2511#(<= main_~i~0 4)} is VALID [2020-07-11 02:27:57,089 INFO L280 TraceCheckUtils]: 30: Hoare triple {2511#(<= main_~i~0 4)} #t~post1 := ~i~0; {2512#(<= |main_#t~post1| 4)} is VALID [2020-07-11 02:27:57,090 INFO L280 TraceCheckUtils]: 31: Hoare triple {2512#(<= |main_#t~post1| 4)} ~i~0 := 1 + #t~post1; {2513#(<= main_~i~0 5)} is VALID [2020-07-11 02:27:57,091 INFO L280 TraceCheckUtils]: 32: Hoare triple {2513#(<= main_~i~0 5)} havoc #t~post1; {2513#(<= main_~i~0 5)} is VALID [2020-07-11 02:27:57,091 INFO L280 TraceCheckUtils]: 33: Hoare triple {2513#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {2513#(<= main_~i~0 5)} is VALID [2020-07-11 02:27:57,091 INFO L280 TraceCheckUtils]: 34: Hoare triple {2513#(<= main_~i~0 5)} assume ~i~0 < 10; {2513#(<= main_~i~0 5)} is VALID [2020-07-11 02:27:57,092 INFO L280 TraceCheckUtils]: 35: Hoare triple {2513#(<= main_~i~0 5)} ~sn~0 := 2 + ~sn~0; {2513#(<= main_~i~0 5)} is VALID [2020-07-11 02:27:57,092 INFO L280 TraceCheckUtils]: 36: Hoare triple {2513#(<= main_~i~0 5)} #t~post1 := ~i~0; {2514#(<= |main_#t~post1| 5)} is VALID [2020-07-11 02:27:57,093 INFO L280 TraceCheckUtils]: 37: Hoare triple {2514#(<= |main_#t~post1| 5)} ~i~0 := 1 + #t~post1; {2515#(<= main_~i~0 6)} is VALID [2020-07-11 02:27:57,093 INFO L280 TraceCheckUtils]: 38: Hoare triple {2515#(<= main_~i~0 6)} havoc #t~post1; {2515#(<= main_~i~0 6)} is VALID [2020-07-11 02:27:57,094 INFO L280 TraceCheckUtils]: 39: Hoare triple {2515#(<= main_~i~0 6)} assume !!(~i~0 <= ~n~0); {2515#(<= main_~i~0 6)} is VALID [2020-07-11 02:27:57,094 INFO L280 TraceCheckUtils]: 40: Hoare triple {2515#(<= main_~i~0 6)} assume ~i~0 < 10; {2515#(<= main_~i~0 6)} is VALID [2020-07-11 02:27:57,095 INFO L280 TraceCheckUtils]: 41: Hoare triple {2515#(<= main_~i~0 6)} ~sn~0 := 2 + ~sn~0; {2515#(<= main_~i~0 6)} is VALID [2020-07-11 02:27:57,096 INFO L280 TraceCheckUtils]: 42: Hoare triple {2515#(<= main_~i~0 6)} #t~post1 := ~i~0; {2516#(<= |main_#t~post1| 6)} is VALID [2020-07-11 02:27:57,096 INFO L280 TraceCheckUtils]: 43: Hoare triple {2516#(<= |main_#t~post1| 6)} ~i~0 := 1 + #t~post1; {2517#(<= main_~i~0 7)} is VALID [2020-07-11 02:27:57,097 INFO L280 TraceCheckUtils]: 44: Hoare triple {2517#(<= main_~i~0 7)} havoc #t~post1; {2517#(<= main_~i~0 7)} is VALID [2020-07-11 02:27:57,097 INFO L280 TraceCheckUtils]: 45: Hoare triple {2517#(<= main_~i~0 7)} assume !!(~i~0 <= ~n~0); {2517#(<= main_~i~0 7)} is VALID [2020-07-11 02:27:57,098 INFO L280 TraceCheckUtils]: 46: Hoare triple {2517#(<= main_~i~0 7)} assume !(~i~0 < 10); {2502#false} is VALID [2020-07-11 02:27:57,098 INFO L280 TraceCheckUtils]: 47: Hoare triple {2502#false} #t~post1 := ~i~0; {2502#false} is VALID [2020-07-11 02:27:57,098 INFO L280 TraceCheckUtils]: 48: Hoare triple {2502#false} ~i~0 := 1 + #t~post1; {2502#false} is VALID [2020-07-11 02:27:57,098 INFO L280 TraceCheckUtils]: 49: Hoare triple {2502#false} havoc #t~post1; {2502#false} is VALID [2020-07-11 02:27:57,099 INFO L280 TraceCheckUtils]: 50: Hoare triple {2502#false} assume !(~i~0 <= ~n~0); {2502#false} is VALID [2020-07-11 02:27:57,099 INFO L263 TraceCheckUtils]: 51: Hoare triple {2502#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {2502#false} is VALID [2020-07-11 02:27:57,099 INFO L280 TraceCheckUtils]: 52: Hoare triple {2502#false} ~cond := #in~cond; {2502#false} is VALID [2020-07-11 02:27:57,099 INFO L280 TraceCheckUtils]: 53: Hoare triple {2502#false} assume 0 == ~cond; {2502#false} is VALID [2020-07-11 02:27:57,099 INFO L280 TraceCheckUtils]: 54: Hoare triple {2502#false} assume !false; {2502#false} is VALID [2020-07-11 02:27:57,103 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 25 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 02:27:57,103 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [830205305] [2020-07-11 02:27:57,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:27:57,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-07-11 02:27:57,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874715073] [2020-07-11 02:27:57,105 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2020-07-11 02:27:57,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:27:57,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-11 02:27:57,175 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:57,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-11 02:27:57,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:27:57,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-11 02:27:57,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2020-07-11 02:27:57,176 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 15 states. [2020-07-11 02:27:57,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:57,785 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2020-07-11 02:27:57,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-11 02:27:57,785 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2020-07-11 02:27:57,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:27:57,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-11 02:27:57,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 75 transitions. [2020-07-11 02:27:57,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-11 02:27:57,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 75 transitions. [2020-07-11 02:27:57,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 75 transitions. [2020-07-11 02:27:57,871 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:57,873 INFO L225 Difference]: With dead ends: 78 [2020-07-11 02:27:57,873 INFO L226 Difference]: Without dead ends: 67 [2020-07-11 02:27:57,874 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=243, Invalid=459, Unknown=0, NotChecked=0, Total=702 [2020-07-11 02:27:57,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-07-11 02:27:58,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2020-07-11 02:27:58,010 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:27:58,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 64 states. [2020-07-11 02:27:58,011 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 64 states. [2020-07-11 02:27:58,011 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 64 states. [2020-07-11 02:27:58,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:58,013 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2020-07-11 02:27:58,014 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2020-07-11 02:27:58,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:58,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:58,014 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 67 states. [2020-07-11 02:27:58,014 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 67 states. [2020-07-11 02:27:58,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:58,016 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2020-07-11 02:27:58,016 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2020-07-11 02:27:58,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:58,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:58,017 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:27:58,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:27:58,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-07-11 02:27:58,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2020-07-11 02:27:58,018 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 55 [2020-07-11 02:27:58,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:27:58,019 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2020-07-11 02:27:58,019 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-11 02:27:58,019 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 64 states and 66 transitions. [2020-07-11 02:27:58,113 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:58,113 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2020-07-11 02:27:58,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-07-11 02:27:58,114 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:27:58,114 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:27:58,115 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-11 02:27:58,115 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:27:58,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:27:58,115 INFO L82 PathProgramCache]: Analyzing trace with hash -879247179, now seen corresponding path program 7 times [2020-07-11 02:27:58,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:27:58,116 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [286012526] [2020-07-11 02:27:58,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:27:58,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:58,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:58,413 INFO L280 TraceCheckUtils]: 0: Hoare triple {2962#true} assume true; {2962#true} is VALID [2020-07-11 02:27:58,414 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2962#true} {2962#true} #44#return; {2962#true} is VALID [2020-07-11 02:27:58,414 INFO L263 TraceCheckUtils]: 0: Hoare triple {2962#true} call ULTIMATE.init(); {2962#true} is VALID [2020-07-11 02:27:58,414 INFO L280 TraceCheckUtils]: 1: Hoare triple {2962#true} assume true; {2962#true} is VALID [2020-07-11 02:27:58,414 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2962#true} {2962#true} #44#return; {2962#true} is VALID [2020-07-11 02:27:58,414 INFO L263 TraceCheckUtils]: 3: Hoare triple {2962#true} call #t~ret2 := main(); {2962#true} is VALID [2020-07-11 02:27:58,414 INFO L280 TraceCheckUtils]: 4: Hoare triple {2962#true} havoc ~i~0; {2962#true} is VALID [2020-07-11 02:27:58,414 INFO L280 TraceCheckUtils]: 5: Hoare triple {2962#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {2962#true} is VALID [2020-07-11 02:27:58,415 INFO L280 TraceCheckUtils]: 6: Hoare triple {2962#true} havoc #t~nondet0; {2962#true} is VALID [2020-07-11 02:27:58,415 INFO L280 TraceCheckUtils]: 7: Hoare triple {2962#true} ~sn~0 := 0; {2962#true} is VALID [2020-07-11 02:27:58,416 INFO L280 TraceCheckUtils]: 8: Hoare triple {2962#true} ~i~0 := 1; {2966#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:58,420 INFO L280 TraceCheckUtils]: 9: Hoare triple {2966#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {2966#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:58,422 INFO L280 TraceCheckUtils]: 10: Hoare triple {2966#(<= main_~i~0 1)} assume ~i~0 < 10; {2966#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:58,423 INFO L280 TraceCheckUtils]: 11: Hoare triple {2966#(<= main_~i~0 1)} ~sn~0 := 2 + ~sn~0; {2966#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:58,423 INFO L280 TraceCheckUtils]: 12: Hoare triple {2966#(<= main_~i~0 1)} #t~post1 := ~i~0; {2967#(<= |main_#t~post1| 1)} is VALID [2020-07-11 02:27:58,424 INFO L280 TraceCheckUtils]: 13: Hoare triple {2967#(<= |main_#t~post1| 1)} ~i~0 := 1 + #t~post1; {2968#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:58,424 INFO L280 TraceCheckUtils]: 14: Hoare triple {2968#(<= main_~i~0 2)} havoc #t~post1; {2968#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:58,425 INFO L280 TraceCheckUtils]: 15: Hoare triple {2968#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {2968#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:58,425 INFO L280 TraceCheckUtils]: 16: Hoare triple {2968#(<= main_~i~0 2)} assume ~i~0 < 10; {2968#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:58,426 INFO L280 TraceCheckUtils]: 17: Hoare triple {2968#(<= main_~i~0 2)} ~sn~0 := 2 + ~sn~0; {2968#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:58,426 INFO L280 TraceCheckUtils]: 18: Hoare triple {2968#(<= main_~i~0 2)} #t~post1 := ~i~0; {2969#(<= |main_#t~post1| 2)} is VALID [2020-07-11 02:27:58,427 INFO L280 TraceCheckUtils]: 19: Hoare triple {2969#(<= |main_#t~post1| 2)} ~i~0 := 1 + #t~post1; {2970#(<= main_~i~0 3)} is VALID [2020-07-11 02:27:58,427 INFO L280 TraceCheckUtils]: 20: Hoare triple {2970#(<= main_~i~0 3)} havoc #t~post1; {2970#(<= main_~i~0 3)} is VALID [2020-07-11 02:27:58,427 INFO L280 TraceCheckUtils]: 21: Hoare triple {2970#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {2970#(<= main_~i~0 3)} is VALID [2020-07-11 02:27:58,428 INFO L280 TraceCheckUtils]: 22: Hoare triple {2970#(<= main_~i~0 3)} assume ~i~0 < 10; {2970#(<= main_~i~0 3)} is VALID [2020-07-11 02:27:58,428 INFO L280 TraceCheckUtils]: 23: Hoare triple {2970#(<= main_~i~0 3)} ~sn~0 := 2 + ~sn~0; {2970#(<= main_~i~0 3)} is VALID [2020-07-11 02:27:58,428 INFO L280 TraceCheckUtils]: 24: Hoare triple {2970#(<= main_~i~0 3)} #t~post1 := ~i~0; {2971#(<= |main_#t~post1| 3)} is VALID [2020-07-11 02:27:58,429 INFO L280 TraceCheckUtils]: 25: Hoare triple {2971#(<= |main_#t~post1| 3)} ~i~0 := 1 + #t~post1; {2972#(<= main_~i~0 4)} is VALID [2020-07-11 02:27:58,429 INFO L280 TraceCheckUtils]: 26: Hoare triple {2972#(<= main_~i~0 4)} havoc #t~post1; {2972#(<= main_~i~0 4)} is VALID [2020-07-11 02:27:58,430 INFO L280 TraceCheckUtils]: 27: Hoare triple {2972#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {2972#(<= main_~i~0 4)} is VALID [2020-07-11 02:27:58,430 INFO L280 TraceCheckUtils]: 28: Hoare triple {2972#(<= main_~i~0 4)} assume ~i~0 < 10; {2972#(<= main_~i~0 4)} is VALID [2020-07-11 02:27:58,430 INFO L280 TraceCheckUtils]: 29: Hoare triple {2972#(<= main_~i~0 4)} ~sn~0 := 2 + ~sn~0; {2972#(<= main_~i~0 4)} is VALID [2020-07-11 02:27:58,431 INFO L280 TraceCheckUtils]: 30: Hoare triple {2972#(<= main_~i~0 4)} #t~post1 := ~i~0; {2973#(<= |main_#t~post1| 4)} is VALID [2020-07-11 02:27:58,431 INFO L280 TraceCheckUtils]: 31: Hoare triple {2973#(<= |main_#t~post1| 4)} ~i~0 := 1 + #t~post1; {2974#(<= main_~i~0 5)} is VALID [2020-07-11 02:27:58,432 INFO L280 TraceCheckUtils]: 32: Hoare triple {2974#(<= main_~i~0 5)} havoc #t~post1; {2974#(<= main_~i~0 5)} is VALID [2020-07-11 02:27:58,432 INFO L280 TraceCheckUtils]: 33: Hoare triple {2974#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {2974#(<= main_~i~0 5)} is VALID [2020-07-11 02:27:58,432 INFO L280 TraceCheckUtils]: 34: Hoare triple {2974#(<= main_~i~0 5)} assume ~i~0 < 10; {2974#(<= main_~i~0 5)} is VALID [2020-07-11 02:27:58,433 INFO L280 TraceCheckUtils]: 35: Hoare triple {2974#(<= main_~i~0 5)} ~sn~0 := 2 + ~sn~0; {2974#(<= main_~i~0 5)} is VALID [2020-07-11 02:27:58,433 INFO L280 TraceCheckUtils]: 36: Hoare triple {2974#(<= main_~i~0 5)} #t~post1 := ~i~0; {2975#(<= |main_#t~post1| 5)} is VALID [2020-07-11 02:27:58,434 INFO L280 TraceCheckUtils]: 37: Hoare triple {2975#(<= |main_#t~post1| 5)} ~i~0 := 1 + #t~post1; {2976#(<= main_~i~0 6)} is VALID [2020-07-11 02:27:58,434 INFO L280 TraceCheckUtils]: 38: Hoare triple {2976#(<= main_~i~0 6)} havoc #t~post1; {2976#(<= main_~i~0 6)} is VALID [2020-07-11 02:27:58,435 INFO L280 TraceCheckUtils]: 39: Hoare triple {2976#(<= main_~i~0 6)} assume !!(~i~0 <= ~n~0); {2976#(<= main_~i~0 6)} is VALID [2020-07-11 02:27:58,435 INFO L280 TraceCheckUtils]: 40: Hoare triple {2976#(<= main_~i~0 6)} assume ~i~0 < 10; {2976#(<= main_~i~0 6)} is VALID [2020-07-11 02:27:58,435 INFO L280 TraceCheckUtils]: 41: Hoare triple {2976#(<= main_~i~0 6)} ~sn~0 := 2 + ~sn~0; {2976#(<= main_~i~0 6)} is VALID [2020-07-11 02:27:58,436 INFO L280 TraceCheckUtils]: 42: Hoare triple {2976#(<= main_~i~0 6)} #t~post1 := ~i~0; {2977#(<= |main_#t~post1| 6)} is VALID [2020-07-11 02:27:58,436 INFO L280 TraceCheckUtils]: 43: Hoare triple {2977#(<= |main_#t~post1| 6)} ~i~0 := 1 + #t~post1; {2978#(<= main_~i~0 7)} is VALID [2020-07-11 02:27:58,438 INFO L280 TraceCheckUtils]: 44: Hoare triple {2978#(<= main_~i~0 7)} havoc #t~post1; {2978#(<= main_~i~0 7)} is VALID [2020-07-11 02:27:58,438 INFO L280 TraceCheckUtils]: 45: Hoare triple {2978#(<= main_~i~0 7)} assume !!(~i~0 <= ~n~0); {2978#(<= main_~i~0 7)} is VALID [2020-07-11 02:27:58,439 INFO L280 TraceCheckUtils]: 46: Hoare triple {2978#(<= main_~i~0 7)} assume ~i~0 < 10; {2978#(<= main_~i~0 7)} is VALID [2020-07-11 02:27:58,439 INFO L280 TraceCheckUtils]: 47: Hoare triple {2978#(<= main_~i~0 7)} ~sn~0 := 2 + ~sn~0; {2978#(<= main_~i~0 7)} is VALID [2020-07-11 02:27:58,441 INFO L280 TraceCheckUtils]: 48: Hoare triple {2978#(<= main_~i~0 7)} #t~post1 := ~i~0; {2979#(<= |main_#t~post1| 7)} is VALID [2020-07-11 02:27:58,443 INFO L280 TraceCheckUtils]: 49: Hoare triple {2979#(<= |main_#t~post1| 7)} ~i~0 := 1 + #t~post1; {2980#(<= main_~i~0 8)} is VALID [2020-07-11 02:27:58,443 INFO L280 TraceCheckUtils]: 50: Hoare triple {2980#(<= main_~i~0 8)} havoc #t~post1; {2980#(<= main_~i~0 8)} is VALID [2020-07-11 02:27:58,443 INFO L280 TraceCheckUtils]: 51: Hoare triple {2980#(<= main_~i~0 8)} assume !!(~i~0 <= ~n~0); {2980#(<= main_~i~0 8)} is VALID [2020-07-11 02:27:58,444 INFO L280 TraceCheckUtils]: 52: Hoare triple {2980#(<= main_~i~0 8)} assume !(~i~0 < 10); {2963#false} is VALID [2020-07-11 02:27:58,444 INFO L280 TraceCheckUtils]: 53: Hoare triple {2963#false} #t~post1 := ~i~0; {2963#false} is VALID [2020-07-11 02:27:58,444 INFO L280 TraceCheckUtils]: 54: Hoare triple {2963#false} ~i~0 := 1 + #t~post1; {2963#false} is VALID [2020-07-11 02:27:58,444 INFO L280 TraceCheckUtils]: 55: Hoare triple {2963#false} havoc #t~post1; {2963#false} is VALID [2020-07-11 02:27:58,444 INFO L280 TraceCheckUtils]: 56: Hoare triple {2963#false} assume !(~i~0 <= ~n~0); {2963#false} is VALID [2020-07-11 02:27:58,444 INFO L263 TraceCheckUtils]: 57: Hoare triple {2963#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {2963#false} is VALID [2020-07-11 02:27:58,445 INFO L280 TraceCheckUtils]: 58: Hoare triple {2963#false} ~cond := #in~cond; {2963#false} is VALID [2020-07-11 02:27:58,445 INFO L280 TraceCheckUtils]: 59: Hoare triple {2963#false} assume 0 == ~cond; {2963#false} is VALID [2020-07-11 02:27:58,445 INFO L280 TraceCheckUtils]: 60: Hoare triple {2963#false} assume !false; {2963#false} is VALID [2020-07-11 02:27:58,448 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 29 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 02:27:58,449 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [286012526] [2020-07-11 02:27:58,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:27:58,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-07-11 02:27:58,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009276053] [2020-07-11 02:27:58,450 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 61 [2020-07-11 02:27:58,450 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:27:58,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2020-07-11 02:27:58,507 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:58,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-11 02:27:58,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:27:58,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-11 02:27:58,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2020-07-11 02:27:58,509 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 17 states. [2020-07-11 02:27:59,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:59,104 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2020-07-11 02:27:59,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-07-11 02:27:59,104 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 61 [2020-07-11 02:27:59,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:27:59,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-11 02:27:59,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 81 transitions. [2020-07-11 02:27:59,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-11 02:27:59,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 81 transitions. [2020-07-11 02:27:59,111 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 81 transitions. [2020-07-11 02:27:59,193 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:27:59,194 INFO L225 Difference]: With dead ends: 84 [2020-07-11 02:27:59,195 INFO L226 Difference]: Without dead ends: 73 [2020-07-11 02:27:59,196 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=318, Invalid=612, Unknown=0, NotChecked=0, Total=930 [2020-07-11 02:27:59,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-07-11 02:27:59,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2020-07-11 02:27:59,360 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:27:59,361 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 70 states. [2020-07-11 02:27:59,361 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 70 states. [2020-07-11 02:27:59,361 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 70 states. [2020-07-11 02:27:59,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:59,363 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2020-07-11 02:27:59,363 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2020-07-11 02:27:59,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:59,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:59,364 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 73 states. [2020-07-11 02:27:59,364 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 73 states. [2020-07-11 02:27:59,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:59,366 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2020-07-11 02:27:59,366 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2020-07-11 02:27:59,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:59,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:59,367 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:27:59,367 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:27:59,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-11 02:27:59,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2020-07-11 02:27:59,369 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 61 [2020-07-11 02:27:59,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:27:59,369 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2020-07-11 02:27:59,369 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-11 02:27:59,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 70 states and 72 transitions. [2020-07-11 02:27:59,469 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:59,470 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2020-07-11 02:27:59,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-11 02:27:59,470 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:27:59,471 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:27:59,471 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-11 02:27:59,471 INFO L427 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:27:59,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:27:59,471 INFO L82 PathProgramCache]: Analyzing trace with hash -583378275, now seen corresponding path program 8 times [2020-07-11 02:27:59,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:27:59,472 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1275385647] [2020-07-11 02:27:59,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:27:59,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:59,755 INFO L280 TraceCheckUtils]: 0: Hoare triple {3465#true} assume true; {3465#true} is VALID [2020-07-11 02:27:59,756 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3465#true} {3465#true} #44#return; {3465#true} is VALID [2020-07-11 02:27:59,757 INFO L263 TraceCheckUtils]: 0: Hoare triple {3465#true} call ULTIMATE.init(); {3465#true} is VALID [2020-07-11 02:27:59,757 INFO L280 TraceCheckUtils]: 1: Hoare triple {3465#true} assume true; {3465#true} is VALID [2020-07-11 02:27:59,757 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3465#true} {3465#true} #44#return; {3465#true} is VALID [2020-07-11 02:27:59,757 INFO L263 TraceCheckUtils]: 3: Hoare triple {3465#true} call #t~ret2 := main(); {3465#true} is VALID [2020-07-11 02:27:59,757 INFO L280 TraceCheckUtils]: 4: Hoare triple {3465#true} havoc ~i~0; {3465#true} is VALID [2020-07-11 02:27:59,758 INFO L280 TraceCheckUtils]: 5: Hoare triple {3465#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {3465#true} is VALID [2020-07-11 02:27:59,758 INFO L280 TraceCheckUtils]: 6: Hoare triple {3465#true} havoc #t~nondet0; {3465#true} is VALID [2020-07-11 02:27:59,758 INFO L280 TraceCheckUtils]: 7: Hoare triple {3465#true} ~sn~0 := 0; {3465#true} is VALID [2020-07-11 02:27:59,759 INFO L280 TraceCheckUtils]: 8: Hoare triple {3465#true} ~i~0 := 1; {3469#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:59,760 INFO L280 TraceCheckUtils]: 9: Hoare triple {3469#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {3469#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:59,760 INFO L280 TraceCheckUtils]: 10: Hoare triple {3469#(<= main_~i~0 1)} assume ~i~0 < 10; {3469#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:59,761 INFO L280 TraceCheckUtils]: 11: Hoare triple {3469#(<= main_~i~0 1)} ~sn~0 := 2 + ~sn~0; {3469#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:59,761 INFO L280 TraceCheckUtils]: 12: Hoare triple {3469#(<= main_~i~0 1)} #t~post1 := ~i~0; {3470#(<= |main_#t~post1| 1)} is VALID [2020-07-11 02:27:59,762 INFO L280 TraceCheckUtils]: 13: Hoare triple {3470#(<= |main_#t~post1| 1)} ~i~0 := 1 + #t~post1; {3471#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:59,762 INFO L280 TraceCheckUtils]: 14: Hoare triple {3471#(<= main_~i~0 2)} havoc #t~post1; {3471#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:59,763 INFO L280 TraceCheckUtils]: 15: Hoare triple {3471#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {3471#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:59,763 INFO L280 TraceCheckUtils]: 16: Hoare triple {3471#(<= main_~i~0 2)} assume ~i~0 < 10; {3471#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:59,764 INFO L280 TraceCheckUtils]: 17: Hoare triple {3471#(<= main_~i~0 2)} ~sn~0 := 2 + ~sn~0; {3471#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:59,764 INFO L280 TraceCheckUtils]: 18: Hoare triple {3471#(<= main_~i~0 2)} #t~post1 := ~i~0; {3472#(<= |main_#t~post1| 2)} is VALID [2020-07-11 02:27:59,765 INFO L280 TraceCheckUtils]: 19: Hoare triple {3472#(<= |main_#t~post1| 2)} ~i~0 := 1 + #t~post1; {3473#(<= main_~i~0 3)} is VALID [2020-07-11 02:27:59,765 INFO L280 TraceCheckUtils]: 20: Hoare triple {3473#(<= main_~i~0 3)} havoc #t~post1; {3473#(<= main_~i~0 3)} is VALID [2020-07-11 02:27:59,766 INFO L280 TraceCheckUtils]: 21: Hoare triple {3473#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {3473#(<= main_~i~0 3)} is VALID [2020-07-11 02:27:59,766 INFO L280 TraceCheckUtils]: 22: Hoare triple {3473#(<= main_~i~0 3)} assume ~i~0 < 10; {3473#(<= main_~i~0 3)} is VALID [2020-07-11 02:27:59,766 INFO L280 TraceCheckUtils]: 23: Hoare triple {3473#(<= main_~i~0 3)} ~sn~0 := 2 + ~sn~0; {3473#(<= main_~i~0 3)} is VALID [2020-07-11 02:27:59,767 INFO L280 TraceCheckUtils]: 24: Hoare triple {3473#(<= main_~i~0 3)} #t~post1 := ~i~0; {3474#(<= |main_#t~post1| 3)} is VALID [2020-07-11 02:27:59,767 INFO L280 TraceCheckUtils]: 25: Hoare triple {3474#(<= |main_#t~post1| 3)} ~i~0 := 1 + #t~post1; {3475#(<= main_~i~0 4)} is VALID [2020-07-11 02:27:59,768 INFO L280 TraceCheckUtils]: 26: Hoare triple {3475#(<= main_~i~0 4)} havoc #t~post1; {3475#(<= main_~i~0 4)} is VALID [2020-07-11 02:27:59,768 INFO L280 TraceCheckUtils]: 27: Hoare triple {3475#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {3475#(<= main_~i~0 4)} is VALID [2020-07-11 02:27:59,769 INFO L280 TraceCheckUtils]: 28: Hoare triple {3475#(<= main_~i~0 4)} assume ~i~0 < 10; {3475#(<= main_~i~0 4)} is VALID [2020-07-11 02:27:59,769 INFO L280 TraceCheckUtils]: 29: Hoare triple {3475#(<= main_~i~0 4)} ~sn~0 := 2 + ~sn~0; {3475#(<= main_~i~0 4)} is VALID [2020-07-11 02:27:59,769 INFO L280 TraceCheckUtils]: 30: Hoare triple {3475#(<= main_~i~0 4)} #t~post1 := ~i~0; {3476#(<= |main_#t~post1| 4)} is VALID [2020-07-11 02:27:59,770 INFO L280 TraceCheckUtils]: 31: Hoare triple {3476#(<= |main_#t~post1| 4)} ~i~0 := 1 + #t~post1; {3477#(<= main_~i~0 5)} is VALID [2020-07-11 02:27:59,771 INFO L280 TraceCheckUtils]: 32: Hoare triple {3477#(<= main_~i~0 5)} havoc #t~post1; {3477#(<= main_~i~0 5)} is VALID [2020-07-11 02:27:59,772 INFO L280 TraceCheckUtils]: 33: Hoare triple {3477#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {3477#(<= main_~i~0 5)} is VALID [2020-07-11 02:27:59,772 INFO L280 TraceCheckUtils]: 34: Hoare triple {3477#(<= main_~i~0 5)} assume ~i~0 < 10; {3477#(<= main_~i~0 5)} is VALID [2020-07-11 02:27:59,773 INFO L280 TraceCheckUtils]: 35: Hoare triple {3477#(<= main_~i~0 5)} ~sn~0 := 2 + ~sn~0; {3477#(<= main_~i~0 5)} is VALID [2020-07-11 02:27:59,773 INFO L280 TraceCheckUtils]: 36: Hoare triple {3477#(<= main_~i~0 5)} #t~post1 := ~i~0; {3478#(<= |main_#t~post1| 5)} is VALID [2020-07-11 02:27:59,774 INFO L280 TraceCheckUtils]: 37: Hoare triple {3478#(<= |main_#t~post1| 5)} ~i~0 := 1 + #t~post1; {3479#(<= main_~i~0 6)} is VALID [2020-07-11 02:27:59,774 INFO L280 TraceCheckUtils]: 38: Hoare triple {3479#(<= main_~i~0 6)} havoc #t~post1; {3479#(<= main_~i~0 6)} is VALID [2020-07-11 02:27:59,774 INFO L280 TraceCheckUtils]: 39: Hoare triple {3479#(<= main_~i~0 6)} assume !!(~i~0 <= ~n~0); {3479#(<= main_~i~0 6)} is VALID [2020-07-11 02:27:59,775 INFO L280 TraceCheckUtils]: 40: Hoare triple {3479#(<= main_~i~0 6)} assume ~i~0 < 10; {3479#(<= main_~i~0 6)} is VALID [2020-07-11 02:27:59,776 INFO L280 TraceCheckUtils]: 41: Hoare triple {3479#(<= main_~i~0 6)} ~sn~0 := 2 + ~sn~0; {3479#(<= main_~i~0 6)} is VALID [2020-07-11 02:27:59,776 INFO L280 TraceCheckUtils]: 42: Hoare triple {3479#(<= main_~i~0 6)} #t~post1 := ~i~0; {3480#(<= |main_#t~post1| 6)} is VALID [2020-07-11 02:27:59,777 INFO L280 TraceCheckUtils]: 43: Hoare triple {3480#(<= |main_#t~post1| 6)} ~i~0 := 1 + #t~post1; {3481#(<= main_~i~0 7)} is VALID [2020-07-11 02:27:59,777 INFO L280 TraceCheckUtils]: 44: Hoare triple {3481#(<= main_~i~0 7)} havoc #t~post1; {3481#(<= main_~i~0 7)} is VALID [2020-07-11 02:27:59,778 INFO L280 TraceCheckUtils]: 45: Hoare triple {3481#(<= main_~i~0 7)} assume !!(~i~0 <= ~n~0); {3481#(<= main_~i~0 7)} is VALID [2020-07-11 02:27:59,778 INFO L280 TraceCheckUtils]: 46: Hoare triple {3481#(<= main_~i~0 7)} assume ~i~0 < 10; {3481#(<= main_~i~0 7)} is VALID [2020-07-11 02:27:59,778 INFO L280 TraceCheckUtils]: 47: Hoare triple {3481#(<= main_~i~0 7)} ~sn~0 := 2 + ~sn~0; {3481#(<= main_~i~0 7)} is VALID [2020-07-11 02:27:59,779 INFO L280 TraceCheckUtils]: 48: Hoare triple {3481#(<= main_~i~0 7)} #t~post1 := ~i~0; {3482#(<= |main_#t~post1| 7)} is VALID [2020-07-11 02:27:59,779 INFO L280 TraceCheckUtils]: 49: Hoare triple {3482#(<= |main_#t~post1| 7)} ~i~0 := 1 + #t~post1; {3483#(<= main_~i~0 8)} is VALID [2020-07-11 02:27:59,780 INFO L280 TraceCheckUtils]: 50: Hoare triple {3483#(<= main_~i~0 8)} havoc #t~post1; {3483#(<= main_~i~0 8)} is VALID [2020-07-11 02:27:59,781 INFO L280 TraceCheckUtils]: 51: Hoare triple {3483#(<= main_~i~0 8)} assume !!(~i~0 <= ~n~0); {3483#(<= main_~i~0 8)} is VALID [2020-07-11 02:27:59,781 INFO L280 TraceCheckUtils]: 52: Hoare triple {3483#(<= main_~i~0 8)} assume ~i~0 < 10; {3483#(<= main_~i~0 8)} is VALID [2020-07-11 02:27:59,782 INFO L280 TraceCheckUtils]: 53: Hoare triple {3483#(<= main_~i~0 8)} ~sn~0 := 2 + ~sn~0; {3483#(<= main_~i~0 8)} is VALID [2020-07-11 02:27:59,782 INFO L280 TraceCheckUtils]: 54: Hoare triple {3483#(<= main_~i~0 8)} #t~post1 := ~i~0; {3484#(<= |main_#t~post1| 8)} is VALID [2020-07-11 02:27:59,783 INFO L280 TraceCheckUtils]: 55: Hoare triple {3484#(<= |main_#t~post1| 8)} ~i~0 := 1 + #t~post1; {3485#(<= main_~i~0 9)} is VALID [2020-07-11 02:27:59,783 INFO L280 TraceCheckUtils]: 56: Hoare triple {3485#(<= main_~i~0 9)} havoc #t~post1; {3485#(<= main_~i~0 9)} is VALID [2020-07-11 02:27:59,783 INFO L280 TraceCheckUtils]: 57: Hoare triple {3485#(<= main_~i~0 9)} assume !!(~i~0 <= ~n~0); {3485#(<= main_~i~0 9)} is VALID [2020-07-11 02:27:59,784 INFO L280 TraceCheckUtils]: 58: Hoare triple {3485#(<= main_~i~0 9)} assume !(~i~0 < 10); {3466#false} is VALID [2020-07-11 02:27:59,784 INFO L280 TraceCheckUtils]: 59: Hoare triple {3466#false} #t~post1 := ~i~0; {3466#false} is VALID [2020-07-11 02:27:59,784 INFO L280 TraceCheckUtils]: 60: Hoare triple {3466#false} ~i~0 := 1 + #t~post1; {3466#false} is VALID [2020-07-11 02:27:59,784 INFO L280 TraceCheckUtils]: 61: Hoare triple {3466#false} havoc #t~post1; {3466#false} is VALID [2020-07-11 02:27:59,784 INFO L280 TraceCheckUtils]: 62: Hoare triple {3466#false} assume !(~i~0 <= ~n~0); {3466#false} is VALID [2020-07-11 02:27:59,784 INFO L263 TraceCheckUtils]: 63: Hoare triple {3466#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {3466#false} is VALID [2020-07-11 02:27:59,785 INFO L280 TraceCheckUtils]: 64: Hoare triple {3466#false} ~cond := #in~cond; {3466#false} is VALID [2020-07-11 02:27:59,785 INFO L280 TraceCheckUtils]: 65: Hoare triple {3466#false} assume 0 == ~cond; {3466#false} is VALID [2020-07-11 02:27:59,785 INFO L280 TraceCheckUtils]: 66: Hoare triple {3466#false} assume !false; {3466#false} is VALID [2020-07-11 02:27:59,788 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 33 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 02:27:59,788 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1275385647] [2020-07-11 02:27:59,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:27:59,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-07-11 02:27:59,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199188926] [2020-07-11 02:27:59,789 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2020-07-11 02:27:59,789 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:27:59,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2020-07-11 02:27:59,857 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:59,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-11 02:27:59,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:27:59,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-11 02:27:59,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2020-07-11 02:27:59,859 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 19 states. [2020-07-11 02:28:00,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:00,687 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2020-07-11 02:28:00,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-07-11 02:28:00,687 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2020-07-11 02:28:00,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:28:00,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-11 02:28:00,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 86 transitions. [2020-07-11 02:28:00,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-11 02:28:00,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 86 transitions. [2020-07-11 02:28:00,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 86 transitions. [2020-07-11 02:28:00,774 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:28:00,776 INFO L225 Difference]: With dead ends: 89 [2020-07-11 02:28:00,776 INFO L226 Difference]: Without dead ends: 78 [2020-07-11 02:28:00,777 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=403, Invalid=787, Unknown=0, NotChecked=0, Total=1190 [2020-07-11 02:28:00,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-11 02:28:00,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2020-07-11 02:28:00,943 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:28:00,943 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 76 states. [2020-07-11 02:28:00,944 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 76 states. [2020-07-11 02:28:00,944 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 76 states. [2020-07-11 02:28:00,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:00,947 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2020-07-11 02:28:00,947 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2020-07-11 02:28:00,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:00,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:00,948 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 78 states. [2020-07-11 02:28:00,948 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 78 states. [2020-07-11 02:28:00,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:00,950 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2020-07-11 02:28:00,950 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2020-07-11 02:28:00,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:00,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:00,950 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:28:00,950 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:28:00,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-11 02:28:00,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2020-07-11 02:28:00,952 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 67 [2020-07-11 02:28:00,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:28:00,952 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2020-07-11 02:28:00,952 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-11 02:28:00,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 76 states and 78 transitions. [2020-07-11 02:28:01,072 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:28:01,073 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2020-07-11 02:28:01,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-07-11 02:28:01,074 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:28:01,074 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:28:01,074 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-11 02:28:01,074 INFO L427 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:28:01,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:28:01,075 INFO L82 PathProgramCache]: Analyzing trace with hash 929818245, now seen corresponding path program 9 times [2020-07-11 02:28:01,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:28:01,075 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1109517215] [2020-07-11 02:28:01,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:28:01,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 02:28:01,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 02:28:01,182 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-11 02:28:01,182 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-11 02:28:01,183 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-11 02:28:01,251 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-11 02:28:01,252 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 02:28:01,252 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 02:28:01,252 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-11 02:28:01,252 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-11 02:28:01,252 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-11 02:28:01,252 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 02:28:01,253 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 02:28:01,253 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-11 02:28:01,253 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-11 02:28:01,253 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-11 02:28:01,253 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-11 02:28:01,253 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2020-07-11 02:28:01,254 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-11 02:28:01,254 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-11 02:28:01,254 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-11 02:28:01,254 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2020-07-11 02:28:01,254 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-11 02:28:01,254 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-11 02:28:01,254 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-11 02:28:01,254 WARN L170 areAnnotationChecker]: L13-6 has no Hoare annotation [2020-07-11 02:28:01,254 WARN L170 areAnnotationChecker]: L13-6 has no Hoare annotation [2020-07-11 02:28:01,255 WARN L170 areAnnotationChecker]: L13-6 has no Hoare annotation [2020-07-11 02:28:01,255 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-11 02:28:01,255 WARN L170 areAnnotationChecker]: L13-7 has no Hoare annotation [2020-07-11 02:28:01,255 WARN L170 areAnnotationChecker]: L13-7 has no Hoare annotation [2020-07-11 02:28:01,255 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-11 02:28:01,255 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-11 02:28:01,255 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-11 02:28:01,255 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-11 02:28:01,255 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2020-07-11 02:28:01,256 WARN L170 areAnnotationChecker]: L13-5 has no Hoare annotation [2020-07-11 02:28:01,256 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:01,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 02:28:01 BoogieIcfgContainer [2020-07-11 02:28:01,260 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 02:28:01,267 INFO L168 Benchmark]: Toolchain (without parser) took 12725.39 ms. Allocated memory was 133.7 MB in the beginning and 373.8 MB in the end (delta: 240.1 MB). Free memory was 98.5 MB in the beginning and 149.4 MB in the end (delta: -50.9 MB). Peak memory consumption was 189.2 MB. Max. memory is 7.1 GB. [2020-07-11 02:28:01,268 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 133.7 MB. Free memory was 117.1 MB in the beginning and 116.9 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:01,269 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.04 ms. Allocated memory is still 133.7 MB. Free memory was 98.3 MB in the beginning and 88.7 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:01,269 INFO L168 Benchmark]: Boogie Preprocessor took 126.31 ms. Allocated memory was 133.7 MB in the beginning and 198.2 MB in the end (delta: 64.5 MB). Free memory was 88.7 MB in the beginning and 176.9 MB in the end (delta: -88.2 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2020-07-11 02:28:01,270 INFO L168 Benchmark]: RCFGBuilder took 302.34 ms. Allocated memory is still 198.2 MB. Free memory was 176.9 MB in the beginning and 161.0 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. [2020-07-11 02:28:01,275 INFO L168 Benchmark]: TraceAbstraction took 11979.88 ms. Allocated memory was 198.2 MB in the beginning and 373.8 MB in the end (delta: 175.6 MB). Free memory was 160.2 MB in the beginning and 149.4 MB in the end (delta: 10.8 MB). Peak memory consumption was 186.4 MB. Max. memory is 7.1 GB. [2020-07-11 02:28:01,282 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.21 ms. Allocated memory is still 133.7 MB. Free memory was 117.1 MB in the beginning and 116.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 311.04 ms. Allocated memory is still 133.7 MB. Free memory was 98.3 MB in the beginning and 88.7 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 126.31 ms. Allocated memory was 133.7 MB in the beginning and 198.2 MB in the end (delta: 64.5 MB). Free memory was 88.7 MB in the beginning and 176.9 MB in the end (delta: -88.2 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 302.34 ms. Allocated memory is still 198.2 MB. Free memory was 176.9 MB in the beginning and 161.0 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11979.88 ms. Allocated memory was 198.2 MB in the beginning and 373.8 MB in the end (delta: 175.6 MB). Free memory was 160.2 MB in the beginning and 149.4 MB in the end (delta: 10.8 MB). Peak memory consumption was 186.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; VAL [__VERIFIER_nondet_uint()=10, n=10] [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; VAL [n=10, n=0] [L13] i=1 VAL [i=1, n=0, n=10] [L13] COND TRUE i<=n VAL [i=1, n=0, n=10] [L14] COND TRUE i<10 VAL [i=1, n=0, n=10] [L15] sn = sn + (2) VAL [i=1, n=10, n=2] [L13] i++ VAL [i=2, n=2, n=10] [L13] COND TRUE i<=n VAL [i=2, n=2, n=10] [L14] COND TRUE i<10 VAL [i=2, n=2, n=10] [L15] sn = sn + (2) VAL [i=2, n=10, n=4] [L13] i++ VAL [i=3, n=10, n=4] [L13] COND TRUE i<=n VAL [i=3, n=4, n=10] [L14] COND TRUE i<10 VAL [i=3, n=4, n=10] [L15] sn = sn + (2) VAL [i=3, n=6, n=10] [L13] i++ VAL [i=4, n=10, n=6] [L13] COND TRUE i<=n VAL [i=4, n=10, n=6] [L14] COND TRUE i<10 VAL [i=4, n=10, n=6] [L15] sn = sn + (2) VAL [i=4, n=10, n=8] [L13] i++ VAL [i=5, n=10, n=8] [L13] COND TRUE i<=n VAL [i=5, n=10, n=8] [L14] COND TRUE i<10 VAL [i=5, n=10, n=8] [L15] sn = sn + (2) VAL [i=5, n=10, n=10] [L13] i++ VAL [i=6, n=10, n=10] [L13] COND TRUE i<=n VAL [i=6, n=10, n=10] [L14] COND TRUE i<10 VAL [i=6, n=10, n=10] [L15] sn = sn + (2) VAL [i=6, n=12, n=10] [L13] i++ VAL [i=7, n=12, n=10] [L13] COND TRUE i<=n VAL [i=7, n=12, n=10] [L14] COND TRUE i<10 VAL [i=7, n=10, n=12] [L15] sn = sn + (2) VAL [i=7, n=14, n=10] [L13] i++ VAL [i=8, n=10, n=14] [L13] COND TRUE i<=n VAL [i=8, n=10, n=14] [L14] COND TRUE i<10 VAL [i=8, n=10, n=14] [L15] sn = sn + (2) VAL [i=8, n=10, n=16] [L13] i++ VAL [i=9, n=16, n=10] [L13] COND TRUE i<=n VAL [i=9, n=10, n=16] [L14] COND TRUE i<10 VAL [i=9, n=16, n=10] [L15] sn = sn + (2) VAL [i=9, n=18, n=10] [L13] i++ VAL [i=10, n=10, n=18] [L13] COND TRUE i<=n VAL [i=10, n=10, n=18] [L14] COND FALSE !(i<10) VAL [i=10, n=18, n=10] [L13] i++ VAL [i=11, n=18, n=10] [L13] COND FALSE !(i<=n) VAL [i=11, n=18, n=10] [L17] CALL __VERIFIER_assert(sn==n*(2) || sn == 0) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.8s, OverallIterations: 13, TraceHistogramMax: 10, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 209 SDtfs, 178 SDslu, 1145 SDs, 0 SdLazy, 704 SolverSat, 68 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 239 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 30 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 515 NumberOfCodeBlocks, 515 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 430 ConstructedInterpolants, 0 QuantifiedInterpolants, 50804 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 153/737 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...