/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loops/sum01_bug02_sum01_bug02_base.case.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:22:00,818 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:22:00,821 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:22:00,839 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:22:00,839 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:22:00,841 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:22:00,843 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:22:00,853 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:22:00,858 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:22:00,863 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:22:00,864 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:22:00,865 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:22:00,865 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:22:00,866 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:22:00,867 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:22:00,869 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:22:00,870 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:22:00,872 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:22:00,873 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:22:00,877 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:22:00,882 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:22:00,885 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:22:00,886 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:22:00,887 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:22:00,891 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:22:00,891 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:22:00,892 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:22:00,894 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:22:00,895 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:22:00,897 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:22:00,897 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:22:00,898 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:22:00,899 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:22:00,900 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:22:00,904 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:22:00,904 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:22:00,905 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:22:00,905 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:22:00,905 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:22:00,906 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:22:00,908 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:22:00,908 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 20:22:00,938 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:22:00,939 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:22:00,941 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:22:00,941 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:22:00,941 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:22:00,942 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:22:00,942 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:22:00,942 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:22:00,945 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:22:00,946 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:22:00,946 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:22:00,946 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:22:00,946 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:22:00,946 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:22:00,947 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:22:00,947 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:22:00,947 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:22:00,949 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:22:00,949 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:22:00,949 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:22:00,949 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:22:00,950 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:22:00,950 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:22:01,218 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:22:01,230 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:22:01,233 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:22:01,235 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:22:01,235 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:22:01,236 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01_bug02_sum01_bug02_base.case.i [2020-07-10 20:22:01,320 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/650376e0f/687e5905e5bf4d08a00662500f0556e8/FLAG2632efe3a [2020-07-10 20:22:01,837 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:22:01,838 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01_bug02_sum01_bug02_base.case.i [2020-07-10 20:22:01,844 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/650376e0f/687e5905e5bf4d08a00662500f0556e8/FLAG2632efe3a [2020-07-10 20:22:02,240 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/650376e0f/687e5905e5bf4d08a00662500f0556e8 [2020-07-10 20:22:02,251 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:22:02,253 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:22:02,254 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:22:02,254 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:22:02,257 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:22:02,259 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:22:02" (1/1) ... [2020-07-10 20:22:02,262 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46735f22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:02, skipping insertion in model container [2020-07-10 20:22:02,262 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:22:02" (1/1) ... [2020-07-10 20:22:02,270 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:22:02,286 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:22:02,440 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:22:02,445 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:22:02,462 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:22:02,477 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:22:02,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:02 WrapperNode [2020-07-10 20:22:02,478 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:22:02,478 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:22:02,479 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:22:02,479 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:22:02,492 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:02" (1/1) ... [2020-07-10 20:22:02,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:02" (1/1) ... [2020-07-10 20:22:02,498 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:02" (1/1) ... [2020-07-10 20:22:02,498 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:02" (1/1) ... [2020-07-10 20:22:02,503 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:02" (1/1) ... [2020-07-10 20:22:02,509 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:02" (1/1) ... [2020-07-10 20:22:02,510 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:02" (1/1) ... [2020-07-10 20:22:02,595 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:22:02,596 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:22:02,596 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:22:02,596 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:22:02,597 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:02" (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-10 20:22:02,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:22:02,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:22:02,664 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:22:02,664 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:22:02,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:22:02,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:22:02,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-07-10 20:22:02,664 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:22:02,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:22:02,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:22:02,893 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:22:02,893 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 20:22:02,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:22:02 BoogieIcfgContainer [2020-07-10 20:22:02,901 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:22:02,902 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:22:02,903 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:22:02,906 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:22:02,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:22:02" (1/3) ... [2020-07-10 20:22:02,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bab6235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:22:02, skipping insertion in model container [2020-07-10 20:22:02,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:02" (2/3) ... [2020-07-10 20:22:02,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bab6235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:22:02, skipping insertion in model container [2020-07-10 20:22:02,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:22:02" (3/3) ... [2020-07-10 20:22:02,911 INFO L109 eAbstractionObserver]: Analyzing ICFG sum01_bug02_sum01_bug02_base.case.i [2020-07-10 20:22:02,924 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:22:02,933 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:22:02,951 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:22:02,988 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:22:02,991 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:22:02,991 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:22:02,992 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:22:02,992 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:22:02,992 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:22:02,992 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:22:02,992 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:22:03,015 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2020-07-10 20:22:03,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-10 20:22:03,034 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:03,035 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:22:03,035 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:03,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:03,042 INFO L82 PathProgramCache]: Analyzing trace with hash -290415040, now seen corresponding path program 1 times [2020-07-10 20:22:03,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:03,051 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [825880229] [2020-07-10 20:22:03,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:22:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:03,224 INFO L280 TraceCheckUtils]: 0: Hoare triple {30#true} assume true; {30#true} is VALID [2020-07-10 20:22:03,225 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {30#true} {30#true} #45#return; {30#true} is VALID [2020-07-10 20:22:03,227 INFO L263 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {30#true} is VALID [2020-07-10 20:22:03,229 INFO L280 TraceCheckUtils]: 1: Hoare triple {30#true} assume true; {30#true} is VALID [2020-07-10 20:22:03,229 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {30#true} {30#true} #45#return; {30#true} is VALID [2020-07-10 20:22:03,229 INFO L263 TraceCheckUtils]: 3: Hoare triple {30#true} call #t~ret2 := main(); {30#true} is VALID [2020-07-10 20:22:03,230 INFO L280 TraceCheckUtils]: 4: Hoare triple {30#true} havoc ~i~0; {30#true} is VALID [2020-07-10 20:22:03,230 INFO L280 TraceCheckUtils]: 5: Hoare triple {30#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {30#true} is VALID [2020-07-10 20:22:03,231 INFO L280 TraceCheckUtils]: 6: Hoare triple {30#true} havoc #t~nondet0; {30#true} is VALID [2020-07-10 20:22:03,231 INFO L280 TraceCheckUtils]: 7: Hoare triple {30#true} ~sn~0 := 0; {30#true} is VALID [2020-07-10 20:22:03,232 INFO L280 TraceCheckUtils]: 8: Hoare triple {30#true} ~i~0 := 1; {30#true} is VALID [2020-07-10 20:22:03,234 INFO L280 TraceCheckUtils]: 9: Hoare triple {30#true} assume !true; {31#false} is VALID [2020-07-10 20:22:03,234 INFO L263 TraceCheckUtils]: 10: Hoare triple {31#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {31#false} is VALID [2020-07-10 20:22:03,235 INFO L280 TraceCheckUtils]: 11: Hoare triple {31#false} ~cond := #in~cond; {31#false} is VALID [2020-07-10 20:22:03,235 INFO L280 TraceCheckUtils]: 12: Hoare triple {31#false} assume 0 == ~cond; {31#false} is VALID [2020-07-10 20:22:03,236 INFO L280 TraceCheckUtils]: 13: Hoare triple {31#false} assume !false; {31#false} is VALID [2020-07-10 20:22:03,238 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-10 20:22:03,238 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:03,241 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [825880229] [2020-07-10 20:22:03,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:03,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-10 20:22:03,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086806246] [2020-07-10 20:22:03,257 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2020-07-10 20:22:03,263 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:03,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-10 20:22:03,321 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-10 20:22:03,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-10 20:22:03,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:03,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-10 20:22:03,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-10 20:22:03,331 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2020-07-10 20:22:03,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:03,433 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2020-07-10 20:22:03,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-10 20:22:03,434 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2020-07-10 20:22:03,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:03,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 20:22:03,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 42 transitions. [2020-07-10 20:22:03,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 20:22:03,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 42 transitions. [2020-07-10 20:22:03,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 42 transitions. [2020-07-10 20:22:03,537 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-10 20:22:03,549 INFO L225 Difference]: With dead ends: 38 [2020-07-10 20:22:03,549 INFO L226 Difference]: Without dead ends: 21 [2020-07-10 20:22:03,553 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-10 20:22:03,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-10 20:22:03,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-10 20:22:03,603 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:03,604 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2020-07-10 20:22:03,605 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-10 20:22:03,605 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-10 20:22:03,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:03,609 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2020-07-10 20:22:03,610 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-10 20:22:03,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:03,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:03,611 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-10 20:22:03,611 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-10 20:22:03,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:03,615 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2020-07-10 20:22:03,615 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-10 20:22:03,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:03,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:03,617 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:03,617 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:03,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-10 20:22:03,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2020-07-10 20:22:03,622 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2020-07-10 20:22:03,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:03,622 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-07-10 20:22:03,623 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-10 20:22:03,623 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 22 transitions. [2020-07-10 20:22:03,661 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:03,661 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-10 20:22:03,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-10 20:22:03,662 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:03,662 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:22:03,663 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:22:03,663 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:03,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:03,664 INFO L82 PathProgramCache]: Analyzing trace with hash -304267855, now seen corresponding path program 1 times [2020-07-10 20:22:03,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:03,664 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1882238314] [2020-07-10 20:22:03,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:22:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:03,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:03,770 INFO L280 TraceCheckUtils]: 0: Hoare triple {196#true} assume true; {196#true} is VALID [2020-07-10 20:22:03,770 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {196#true} {196#true} #45#return; {196#true} is VALID [2020-07-10 20:22:03,771 INFO L263 TraceCheckUtils]: 0: Hoare triple {196#true} call ULTIMATE.init(); {196#true} is VALID [2020-07-10 20:22:03,771 INFO L280 TraceCheckUtils]: 1: Hoare triple {196#true} assume true; {196#true} is VALID [2020-07-10 20:22:03,771 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {196#true} {196#true} #45#return; {196#true} is VALID [2020-07-10 20:22:03,772 INFO L263 TraceCheckUtils]: 3: Hoare triple {196#true} call #t~ret2 := main(); {196#true} is VALID [2020-07-10 20:22:03,772 INFO L280 TraceCheckUtils]: 4: Hoare triple {196#true} havoc ~i~0; {196#true} is VALID [2020-07-10 20:22:03,772 INFO L280 TraceCheckUtils]: 5: Hoare triple {196#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {196#true} is VALID [2020-07-10 20:22:03,773 INFO L280 TraceCheckUtils]: 6: Hoare triple {196#true} havoc #t~nondet0; {196#true} is VALID [2020-07-10 20:22:03,774 INFO L280 TraceCheckUtils]: 7: Hoare triple {196#true} ~sn~0 := 0; {200#(= 0 main_~sn~0)} is VALID [2020-07-10 20:22:03,775 INFO L280 TraceCheckUtils]: 8: Hoare triple {200#(= 0 main_~sn~0)} ~i~0 := 1; {200#(= 0 main_~sn~0)} is VALID [2020-07-10 20:22:03,776 INFO L280 TraceCheckUtils]: 9: Hoare triple {200#(= 0 main_~sn~0)} assume !(~i~0 <= ~n~0); {200#(= 0 main_~sn~0)} is VALID [2020-07-10 20:22:03,778 INFO L263 TraceCheckUtils]: 10: Hoare triple {200#(= 0 main_~sn~0)} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {201#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:22:03,779 INFO L280 TraceCheckUtils]: 11: Hoare triple {201#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {202#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:22:03,780 INFO L280 TraceCheckUtils]: 12: Hoare triple {202#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {197#false} is VALID [2020-07-10 20:22:03,780 INFO L280 TraceCheckUtils]: 13: Hoare triple {197#false} assume !false; {197#false} is VALID [2020-07-10 20:22:03,782 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-10 20:22:03,782 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:03,783 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1882238314] [2020-07-10 20:22:03,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:03,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 20:22:03,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851667143] [2020-07-10 20:22:03,785 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-10 20:22:03,785 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:03,785 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 20:22:03,806 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-10 20:22:03,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 20:22:03,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:03,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 20:22:03,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:22:03,808 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 5 states. [2020-07-10 20:22:03,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:03,953 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-10 20:22:03,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 20:22:03,954 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-10 20:22:03,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:03,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:22:03,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2020-07-10 20:22:03,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:22:03,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2020-07-10 20:22:03,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 29 transitions. [2020-07-10 20:22:04,000 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-10 20:22:04,001 INFO L225 Difference]: With dead ends: 28 [2020-07-10 20:22:04,002 INFO L226 Difference]: Without dead ends: 23 [2020-07-10 20:22:04,003 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-10 20:22:04,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-10 20:22:04,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-07-10 20:22:04,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:04,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 22 states. [2020-07-10 20:22:04,022 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 22 states. [2020-07-10 20:22:04,022 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 22 states. [2020-07-10 20:22:04,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:04,025 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2020-07-10 20:22:04,025 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-10 20:22:04,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:04,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:04,026 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 23 states. [2020-07-10 20:22:04,026 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 23 states. [2020-07-10 20:22:04,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:04,029 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2020-07-10 20:22:04,029 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-10 20:22:04,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:04,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:04,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:04,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:04,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-10 20:22:04,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2020-07-10 20:22:04,032 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 14 [2020-07-10 20:22:04,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:04,033 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2020-07-10 20:22:04,033 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 20:22:04,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 23 transitions. [2020-07-10 20:22:04,065 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:04,066 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-10 20:22:04,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-10 20:22:04,067 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:04,067 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-10 20:22:04,067 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:22:04,067 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:04,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:04,068 INFO L82 PathProgramCache]: Analyzing trace with hash -887516915, now seen corresponding path program 1 times [2020-07-10 20:22:04,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:04,068 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [978500600] [2020-07-10 20:22:04,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:22:04,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:04,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:04,558 INFO L280 TraceCheckUtils]: 0: Hoare triple {353#true} assume true; {353#true} is VALID [2020-07-10 20:22:04,559 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {353#true} {353#true} #45#return; {353#true} is VALID [2020-07-10 20:22:04,559 INFO L263 TraceCheckUtils]: 0: Hoare triple {353#true} call ULTIMATE.init(); {353#true} is VALID [2020-07-10 20:22:04,560 INFO L280 TraceCheckUtils]: 1: Hoare triple {353#true} assume true; {353#true} is VALID [2020-07-10 20:22:04,560 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {353#true} {353#true} #45#return; {353#true} is VALID [2020-07-10 20:22:04,560 INFO L263 TraceCheckUtils]: 3: Hoare triple {353#true} call #t~ret2 := main(); {353#true} is VALID [2020-07-10 20:22:04,561 INFO L280 TraceCheckUtils]: 4: Hoare triple {353#true} havoc ~i~0; {353#true} is VALID [2020-07-10 20:22:04,561 INFO L280 TraceCheckUtils]: 5: Hoare triple {353#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {353#true} is VALID [2020-07-10 20:22:04,561 INFO L280 TraceCheckUtils]: 6: Hoare triple {353#true} havoc #t~nondet0; {353#true} is VALID [2020-07-10 20:22:04,562 INFO L280 TraceCheckUtils]: 7: Hoare triple {353#true} ~sn~0 := 0; {357#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-10 20:22:04,564 INFO L280 TraceCheckUtils]: 8: Hoare triple {357#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} ~i~0 := 1; {358#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-10 20:22:04,565 INFO L280 TraceCheckUtils]: 9: Hoare triple {358#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {359#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-10 20:22:04,566 INFO L280 TraceCheckUtils]: 10: Hoare triple {359#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} ~sn~0 := 2 + ~sn~0; {360#(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-10 20:22:04,568 INFO L280 TraceCheckUtils]: 11: Hoare triple {360#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} assume !(4 == ~i~0); {360#(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-10 20:22:04,569 INFO L280 TraceCheckUtils]: 12: Hoare triple {360#(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; {361#(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-10 20:22:04,571 INFO L280 TraceCheckUtils]: 13: Hoare triple {361#(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; {362#(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-10 20:22:04,572 INFO L280 TraceCheckUtils]: 14: Hoare triple {362#(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; {362#(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-10 20:22:04,573 INFO L280 TraceCheckUtils]: 15: Hoare triple {362#(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); {363#(and (<= main_~sn~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~sn~0))} is VALID [2020-07-10 20:22:04,575 INFO L263 TraceCheckUtils]: 16: Hoare triple {363#(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)); {364#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:22:04,576 INFO L280 TraceCheckUtils]: 17: Hoare triple {364#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {365#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:22:04,578 INFO L280 TraceCheckUtils]: 18: Hoare triple {365#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {354#false} is VALID [2020-07-10 20:22:04,578 INFO L280 TraceCheckUtils]: 19: Hoare triple {354#false} assume !false; {354#false} is VALID [2020-07-10 20:22:04,580 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-10 20:22:04,581 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:04,581 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [978500600] [2020-07-10 20:22:04,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:04,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-10 20:22:04,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874170350] [2020-07-10 20:22:04,582 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-07-10 20:22:04,582 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:04,583 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 20:22:04,617 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-10 20:22:04,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 20:22:04,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:04,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 20:22:04,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-07-10 20:22:04,619 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 11 states. [2020-07-10 20:22:05,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:05,185 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2020-07-10 20:22:05,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-10 20:22:05,186 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-07-10 20:22:05,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:05,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 20:22:05,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 37 transitions. [2020-07-10 20:22:05,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 20:22:05,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 37 transitions. [2020-07-10 20:22:05,192 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 37 transitions. [2020-07-10 20:22:05,235 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-10 20:22:05,236 INFO L225 Difference]: With dead ends: 35 [2020-07-10 20:22:05,236 INFO L226 Difference]: Without dead ends: 30 [2020-07-10 20:22:05,237 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-10 20:22:05,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-10 20:22:05,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2020-07-10 20:22:05,268 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:05,268 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 28 states. [2020-07-10 20:22:05,268 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 28 states. [2020-07-10 20:22:05,269 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 28 states. [2020-07-10 20:22:05,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:05,271 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2020-07-10 20:22:05,271 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2020-07-10 20:22:05,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:05,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:05,272 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 30 states. [2020-07-10 20:22:05,272 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 30 states. [2020-07-10 20:22:05,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:05,275 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2020-07-10 20:22:05,275 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2020-07-10 20:22:05,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:05,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:05,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:05,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:05,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-10 20:22:05,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2020-07-10 20:22:05,278 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 20 [2020-07-10 20:22:05,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:05,279 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2020-07-10 20:22:05,279 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 20:22:05,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 30 transitions. [2020-07-10 20:22:05,317 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:05,317 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-10 20:22:05,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-10 20:22:05,318 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:05,318 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:22:05,319 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:22:05,319 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:05,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:05,319 INFO L82 PathProgramCache]: Analyzing trace with hash -507920327, now seen corresponding path program 1 times [2020-07-10 20:22:05,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:05,320 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [614703687] [2020-07-10 20:22:05,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 11 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 11 to 19 Garbage collection #2: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 Garbage collection #3: 37 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 37 to 73 [2020-07-10 20:22:05,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:05,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:05,407 INFO L280 TraceCheckUtils]: 0: Hoare triple {564#true} assume true; {564#true} is VALID [2020-07-10 20:22:05,408 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {564#true} {564#true} #45#return; {564#true} is VALID [2020-07-10 20:22:05,408 INFO L263 TraceCheckUtils]: 0: Hoare triple {564#true} call ULTIMATE.init(); {564#true} is VALID [2020-07-10 20:22:05,408 INFO L280 TraceCheckUtils]: 1: Hoare triple {564#true} assume true; {564#true} is VALID [2020-07-10 20:22:05,409 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {564#true} {564#true} #45#return; {564#true} is VALID [2020-07-10 20:22:05,409 INFO L263 TraceCheckUtils]: 3: Hoare triple {564#true} call #t~ret2 := main(); {564#true} is VALID [2020-07-10 20:22:05,409 INFO L280 TraceCheckUtils]: 4: Hoare triple {564#true} havoc ~i~0; {564#true} is VALID [2020-07-10 20:22:05,410 INFO L280 TraceCheckUtils]: 5: Hoare triple {564#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {564#true} is VALID [2020-07-10 20:22:05,410 INFO L280 TraceCheckUtils]: 6: Hoare triple {564#true} havoc #t~nondet0; {564#true} is VALID [2020-07-10 20:22:05,410 INFO L280 TraceCheckUtils]: 7: Hoare triple {564#true} ~sn~0 := 0; {564#true} is VALID [2020-07-10 20:22:05,411 INFO L280 TraceCheckUtils]: 8: Hoare triple {564#true} ~i~0 := 1; {568#(<= main_~i~0 1)} is VALID [2020-07-10 20:22:05,413 INFO L280 TraceCheckUtils]: 9: Hoare triple {568#(<= main_~i~0 1)} [51] L13-6-->L13-7_primed: Formula: (let ((.cse1 (* 2 v_oct_main_~i~0_in_1)) (.cse2 (+ v_oct_main_~i~0_in_1 1)) (.cse0 (+ (* 2 v_oct_main_~sn~0_out_1) 20))) (and (<= v_oct_main_~n~0_in_1 v_oct_main_~n~0_out_1) (<= 0 .cse0) (<= .cse1 8) (<= .cse2 v_oct_main_~i~0_out_1) (<= v_oct_main_~n~0_out_1 v_oct_main_~n~0_in_1) (<= v_oct_main_~i~0_in_1 v_oct_main_~n~0_in_1) (<= 8 .cse1) (<= v_oct_main_~i~0_out_1 .cse2) (<= .cse0 0))) InVars {main_~i~0=v_oct_main_~i~0_in_1, main_~n~0=v_oct_main_~n~0_in_1} OutVars{main_~i~0=v_oct_main_~i~0_out_1, main_~n~0=v_oct_main_~n~0_out_1, main_~sn~0=v_oct_main_~sn~0_out_1, main_#t~post1=|v_oct_main_#t~post1_out_1|} AuxVars[] AssignedVars[main_~sn~0, main_#t~post1, main_~i~0, main_~n~0] {565#false} is VALID [2020-07-10 20:22:05,413 INFO L280 TraceCheckUtils]: 10: Hoare triple {565#false} [50] L13-7_primed-->L13-7: Formula: (not (<= v_main_~i~0_3 v_main_~n~0_2)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {565#false} is VALID [2020-07-10 20:22:05,414 INFO L263 TraceCheckUtils]: 11: Hoare triple {565#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {565#false} is VALID [2020-07-10 20:22:05,414 INFO L280 TraceCheckUtils]: 12: Hoare triple {565#false} ~cond := #in~cond; {565#false} is VALID [2020-07-10 20:22:05,414 INFO L280 TraceCheckUtils]: 13: Hoare triple {565#false} assume 0 == ~cond; {565#false} is VALID [2020-07-10 20:22:05,415 INFO L280 TraceCheckUtils]: 14: Hoare triple {565#false} assume !false; {565#false} is VALID [2020-07-10 20:22:05,415 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-10 20:22:05,445 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:05,446 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [614703687] [2020-07-10 20:22:05,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:05,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 20:22:05,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115252703] [2020-07-10 20:22:05,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-07-10 20:22:05,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:05,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 20:22:05,469 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-10 20:22:05,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 20:22:05,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:05,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 20:22:05,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-10 20:22:05,471 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 4 states. [2020-07-10 20:22:05,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:05,579 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2020-07-10 20:22:05,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 20:22:05,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-07-10 20:22:05,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:05,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 20:22:05,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2020-07-10 20:22:05,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 20:22:05,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2020-07-10 20:22:05,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 41 transitions. [2020-07-10 20:22:05,639 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-10 20:22:05,640 INFO L225 Difference]: With dead ends: 40 [2020-07-10 20:22:05,640 INFO L226 Difference]: Without dead ends: 28 [2020-07-10 20:22:05,641 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-10 20:22:05,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-10 20:22:05,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-10 20:22:05,684 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:05,685 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-10 20:22:05,685 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-10 20:22:05,685 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-10 20:22:05,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:05,688 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-10 20:22:05,688 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-10 20:22:05,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:05,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:05,689 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-10 20:22:05,689 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-10 20:22:05,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:05,694 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-10 20:22:05,694 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-10 20:22:05,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:05,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:05,697 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:05,698 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:05,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-10 20:22:05,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2020-07-10 20:22:05,699 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 21 [2020-07-10 20:22:05,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:05,700 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2020-07-10 20:22:05,700 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 20:22:05,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 29 transitions. [2020-07-10 20:22:05,738 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-10 20:22:05,738 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-10 20:22:05,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 20:22:05,739 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:05,739 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-10 20:22:05,739 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 20:22:05,740 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:05,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:05,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1934159721, now seen corresponding path program 2 times [2020-07-10 20:22:05,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:05,740 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1383271956] [2020-07-10 20:22:05,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:22:05,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:06,193 INFO L280 TraceCheckUtils]: 0: Hoare triple {764#true} assume true; {764#true} is VALID [2020-07-10 20:22:06,194 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {764#true} {764#true} #45#return; {764#true} is VALID [2020-07-10 20:22:06,194 INFO L263 TraceCheckUtils]: 0: Hoare triple {764#true} call ULTIMATE.init(); {764#true} is VALID [2020-07-10 20:22:06,194 INFO L280 TraceCheckUtils]: 1: Hoare triple {764#true} assume true; {764#true} is VALID [2020-07-10 20:22:06,195 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {764#true} {764#true} #45#return; {764#true} is VALID [2020-07-10 20:22:06,195 INFO L263 TraceCheckUtils]: 3: Hoare triple {764#true} call #t~ret2 := main(); {764#true} is VALID [2020-07-10 20:22:06,195 INFO L280 TraceCheckUtils]: 4: Hoare triple {764#true} havoc ~i~0; {764#true} is VALID [2020-07-10 20:22:06,195 INFO L280 TraceCheckUtils]: 5: Hoare triple {764#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {764#true} is VALID [2020-07-10 20:22:06,196 INFO L280 TraceCheckUtils]: 6: Hoare triple {764#true} havoc #t~nondet0; {764#true} is VALID [2020-07-10 20:22:06,200 INFO L280 TraceCheckUtils]: 7: Hoare triple {764#true} ~sn~0 := 0; {768#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-10 20:22:06,201 INFO L280 TraceCheckUtils]: 8: Hoare triple {768#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} ~i~0 := 1; {769#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-10 20:22:06,203 INFO L280 TraceCheckUtils]: 9: Hoare triple {769#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {769#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-10 20:22:06,204 INFO L280 TraceCheckUtils]: 10: Hoare triple {769#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} ~sn~0 := 2 + ~sn~0; {770#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} is VALID [2020-07-10 20:22:06,205 INFO L280 TraceCheckUtils]: 11: Hoare triple {770#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} assume !(4 == ~i~0); {770#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} is VALID [2020-07-10 20:22:06,206 INFO L280 TraceCheckUtils]: 12: Hoare triple {770#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} #t~post1 := ~i~0; {771#(and (<= main_~sn~0 (* 2 |main_#t~post1|)) (<= (* 2 |main_#t~post1|) main_~sn~0))} is VALID [2020-07-10 20:22:06,207 INFO L280 TraceCheckUtils]: 13: Hoare triple {771#(and (<= main_~sn~0 (* 2 |main_#t~post1|)) (<= (* 2 |main_#t~post1|) main_~sn~0))} ~i~0 := 1 + #t~post1; {769#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-10 20:22:06,208 INFO L280 TraceCheckUtils]: 14: Hoare triple {769#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} havoc #t~post1; {769#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-10 20:22:06,209 INFO L280 TraceCheckUtils]: 15: Hoare triple {769#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {772#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-10 20:22:06,211 INFO L280 TraceCheckUtils]: 16: Hoare triple {772#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} ~sn~0 := 2 + ~sn~0; {773#(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-10 20:22:06,212 INFO L280 TraceCheckUtils]: 17: Hoare triple {773#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} assume !(4 == ~i~0); {773#(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-10 20:22:06,213 INFO L280 TraceCheckUtils]: 18: Hoare triple {773#(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; {774#(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-10 20:22:06,214 INFO L280 TraceCheckUtils]: 19: Hoare triple {774#(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; {775#(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-10 20:22:06,215 INFO L280 TraceCheckUtils]: 20: Hoare triple {775#(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; {775#(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-10 20:22:06,219 INFO L280 TraceCheckUtils]: 21: Hoare triple {775#(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); {776#(and (<= main_~sn~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~sn~0))} is VALID [2020-07-10 20:22:06,220 INFO L263 TraceCheckUtils]: 22: Hoare triple {776#(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)); {777#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:22:06,221 INFO L280 TraceCheckUtils]: 23: Hoare triple {777#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {778#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:22:06,222 INFO L280 TraceCheckUtils]: 24: Hoare triple {778#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {765#false} is VALID [2020-07-10 20:22:06,222 INFO L280 TraceCheckUtils]: 25: Hoare triple {765#false} assume !false; {765#false} is VALID [2020-07-10 20:22:06,225 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-10 20:22:06,225 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:06,226 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1383271956] [2020-07-10 20:22:06,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:06,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-10 20:22:06,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372810991] [2020-07-10 20:22:06,227 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2020-07-10 20:22:06,227 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:06,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-10 20:22:06,257 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-10 20:22:06,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-10 20:22:06,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:06,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-10 20:22:06,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-07-10 20:22:06,259 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 13 states. [2020-07-10 20:22:07,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:07,029 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2020-07-10 20:22:07,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-10 20:22:07,029 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2020-07-10 20:22:07,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:07,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 20:22:07,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 37 transitions. [2020-07-10 20:22:07,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 20:22:07,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 37 transitions. [2020-07-10 20:22:07,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 37 transitions. [2020-07-10 20:22:07,081 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-10 20:22:07,083 INFO L225 Difference]: With dead ends: 40 [2020-07-10 20:22:07,083 INFO L226 Difference]: Without dead ends: 35 [2020-07-10 20:22:07,084 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-10 20:22:07,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-10 20:22:07,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2020-07-10 20:22:07,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:07,129 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 30 states. [2020-07-10 20:22:07,129 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 30 states. [2020-07-10 20:22:07,130 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 30 states. [2020-07-10 20:22:07,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:07,132 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2020-07-10 20:22:07,132 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-10 20:22:07,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:07,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:07,133 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 35 states. [2020-07-10 20:22:07,133 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 35 states. [2020-07-10 20:22:07,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:07,138 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2020-07-10 20:22:07,138 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-10 20:22:07,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:07,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:07,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:07,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:07,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-10 20:22:07,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2020-07-10 20:22:07,141 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 26 [2020-07-10 20:22:07,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:07,143 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2020-07-10 20:22:07,143 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-10 20:22:07,143 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 32 transitions. [2020-07-10 20:22:07,178 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:07,179 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2020-07-10 20:22:07,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 20:22:07,180 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:07,180 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:22:07,180 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 20:22:07,182 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:07,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:07,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1064709469, now seen corresponding path program 1 times [2020-07-10 20:22:07,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:07,183 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [484165270] [2020-07-10 20:22:07,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:22:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:07,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:07,253 INFO L280 TraceCheckUtils]: 0: Hoare triple {1009#true} assume true; {1009#true} is VALID [2020-07-10 20:22:07,253 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1009#true} {1009#true} #45#return; {1009#true} is VALID [2020-07-10 20:22:07,253 INFO L263 TraceCheckUtils]: 0: Hoare triple {1009#true} call ULTIMATE.init(); {1009#true} is VALID [2020-07-10 20:22:07,254 INFO L280 TraceCheckUtils]: 1: Hoare triple {1009#true} assume true; {1009#true} is VALID [2020-07-10 20:22:07,254 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1009#true} {1009#true} #45#return; {1009#true} is VALID [2020-07-10 20:22:07,254 INFO L263 TraceCheckUtils]: 3: Hoare triple {1009#true} call #t~ret2 := main(); {1009#true} is VALID [2020-07-10 20:22:07,255 INFO L280 TraceCheckUtils]: 4: Hoare triple {1009#true} havoc ~i~0; {1009#true} is VALID [2020-07-10 20:22:07,255 INFO L280 TraceCheckUtils]: 5: Hoare triple {1009#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {1009#true} is VALID [2020-07-10 20:22:07,255 INFO L280 TraceCheckUtils]: 6: Hoare triple {1009#true} havoc #t~nondet0; {1009#true} is VALID [2020-07-10 20:22:07,255 INFO L280 TraceCheckUtils]: 7: Hoare triple {1009#true} ~sn~0 := 0; {1009#true} is VALID [2020-07-10 20:22:07,256 INFO L280 TraceCheckUtils]: 8: Hoare triple {1009#true} ~i~0 := 1; {1013#(<= main_~i~0 1)} is VALID [2020-07-10 20:22:07,257 INFO L280 TraceCheckUtils]: 9: Hoare triple {1013#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {1013#(<= main_~i~0 1)} is VALID [2020-07-10 20:22:07,258 INFO L280 TraceCheckUtils]: 10: Hoare triple {1013#(<= main_~i~0 1)} ~sn~0 := 2 + ~sn~0; {1013#(<= main_~i~0 1)} is VALID [2020-07-10 20:22:07,258 INFO L280 TraceCheckUtils]: 11: Hoare triple {1013#(<= main_~i~0 1)} assume !(4 == ~i~0); {1013#(<= main_~i~0 1)} is VALID [2020-07-10 20:22:07,259 INFO L280 TraceCheckUtils]: 12: Hoare triple {1013#(<= main_~i~0 1)} #t~post1 := ~i~0; {1014#(<= |main_#t~post1| 1)} is VALID [2020-07-10 20:22:07,260 INFO L280 TraceCheckUtils]: 13: Hoare triple {1014#(<= |main_#t~post1| 1)} ~i~0 := 1 + #t~post1; {1015#(<= main_~i~0 2)} is VALID [2020-07-10 20:22:07,261 INFO L280 TraceCheckUtils]: 14: Hoare triple {1015#(<= main_~i~0 2)} havoc #t~post1; {1015#(<= main_~i~0 2)} is VALID [2020-07-10 20:22:07,261 INFO L280 TraceCheckUtils]: 15: Hoare triple {1015#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {1015#(<= main_~i~0 2)} is VALID [2020-07-10 20:22:07,262 INFO L280 TraceCheckUtils]: 16: Hoare triple {1015#(<= main_~i~0 2)} ~sn~0 := 2 + ~sn~0; {1015#(<= main_~i~0 2)} is VALID [2020-07-10 20:22:07,263 INFO L280 TraceCheckUtils]: 17: Hoare triple {1015#(<= main_~i~0 2)} assume 4 == ~i~0; {1010#false} is VALID [2020-07-10 20:22:07,263 INFO L280 TraceCheckUtils]: 18: Hoare triple {1010#false} ~sn~0 := -10; {1010#false} is VALID [2020-07-10 20:22:07,263 INFO L280 TraceCheckUtils]: 19: Hoare triple {1010#false} #t~post1 := ~i~0; {1010#false} is VALID [2020-07-10 20:22:07,263 INFO L280 TraceCheckUtils]: 20: Hoare triple {1010#false} ~i~0 := 1 + #t~post1; {1010#false} is VALID [2020-07-10 20:22:07,264 INFO L280 TraceCheckUtils]: 21: Hoare triple {1010#false} havoc #t~post1; {1010#false} is VALID [2020-07-10 20:22:07,264 INFO L280 TraceCheckUtils]: 22: Hoare triple {1010#false} assume !(~i~0 <= ~n~0); {1010#false} is VALID [2020-07-10 20:22:07,264 INFO L263 TraceCheckUtils]: 23: Hoare triple {1010#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1010#false} is VALID [2020-07-10 20:22:07,265 INFO L280 TraceCheckUtils]: 24: Hoare triple {1010#false} ~cond := #in~cond; {1010#false} is VALID [2020-07-10 20:22:07,265 INFO L280 TraceCheckUtils]: 25: Hoare triple {1010#false} assume 0 == ~cond; {1010#false} is VALID [2020-07-10 20:22:07,265 INFO L280 TraceCheckUtils]: 26: Hoare triple {1010#false} assume !false; {1010#false} is VALID [2020-07-10 20:22:07,266 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-10 20:22:07,266 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:07,267 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [484165270] [2020-07-10 20:22:07,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:07,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 20:22:07,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738403534] [2020-07-10 20:22:07,268 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-07-10 20:22:07,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:07,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 20:22:07,299 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-10 20:22:07,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 20:22:07,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:07,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 20:22:07,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:22:07,301 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 5 states. [2020-07-10 20:22:07,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:07,474 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2020-07-10 20:22:07,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 20:22:07,475 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-07-10 20:22:07,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:07,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:22:07,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2020-07-10 20:22:07,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:22:07,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2020-07-10 20:22:07,480 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 47 transitions. [2020-07-10 20:22:07,526 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:07,527 INFO L225 Difference]: With dead ends: 50 [2020-07-10 20:22:07,527 INFO L226 Difference]: Without dead ends: 38 [2020-07-10 20:22:07,528 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-10 20:22:07,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-10 20:22:07,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2020-07-10 20:22:07,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:07,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 36 states. [2020-07-10 20:22:07,584 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 36 states. [2020-07-10 20:22:07,584 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 36 states. [2020-07-10 20:22:07,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:07,586 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2020-07-10 20:22:07,586 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2020-07-10 20:22:07,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:07,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:07,587 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 38 states. [2020-07-10 20:22:07,587 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 38 states. [2020-07-10 20:22:07,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:07,589 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2020-07-10 20:22:07,589 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2020-07-10 20:22:07,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:07,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:07,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:07,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:07,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-10 20:22:07,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2020-07-10 20:22:07,592 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 27 [2020-07-10 20:22:07,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:07,592 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2020-07-10 20:22:07,593 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 20:22:07,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 38 transitions. [2020-07-10 20:22:07,656 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-10 20:22:07,656 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2020-07-10 20:22:07,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-10 20:22:07,658 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:07,658 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:22:07,658 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 20:22:07,659 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:07,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:07,659 INFO L82 PathProgramCache]: Analyzing trace with hash -674418815, now seen corresponding path program 2 times [2020-07-10 20:22:07,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:07,659 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1744355439] [2020-07-10 20:22:07,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:22:07,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:07,770 INFO L280 TraceCheckUtils]: 0: Hoare triple {1270#true} assume true; {1270#true} is VALID [2020-07-10 20:22:07,771 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1270#true} {1270#true} #45#return; {1270#true} is VALID [2020-07-10 20:22:07,771 INFO L263 TraceCheckUtils]: 0: Hoare triple {1270#true} call ULTIMATE.init(); {1270#true} is VALID [2020-07-10 20:22:07,771 INFO L280 TraceCheckUtils]: 1: Hoare triple {1270#true} assume true; {1270#true} is VALID [2020-07-10 20:22:07,772 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1270#true} {1270#true} #45#return; {1270#true} is VALID [2020-07-10 20:22:07,772 INFO L263 TraceCheckUtils]: 3: Hoare triple {1270#true} call #t~ret2 := main(); {1270#true} is VALID [2020-07-10 20:22:07,772 INFO L280 TraceCheckUtils]: 4: Hoare triple {1270#true} havoc ~i~0; {1270#true} is VALID [2020-07-10 20:22:07,772 INFO L280 TraceCheckUtils]: 5: Hoare triple {1270#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {1270#true} is VALID [2020-07-10 20:22:07,773 INFO L280 TraceCheckUtils]: 6: Hoare triple {1270#true} havoc #t~nondet0; {1270#true} is VALID [2020-07-10 20:22:07,773 INFO L280 TraceCheckUtils]: 7: Hoare triple {1270#true} ~sn~0 := 0; {1270#true} is VALID [2020-07-10 20:22:07,774 INFO L280 TraceCheckUtils]: 8: Hoare triple {1270#true} ~i~0 := 1; {1274#(<= main_~i~0 1)} is VALID [2020-07-10 20:22:07,774 INFO L280 TraceCheckUtils]: 9: Hoare triple {1274#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {1274#(<= main_~i~0 1)} is VALID [2020-07-10 20:22:07,775 INFO L280 TraceCheckUtils]: 10: Hoare triple {1274#(<= main_~i~0 1)} ~sn~0 := 2 + ~sn~0; {1274#(<= main_~i~0 1)} is VALID [2020-07-10 20:22:07,776 INFO L280 TraceCheckUtils]: 11: Hoare triple {1274#(<= main_~i~0 1)} assume !(4 == ~i~0); {1274#(<= main_~i~0 1)} is VALID [2020-07-10 20:22:07,776 INFO L280 TraceCheckUtils]: 12: Hoare triple {1274#(<= main_~i~0 1)} #t~post1 := ~i~0; {1275#(<= |main_#t~post1| 1)} is VALID [2020-07-10 20:22:07,777 INFO L280 TraceCheckUtils]: 13: Hoare triple {1275#(<= |main_#t~post1| 1)} ~i~0 := 1 + #t~post1; {1276#(<= main_~i~0 2)} is VALID [2020-07-10 20:22:07,778 INFO L280 TraceCheckUtils]: 14: Hoare triple {1276#(<= main_~i~0 2)} havoc #t~post1; {1276#(<= main_~i~0 2)} is VALID [2020-07-10 20:22:07,779 INFO L280 TraceCheckUtils]: 15: Hoare triple {1276#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {1276#(<= main_~i~0 2)} is VALID [2020-07-10 20:22:07,779 INFO L280 TraceCheckUtils]: 16: Hoare triple {1276#(<= main_~i~0 2)} ~sn~0 := 2 + ~sn~0; {1276#(<= main_~i~0 2)} is VALID [2020-07-10 20:22:07,780 INFO L280 TraceCheckUtils]: 17: Hoare triple {1276#(<= main_~i~0 2)} assume !(4 == ~i~0); {1276#(<= main_~i~0 2)} is VALID [2020-07-10 20:22:07,781 INFO L280 TraceCheckUtils]: 18: Hoare triple {1276#(<= main_~i~0 2)} #t~post1 := ~i~0; {1277#(<= |main_#t~post1| 2)} is VALID [2020-07-10 20:22:07,781 INFO L280 TraceCheckUtils]: 19: Hoare triple {1277#(<= |main_#t~post1| 2)} ~i~0 := 1 + #t~post1; {1278#(<= main_~i~0 3)} is VALID [2020-07-10 20:22:07,782 INFO L280 TraceCheckUtils]: 20: Hoare triple {1278#(<= main_~i~0 3)} havoc #t~post1; {1278#(<= main_~i~0 3)} is VALID [2020-07-10 20:22:07,782 INFO L280 TraceCheckUtils]: 21: Hoare triple {1278#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {1278#(<= main_~i~0 3)} is VALID [2020-07-10 20:22:07,783 INFO L280 TraceCheckUtils]: 22: Hoare triple {1278#(<= main_~i~0 3)} ~sn~0 := 2 + ~sn~0; {1278#(<= main_~i~0 3)} is VALID [2020-07-10 20:22:07,783 INFO L280 TraceCheckUtils]: 23: Hoare triple {1278#(<= main_~i~0 3)} assume 4 == ~i~0; {1271#false} is VALID [2020-07-10 20:22:07,784 INFO L280 TraceCheckUtils]: 24: Hoare triple {1271#false} ~sn~0 := -10; {1271#false} is VALID [2020-07-10 20:22:07,784 INFO L280 TraceCheckUtils]: 25: Hoare triple {1271#false} #t~post1 := ~i~0; {1271#false} is VALID [2020-07-10 20:22:07,784 INFO L280 TraceCheckUtils]: 26: Hoare triple {1271#false} ~i~0 := 1 + #t~post1; {1271#false} is VALID [2020-07-10 20:22:07,784 INFO L280 TraceCheckUtils]: 27: Hoare triple {1271#false} havoc #t~post1; {1271#false} is VALID [2020-07-10 20:22:07,785 INFO L280 TraceCheckUtils]: 28: Hoare triple {1271#false} assume !(~i~0 <= ~n~0); {1271#false} is VALID [2020-07-10 20:22:07,785 INFO L263 TraceCheckUtils]: 29: Hoare triple {1271#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1271#false} is VALID [2020-07-10 20:22:07,785 INFO L280 TraceCheckUtils]: 30: Hoare triple {1271#false} ~cond := #in~cond; {1271#false} is VALID [2020-07-10 20:22:07,785 INFO L280 TraceCheckUtils]: 31: Hoare triple {1271#false} assume 0 == ~cond; {1271#false} is VALID [2020-07-10 20:22:07,786 INFO L280 TraceCheckUtils]: 32: Hoare triple {1271#false} assume !false; {1271#false} is VALID [2020-07-10 20:22:07,787 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-10 20:22:07,787 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:07,788 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1744355439] [2020-07-10 20:22:07,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:07,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 20:22:07,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54268412] [2020-07-10 20:22:07,789 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-07-10 20:22:07,789 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:07,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 20:22:07,827 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-10 20:22:07,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 20:22:07,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:07,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 20:22:07,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-10 20:22:07,829 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 7 states. [2020-07-10 20:22:08,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:08,096 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2020-07-10 20:22:08,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 20:22:08,097 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-07-10 20:22:08,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:08,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 20:22:08,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 53 transitions. [2020-07-10 20:22:08,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 20:22:08,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 53 transitions. [2020-07-10 20:22:08,101 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 53 transitions. [2020-07-10 20:22:08,159 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:08,161 INFO L225 Difference]: With dead ends: 56 [2020-07-10 20:22:08,162 INFO L226 Difference]: Without dead ends: 44 [2020-07-10 20:22:08,163 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-10 20:22:08,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-10 20:22:08,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-07-10 20:22:08,236 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:08,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 42 states. [2020-07-10 20:22:08,236 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 42 states. [2020-07-10 20:22:08,237 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 42 states. [2020-07-10 20:22:08,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:08,240 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2020-07-10 20:22:08,240 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2020-07-10 20:22:08,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:08,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:08,241 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 44 states. [2020-07-10 20:22:08,241 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 44 states. [2020-07-10 20:22:08,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:08,244 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2020-07-10 20:22:08,245 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2020-07-10 20:22:08,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:08,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:08,245 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:08,245 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:08,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-10 20:22:08,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2020-07-10 20:22:08,248 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 33 [2020-07-10 20:22:08,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:08,248 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2020-07-10 20:22:08,249 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 20:22:08,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 44 transitions. [2020-07-10 20:22:08,305 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:08,306 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2020-07-10 20:22:08,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-10 20:22:08,307 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:08,307 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:22:08,308 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-10 20:22:08,308 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:08,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:08,309 INFO L82 PathProgramCache]: Analyzing trace with hash -809826651, now seen corresponding path program 3 times [2020-07-10 20:22:08,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:08,309 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [909918390] [2020-07-10 20:22:08,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:22:08,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 20:22:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 20:22:08,419 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:08,420 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-10 20:22:08,420 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 20:22:08,421 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-10 20:22:08,441 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 20:22:08,441 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 20:22:08,441 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 20:22:08,441 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 20:22:08,441 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-10 20:22:08,441 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 20:22:08,442 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 20:22:08,442 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 20:22:08,442 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-10 20:22:08,442 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 20:22:08,442 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 20:22:08,442 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 20:22:08,442 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2020-07-10 20:22:08,442 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 20:22:08,443 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 20:22:08,443 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-10 20:22:08,443 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2020-07-10 20:22:08,443 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 20:22:08,443 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 20:22:08,443 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 20:22:08,443 WARN L170 areAnnotationChecker]: L13-6 has no Hoare annotation [2020-07-10 20:22:08,443 WARN L170 areAnnotationChecker]: L13-6 has no Hoare annotation [2020-07-10 20:22:08,444 WARN L170 areAnnotationChecker]: L13-6 has no Hoare annotation [2020-07-10 20:22:08,444 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 20:22:08,444 WARN L170 areAnnotationChecker]: L13-7 has no Hoare annotation [2020-07-10 20:22:08,444 WARN L170 areAnnotationChecker]: L13-7 has no Hoare annotation [2020-07-10 20:22:08,444 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-10 20:22:08,444 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-10 20:22:08,444 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-10 20:22:08,444 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2020-07-10 20:22:08,444 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-10 20:22:08,445 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2020-07-10 20:22:08,445 WARN L170 areAnnotationChecker]: L13-5 has no Hoare annotation [2020-07-10 20:22:08,445 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-10 20:22:08,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 08:22:08 BoogieIcfgContainer [2020-07-10 20:22:08,448 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 20:22:08,457 INFO L168 Benchmark]: Toolchain (without parser) took 6198.73 ms. Allocated memory was 138.9 MB in the beginning and 274.2 MB in the end (delta: 135.3 MB). Free memory was 103.8 MB in the beginning and 142.3 MB in the end (delta: -38.6 MB). Peak memory consumption was 96.7 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:08,464 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 138.9 MB. Free memory was 122.3 MB in the beginning and 122.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-10 20:22:08,465 INFO L168 Benchmark]: CACSL2BoogieTranslator took 224.40 ms. Allocated memory is still 138.9 MB. Free memory was 103.6 MB in the beginning and 94.0 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:08,465 INFO L168 Benchmark]: Boogie Preprocessor took 117.30 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 94.0 MB in the beginning and 183.6 MB in the end (delta: -89.6 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:08,466 INFO L168 Benchmark]: RCFGBuilder took 305.18 ms. Allocated memory is still 203.4 MB. Free memory was 183.6 MB in the beginning and 167.3 MB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:08,468 INFO L168 Benchmark]: TraceAbstraction took 5546.02 ms. Allocated memory was 203.4 MB in the beginning and 274.2 MB in the end (delta: 70.8 MB). Free memory was 166.6 MB in the beginning and 142.3 MB in the end (delta: 24.3 MB). Peak memory consumption was 95.0 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:08,474 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 138.9 MB. Free memory was 122.3 MB in the beginning and 122.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 224.40 ms. Allocated memory is still 138.9 MB. Free memory was 103.6 MB in the beginning and 94.0 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 117.30 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 94.0 MB in the beginning and 183.6 MB in the end (delta: -89.6 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 305.18 ms. Allocated memory is still 203.4 MB. Free memory was 183.6 MB in the beginning and 167.3 MB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5546.02 ms. Allocated memory was 203.4 MB in the beginning and 274.2 MB in the end (delta: 70.8 MB). Free memory was 166.6 MB in the beginning and 142.3 MB in the end (delta: 24.3 MB). Peak memory consumption was 95.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L13] i=1 [L13] COND TRUE i<=n [L14] sn = sn + (2) [L15] COND FALSE !(i==4) [L13] i++ [L13] COND TRUE i<=n [L14] sn = sn + (2) [L15] COND FALSE !(i==4) [L13] i++ [L13] COND TRUE i<=n [L14] sn = sn + (2) [L15] COND FALSE !(i==4) [L13] i++ [L13] COND TRUE i<=n [L14] sn = sn + (2) [L15] COND TRUE i==4 [L15] sn=-10 [L13] i++ [L13] COND FALSE !(i<=n) [L17] CALL __VERIFIER_assert(sn==n*(2) || sn == 0) [L4] COND TRUE !(cond) [L5] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5.4s, OverallIterations: 8, TraceHistogramMax: 4, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 131 SDtfs, 36 SDslu, 379 SDs, 0 SdLazy, 311 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 12 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, 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...