/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/loop-invgen/SpamAssassin-loop.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:48:26,340 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:48:26,343 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:48:26,360 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:48:26,360 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:48:26,362 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:48:26,364 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:48:26,373 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:48:26,374 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:48:26,379 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:48:26,380 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:48:26,381 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:48:26,381 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:48:26,382 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:48:26,383 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:48:26,385 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:48:26,387 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:48:26,390 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:48:26,391 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:48:26,396 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:48:26,399 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:48:26,402 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:48:26,403 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:48:26,404 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:48:26,406 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:48:26,406 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:48:26,406 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:48:26,409 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:48:26,409 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:48:26,411 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:48:26,411 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:48:26,412 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:48:26,413 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:48:26,414 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:48:26,415 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:48:26,415 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:48:26,417 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:48:26,417 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:48:26,417 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:48:26,418 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:48:26,420 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:48:26,420 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 00:48:26,435 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:48:26,436 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:48:26,437 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:48:26,437 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:48:26,438 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:48:26,438 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:48:26,438 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:48:26,438 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:48:26,439 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:48:26,439 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:48:26,440 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:48:26,440 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:48:26,440 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:48:26,440 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:48:26,443 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:48:26,443 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:48:26,443 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:48:26,443 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:48:26,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:48:26,445 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:48:26,445 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:48:26,447 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:48:26,447 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:48:26,737 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:48:26,749 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:48:26,753 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:48:26,754 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:48:26,755 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:48:26,755 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i [2020-07-18 00:48:26,810 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01d27b58f/71096da6b5544321bf29e5268594f37e/FLAG672aa3e05 [2020-07-18 00:48:27,267 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:48:27,268 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i [2020-07-18 00:48:27,275 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01d27b58f/71096da6b5544321bf29e5268594f37e/FLAG672aa3e05 [2020-07-18 00:48:27,658 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01d27b58f/71096da6b5544321bf29e5268594f37e [2020-07-18 00:48:27,666 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:48:27,669 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:48:27,670 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:48:27,671 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:48:27,674 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:48:27,675 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:48:27" (1/1) ... [2020-07-18 00:48:27,678 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24aa15b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:27, skipping insertion in model container [2020-07-18 00:48:27,678 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:48:27" (1/1) ... [2020-07-18 00:48:27,685 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:48:27,704 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:48:27,884 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:48:27,888 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:48:27,912 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:48:27,927 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:48:27,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:27 WrapperNode [2020-07-18 00:48:27,928 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:48:27,929 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:48:27,929 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:48:27,929 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:48:27,941 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:27" (1/1) ... [2020-07-18 00:48:27,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:27" (1/1) ... [2020-07-18 00:48:28,032 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:27" (1/1) ... [2020-07-18 00:48:28,033 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:27" (1/1) ... [2020-07-18 00:48:28,040 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:27" (1/1) ... [2020-07-18 00:48:28,046 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:27" (1/1) ... [2020-07-18 00:48:28,047 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:27" (1/1) ... [2020-07-18 00:48:28,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:48:28,049 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:48:28,050 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:48:28,050 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:48:28,051 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:27" (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-18 00:48:28,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:48:28,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:48:28,111 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-18 00:48:28,112 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-18 00:48:28,112 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:48:28,112 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:48:28,112 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-18 00:48:28,112 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-18 00:48:28,112 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-18 00:48:28,113 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 00:48:28,113 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:48:28,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:48:28,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:48:28,588 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:48:28,588 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-18 00:48:28,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:48:28 BoogieIcfgContainer [2020-07-18 00:48:28,592 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:48:28,594 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:48:28,594 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:48:28,597 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:48:28,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:48:27" (1/3) ... [2020-07-18 00:48:28,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a0055aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:48:28, skipping insertion in model container [2020-07-18 00:48:28,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:27" (2/3) ... [2020-07-18 00:48:28,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a0055aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:48:28, skipping insertion in model container [2020-07-18 00:48:28,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:48:28" (3/3) ... [2020-07-18 00:48:28,600 INFO L109 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i [2020-07-18 00:48:28,608 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:48:28,613 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:48:28,623 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:48:28,643 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:48:28,643 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:48:28,643 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:48:28,643 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:48:28,643 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:48:28,644 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:48:28,644 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:48:28,644 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:48:28,661 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2020-07-18 00:48:28,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-18 00:48:28,672 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:28,673 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:48:28,674 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:28,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:28,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1441743938, now seen corresponding path program 1 times [2020-07-18 00:48:28,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:28,689 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1031838327] [2020-07-18 00:48:28,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:28,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:28,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:28,933 INFO L280 TraceCheckUtils]: 0: Hoare triple {77#true} assume true; {77#true} is VALID [2020-07-18 00:48:28,933 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {77#true} {77#true} #119#return; {77#true} is VALID [2020-07-18 00:48:28,935 INFO L263 TraceCheckUtils]: 0: Hoare triple {77#true} call ULTIMATE.init(); {77#true} is VALID [2020-07-18 00:48:28,936 INFO L280 TraceCheckUtils]: 1: Hoare triple {77#true} assume true; {77#true} is VALID [2020-07-18 00:48:28,936 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {77#true} {77#true} #119#return; {77#true} is VALID [2020-07-18 00:48:28,937 INFO L263 TraceCheckUtils]: 3: Hoare triple {77#true} call #t~ret10 := main(); {77#true} is VALID [2020-07-18 00:48:28,937 INFO L280 TraceCheckUtils]: 4: Hoare triple {77#true} havoc ~len~0; {77#true} is VALID [2020-07-18 00:48:28,938 INFO L280 TraceCheckUtils]: 5: Hoare triple {77#true} havoc ~i~0; {77#true} is VALID [2020-07-18 00:48:28,938 INFO L280 TraceCheckUtils]: 6: Hoare triple {77#true} havoc ~j~0; {77#true} is VALID [2020-07-18 00:48:28,939 INFO L280 TraceCheckUtils]: 7: Hoare triple {77#true} havoc ~bufsize~0; {77#true} is VALID [2020-07-18 00:48:28,939 INFO L280 TraceCheckUtils]: 8: Hoare triple {77#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {77#true} is VALID [2020-07-18 00:48:28,939 INFO L280 TraceCheckUtils]: 9: Hoare triple {77#true} ~bufsize~0 := #t~nondet0; {77#true} is VALID [2020-07-18 00:48:28,940 INFO L280 TraceCheckUtils]: 10: Hoare triple {77#true} havoc #t~nondet0; {77#true} is VALID [2020-07-18 00:48:28,940 INFO L280 TraceCheckUtils]: 11: Hoare triple {77#true} assume !(~bufsize~0 < 0); {77#true} is VALID [2020-07-18 00:48:28,941 INFO L280 TraceCheckUtils]: 12: Hoare triple {77#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {77#true} is VALID [2020-07-18 00:48:28,941 INFO L280 TraceCheckUtils]: 13: Hoare triple {77#true} ~len~0 := #t~nondet1; {77#true} is VALID [2020-07-18 00:48:28,942 INFO L280 TraceCheckUtils]: 14: Hoare triple {77#true} havoc #t~nondet1; {77#true} is VALID [2020-07-18 00:48:28,942 INFO L280 TraceCheckUtils]: 15: Hoare triple {77#true} ~limit~0 := ~bufsize~0 - 4; {77#true} is VALID [2020-07-18 00:48:28,943 INFO L280 TraceCheckUtils]: 16: Hoare triple {77#true} ~i~0 := 0; {77#true} is VALID [2020-07-18 00:48:28,943 INFO L280 TraceCheckUtils]: 17: Hoare triple {77#true} assume !!(~i~0 < ~len~0); {77#true} is VALID [2020-07-18 00:48:28,944 INFO L280 TraceCheckUtils]: 18: Hoare triple {77#true} ~j~0 := 0; {77#true} is VALID [2020-07-18 00:48:28,944 INFO L280 TraceCheckUtils]: 19: Hoare triple {77#true} assume !!(~i~0 < ~len~0 && ~j~0 < ~limit~0); {77#true} is VALID [2020-07-18 00:48:28,946 INFO L280 TraceCheckUtils]: 20: Hoare triple {77#true} assume 1 + ~i~0 < ~len~0; {81#(< (+ main_~i~0 1) main_~len~0)} is VALID [2020-07-18 00:48:28,950 INFO L263 TraceCheckUtils]: 21: Hoare triple {81#(< (+ main_~i~0 1) main_~len~0)} call __VERIFIER_assert((if 1 + ~i~0 < ~len~0 then 1 else 0)); {82#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:48:28,951 INFO L280 TraceCheckUtils]: 22: Hoare triple {82#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {83#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:48:28,952 INFO L280 TraceCheckUtils]: 23: Hoare triple {83#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {78#false} is VALID [2020-07-18 00:48:28,952 INFO L280 TraceCheckUtils]: 24: Hoare triple {78#false} assume !false; {78#false} is VALID [2020-07-18 00:48:28,956 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-18 00:48:28,958 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:28,960 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1031838327] [2020-07-18 00:48:28,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:28,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 00:48:28,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352700274] [2020-07-18 00:48:28,970 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-07-18 00:48:28,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:28,976 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 00:48:29,017 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:29,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 00:48:29,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:29,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 00:48:29,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:48:29,030 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 5 states. [2020-07-18 00:48:29,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:29,710 INFO L93 Difference]: Finished difference Result 143 states and 210 transitions. [2020-07-18 00:48:29,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 00:48:29,710 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-07-18 00:48:29,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:29,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:48:29,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 210 transitions. [2020-07-18 00:48:29,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:48:29,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 210 transitions. [2020-07-18 00:48:29,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 210 transitions. [2020-07-18 00:48:30,020 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:30,036 INFO L225 Difference]: With dead ends: 143 [2020-07-18 00:48:30,036 INFO L226 Difference]: Without dead ends: 81 [2020-07-18 00:48:30,041 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-18 00:48:30,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-07-18 00:48:30,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 73. [2020-07-18 00:48:30,140 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:30,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 73 states. [2020-07-18 00:48:30,141 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 73 states. [2020-07-18 00:48:30,142 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 73 states. [2020-07-18 00:48:30,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:30,153 INFO L93 Difference]: Finished difference Result 81 states and 102 transitions. [2020-07-18 00:48:30,153 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 102 transitions. [2020-07-18 00:48:30,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:30,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:30,156 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 81 states. [2020-07-18 00:48:30,156 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 81 states. [2020-07-18 00:48:30,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:30,165 INFO L93 Difference]: Finished difference Result 81 states and 102 transitions. [2020-07-18 00:48:30,166 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 102 transitions. [2020-07-18 00:48:30,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:30,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:30,168 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:30,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:30,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-07-18 00:48:30,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 91 transitions. [2020-07-18 00:48:30,177 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 91 transitions. Word has length 25 [2020-07-18 00:48:30,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:30,177 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 91 transitions. [2020-07-18 00:48:30,177 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 00:48:30,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 73 states and 91 transitions. [2020-07-18 00:48:30,296 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:30,297 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 91 transitions. [2020-07-18 00:48:30,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-18 00:48:30,298 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:30,298 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:48:30,298 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:48:30,299 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:30,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:30,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1406858677, now seen corresponding path program 1 times [2020-07-18 00:48:30,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:30,300 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1778281341] [2020-07-18 00:48:30,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:30,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:30,409 INFO L280 TraceCheckUtils]: 0: Hoare triple {682#true} assume true; {682#true} is VALID [2020-07-18 00:48:30,409 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {682#true} {682#true} #119#return; {682#true} is VALID [2020-07-18 00:48:30,410 INFO L263 TraceCheckUtils]: 0: Hoare triple {682#true} call ULTIMATE.init(); {682#true} is VALID [2020-07-18 00:48:30,410 INFO L280 TraceCheckUtils]: 1: Hoare triple {682#true} assume true; {682#true} is VALID [2020-07-18 00:48:30,410 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {682#true} {682#true} #119#return; {682#true} is VALID [2020-07-18 00:48:30,411 INFO L263 TraceCheckUtils]: 3: Hoare triple {682#true} call #t~ret10 := main(); {682#true} is VALID [2020-07-18 00:48:30,411 INFO L280 TraceCheckUtils]: 4: Hoare triple {682#true} havoc ~len~0; {682#true} is VALID [2020-07-18 00:48:30,411 INFO L280 TraceCheckUtils]: 5: Hoare triple {682#true} havoc ~i~0; {682#true} is VALID [2020-07-18 00:48:30,412 INFO L280 TraceCheckUtils]: 6: Hoare triple {682#true} havoc ~j~0; {682#true} is VALID [2020-07-18 00:48:30,412 INFO L280 TraceCheckUtils]: 7: Hoare triple {682#true} havoc ~bufsize~0; {682#true} is VALID [2020-07-18 00:48:30,412 INFO L280 TraceCheckUtils]: 8: Hoare triple {682#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {682#true} is VALID [2020-07-18 00:48:30,413 INFO L280 TraceCheckUtils]: 9: Hoare triple {682#true} ~bufsize~0 := #t~nondet0; {682#true} is VALID [2020-07-18 00:48:30,413 INFO L280 TraceCheckUtils]: 10: Hoare triple {682#true} havoc #t~nondet0; {682#true} is VALID [2020-07-18 00:48:30,413 INFO L280 TraceCheckUtils]: 11: Hoare triple {682#true} assume !(~bufsize~0 < 0); {682#true} is VALID [2020-07-18 00:48:30,414 INFO L280 TraceCheckUtils]: 12: Hoare triple {682#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {682#true} is VALID [2020-07-18 00:48:30,414 INFO L280 TraceCheckUtils]: 13: Hoare triple {682#true} ~len~0 := #t~nondet1; {682#true} is VALID [2020-07-18 00:48:30,414 INFO L280 TraceCheckUtils]: 14: Hoare triple {682#true} havoc #t~nondet1; {682#true} is VALID [2020-07-18 00:48:30,415 INFO L280 TraceCheckUtils]: 15: Hoare triple {682#true} ~limit~0 := ~bufsize~0 - 4; {682#true} is VALID [2020-07-18 00:48:30,415 INFO L280 TraceCheckUtils]: 16: Hoare triple {682#true} ~i~0 := 0; {682#true} is VALID [2020-07-18 00:48:30,416 INFO L280 TraceCheckUtils]: 17: Hoare triple {682#true} assume !!(~i~0 < ~len~0); {686#(< main_~i~0 main_~len~0)} is VALID [2020-07-18 00:48:30,417 INFO L280 TraceCheckUtils]: 18: Hoare triple {686#(< main_~i~0 main_~len~0)} ~j~0 := 0; {686#(< main_~i~0 main_~len~0)} is VALID [2020-07-18 00:48:30,420 INFO L280 TraceCheckUtils]: 19: Hoare triple {686#(< main_~i~0 main_~len~0)} assume !!(~i~0 < ~len~0 && ~j~0 < ~limit~0); {686#(< main_~i~0 main_~len~0)} is VALID [2020-07-18 00:48:30,422 INFO L280 TraceCheckUtils]: 20: Hoare triple {686#(< main_~i~0 main_~len~0)} assume !(1 + ~i~0 < ~len~0); {686#(< main_~i~0 main_~len~0)} is VALID [2020-07-18 00:48:30,424 INFO L263 TraceCheckUtils]: 21: Hoare triple {686#(< main_~i~0 main_~len~0)} call __VERIFIER_assert((if ~i~0 < ~len~0 then 1 else 0)); {687#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:48:30,424 INFO L280 TraceCheckUtils]: 22: Hoare triple {687#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {688#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:48:30,425 INFO L280 TraceCheckUtils]: 23: Hoare triple {688#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {683#false} is VALID [2020-07-18 00:48:30,425 INFO L280 TraceCheckUtils]: 24: Hoare triple {683#false} assume !false; {683#false} is VALID [2020-07-18 00:48:30,427 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-18 00:48:30,427 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:30,427 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1778281341] [2020-07-18 00:48:30,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:30,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 00:48:30,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449294807] [2020-07-18 00:48:30,429 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-07-18 00:48:30,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:30,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 00:48:30,454 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:30,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 00:48:30,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:30,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 00:48:30,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:48:30,456 INFO L87 Difference]: Start difference. First operand 73 states and 91 transitions. Second operand 5 states. [2020-07-18 00:48:30,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:30,877 INFO L93 Difference]: Finished difference Result 85 states and 102 transitions. [2020-07-18 00:48:30,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 00:48:30,878 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-07-18 00:48:30,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:30,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:48:30,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions. [2020-07-18 00:48:30,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:48:30,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions. [2020-07-18 00:48:30,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 94 transitions. [2020-07-18 00:48:30,992 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:30,997 INFO L225 Difference]: With dead ends: 85 [2020-07-18 00:48:30,997 INFO L226 Difference]: Without dead ends: 83 [2020-07-18 00:48:30,998 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-18 00:48:30,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-07-18 00:48:31,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2020-07-18 00:48:31,081 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:31,081 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 81 states. [2020-07-18 00:48:31,081 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 81 states. [2020-07-18 00:48:31,081 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 81 states. [2020-07-18 00:48:31,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:31,088 INFO L93 Difference]: Finished difference Result 83 states and 100 transitions. [2020-07-18 00:48:31,088 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 100 transitions. [2020-07-18 00:48:31,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:31,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:31,092 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 83 states. [2020-07-18 00:48:31,093 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 83 states. [2020-07-18 00:48:31,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:31,103 INFO L93 Difference]: Finished difference Result 83 states and 100 transitions. [2020-07-18 00:48:31,103 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 100 transitions. [2020-07-18 00:48:31,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:31,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:31,106 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:31,106 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:31,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-07-18 00:48:31,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 97 transitions. [2020-07-18 00:48:31,113 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 97 transitions. Word has length 25 [2020-07-18 00:48:31,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:31,114 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 97 transitions. [2020-07-18 00:48:31,114 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 00:48:31,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 81 states and 97 transitions. [2020-07-18 00:48:31,231 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:31,231 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 97 transitions. [2020-07-18 00:48:31,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-18 00:48:31,232 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:31,232 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:48:31,233 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:48:31,233 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:31,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:31,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1771333938, now seen corresponding path program 1 times [2020-07-18 00:48:31,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:31,234 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [214508708] [2020-07-18 00:48:31,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:31,313 INFO L280 TraceCheckUtils]: 0: Hoare triple {1191#true} assume true; {1191#true} is VALID [2020-07-18 00:48:31,313 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1191#true} {1191#true} #119#return; {1191#true} is VALID [2020-07-18 00:48:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:31,320 INFO L280 TraceCheckUtils]: 0: Hoare triple {1191#true} ~cond := #in~cond; {1191#true} is VALID [2020-07-18 00:48:31,321 INFO L280 TraceCheckUtils]: 1: Hoare triple {1191#true} assume !(0 == ~cond); {1191#true} is VALID [2020-07-18 00:48:31,321 INFO L280 TraceCheckUtils]: 2: Hoare triple {1191#true} assume true; {1191#true} is VALID [2020-07-18 00:48:31,322 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1191#true} {1195#(<= 0 main_~i~0)} #123#return; {1195#(<= 0 main_~i~0)} is VALID [2020-07-18 00:48:31,323 INFO L263 TraceCheckUtils]: 0: Hoare triple {1191#true} call ULTIMATE.init(); {1191#true} is VALID [2020-07-18 00:48:31,323 INFO L280 TraceCheckUtils]: 1: Hoare triple {1191#true} assume true; {1191#true} is VALID [2020-07-18 00:48:31,323 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1191#true} {1191#true} #119#return; {1191#true} is VALID [2020-07-18 00:48:31,323 INFO L263 TraceCheckUtils]: 3: Hoare triple {1191#true} call #t~ret10 := main(); {1191#true} is VALID [2020-07-18 00:48:31,324 INFO L280 TraceCheckUtils]: 4: Hoare triple {1191#true} havoc ~len~0; {1191#true} is VALID [2020-07-18 00:48:31,324 INFO L280 TraceCheckUtils]: 5: Hoare triple {1191#true} havoc ~i~0; {1191#true} is VALID [2020-07-18 00:48:31,324 INFO L280 TraceCheckUtils]: 6: Hoare triple {1191#true} havoc ~j~0; {1191#true} is VALID [2020-07-18 00:48:31,325 INFO L280 TraceCheckUtils]: 7: Hoare triple {1191#true} havoc ~bufsize~0; {1191#true} is VALID [2020-07-18 00:48:31,325 INFO L280 TraceCheckUtils]: 8: Hoare triple {1191#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1191#true} is VALID [2020-07-18 00:48:31,325 INFO L280 TraceCheckUtils]: 9: Hoare triple {1191#true} ~bufsize~0 := #t~nondet0; {1191#true} is VALID [2020-07-18 00:48:31,325 INFO L280 TraceCheckUtils]: 10: Hoare triple {1191#true} havoc #t~nondet0; {1191#true} is VALID [2020-07-18 00:48:31,326 INFO L280 TraceCheckUtils]: 11: Hoare triple {1191#true} assume !(~bufsize~0 < 0); {1191#true} is VALID [2020-07-18 00:48:31,326 INFO L280 TraceCheckUtils]: 12: Hoare triple {1191#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1191#true} is VALID [2020-07-18 00:48:31,326 INFO L280 TraceCheckUtils]: 13: Hoare triple {1191#true} ~len~0 := #t~nondet1; {1191#true} is VALID [2020-07-18 00:48:31,326 INFO L280 TraceCheckUtils]: 14: Hoare triple {1191#true} havoc #t~nondet1; {1191#true} is VALID [2020-07-18 00:48:31,327 INFO L280 TraceCheckUtils]: 15: Hoare triple {1191#true} ~limit~0 := ~bufsize~0 - 4; {1191#true} is VALID [2020-07-18 00:48:31,327 INFO L280 TraceCheckUtils]: 16: Hoare triple {1191#true} ~i~0 := 0; {1195#(<= 0 main_~i~0)} is VALID [2020-07-18 00:48:31,328 INFO L280 TraceCheckUtils]: 17: Hoare triple {1195#(<= 0 main_~i~0)} assume !!(~i~0 < ~len~0); {1195#(<= 0 main_~i~0)} is VALID [2020-07-18 00:48:31,329 INFO L280 TraceCheckUtils]: 18: Hoare triple {1195#(<= 0 main_~i~0)} ~j~0 := 0; {1195#(<= 0 main_~i~0)} is VALID [2020-07-18 00:48:31,329 INFO L280 TraceCheckUtils]: 19: Hoare triple {1195#(<= 0 main_~i~0)} assume !!(~i~0 < ~len~0 && ~j~0 < ~limit~0); {1195#(<= 0 main_~i~0)} is VALID [2020-07-18 00:48:31,330 INFO L280 TraceCheckUtils]: 20: Hoare triple {1195#(<= 0 main_~i~0)} assume 1 + ~i~0 < ~len~0; {1195#(<= 0 main_~i~0)} is VALID [2020-07-18 00:48:31,330 INFO L263 TraceCheckUtils]: 21: Hoare triple {1195#(<= 0 main_~i~0)} call __VERIFIER_assert((if 1 + ~i~0 < ~len~0 then 1 else 0)); {1191#true} is VALID [2020-07-18 00:48:31,330 INFO L280 TraceCheckUtils]: 22: Hoare triple {1191#true} ~cond := #in~cond; {1191#true} is VALID [2020-07-18 00:48:31,330 INFO L280 TraceCheckUtils]: 23: Hoare triple {1191#true} assume !(0 == ~cond); {1191#true} is VALID [2020-07-18 00:48:31,331 INFO L280 TraceCheckUtils]: 24: Hoare triple {1191#true} assume true; {1191#true} is VALID [2020-07-18 00:48:31,332 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1191#true} {1195#(<= 0 main_~i~0)} #123#return; {1195#(<= 0 main_~i~0)} is VALID [2020-07-18 00:48:31,334 INFO L263 TraceCheckUtils]: 26: Hoare triple {1195#(<= 0 main_~i~0)} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {1200#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:48:31,334 INFO L280 TraceCheckUtils]: 27: Hoare triple {1200#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1201#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:48:31,337 INFO L280 TraceCheckUtils]: 28: Hoare triple {1201#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1192#false} is VALID [2020-07-18 00:48:31,338 INFO L280 TraceCheckUtils]: 29: Hoare triple {1192#false} assume !false; {1192#false} is VALID [2020-07-18 00:48:31,340 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-18 00:48:31,340 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:31,340 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [214508708] [2020-07-18 00:48:31,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:31,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 00:48:31,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622019665] [2020-07-18 00:48:31,341 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-18 00:48:31,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:31,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 00:48:31,370 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-18 00:48:31,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 00:48:31,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:31,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 00:48:31,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:48:31,372 INFO L87 Difference]: Start difference. First operand 81 states and 97 transitions. Second operand 5 states. [2020-07-18 00:48:31,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:31,921 INFO L93 Difference]: Finished difference Result 116 states and 145 transitions. [2020-07-18 00:48:31,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 00:48:31,922 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-18 00:48:31,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:31,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:48:31,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions. [2020-07-18 00:48:31,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:48:31,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions. [2020-07-18 00:48:31,928 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 132 transitions. [2020-07-18 00:48:32,060 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:32,065 INFO L225 Difference]: With dead ends: 116 [2020-07-18 00:48:32,066 INFO L226 Difference]: Without dead ends: 114 [2020-07-18 00:48:32,066 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 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-18 00:48:32,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-07-18 00:48:32,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 100. [2020-07-18 00:48:32,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:32,167 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 100 states. [2020-07-18 00:48:32,167 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 100 states. [2020-07-18 00:48:32,167 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 100 states. [2020-07-18 00:48:32,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:32,175 INFO L93 Difference]: Finished difference Result 114 states and 143 transitions. [2020-07-18 00:48:32,175 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 143 transitions. [2020-07-18 00:48:32,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:32,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:32,176 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 114 states. [2020-07-18 00:48:32,177 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 114 states. [2020-07-18 00:48:32,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:32,183 INFO L93 Difference]: Finished difference Result 114 states and 143 transitions. [2020-07-18 00:48:32,183 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 143 transitions. [2020-07-18 00:48:32,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:32,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:32,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:32,185 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:32,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-07-18 00:48:32,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 125 transitions. [2020-07-18 00:48:32,190 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 125 transitions. Word has length 30 [2020-07-18 00:48:32,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:32,190 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 125 transitions. [2020-07-18 00:48:32,191 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 00:48:32,191 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 100 states and 125 transitions. [2020-07-18 00:48:32,347 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:32,347 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 125 transitions. [2020-07-18 00:48:32,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-18 00:48:32,349 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:32,349 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:48:32,349 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:48:32,350 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:32,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:32,350 INFO L82 PathProgramCache]: Analyzing trace with hash 456630219, now seen corresponding path program 1 times [2020-07-18 00:48:32,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:32,353 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1101886492] [2020-07-18 00:48:32,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:32,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:32,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:32,479 INFO L280 TraceCheckUtils]: 0: Hoare triple {1866#true} assume true; {1866#true} is VALID [2020-07-18 00:48:32,479 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1866#true} {1866#true} #119#return; {1866#true} is VALID [2020-07-18 00:48:32,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:32,486 INFO L280 TraceCheckUtils]: 0: Hoare triple {1866#true} ~cond := #in~cond; {1866#true} is VALID [2020-07-18 00:48:32,486 INFO L280 TraceCheckUtils]: 1: Hoare triple {1866#true} assume !(0 == ~cond); {1866#true} is VALID [2020-07-18 00:48:32,486 INFO L280 TraceCheckUtils]: 2: Hoare triple {1866#true} assume true; {1866#true} is VALID [2020-07-18 00:48:32,487 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1866#true} {1871#(<= (+ main_~j~0 5) main_~bufsize~0)} #147#return; {1871#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-18 00:48:32,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:32,494 INFO L280 TraceCheckUtils]: 0: Hoare triple {1866#true} ~cond := #in~cond; {1866#true} is VALID [2020-07-18 00:48:32,494 INFO L280 TraceCheckUtils]: 1: Hoare triple {1866#true} assume !(0 == ~cond); {1866#true} is VALID [2020-07-18 00:48:32,494 INFO L280 TraceCheckUtils]: 2: Hoare triple {1866#true} assume true; {1866#true} is VALID [2020-07-18 00:48:32,495 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1866#true} {1871#(<= (+ main_~j~0 5) main_~bufsize~0)} #149#return; {1871#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-18 00:48:32,496 INFO L263 TraceCheckUtils]: 0: Hoare triple {1866#true} call ULTIMATE.init(); {1866#true} is VALID [2020-07-18 00:48:32,496 INFO L280 TraceCheckUtils]: 1: Hoare triple {1866#true} assume true; {1866#true} is VALID [2020-07-18 00:48:32,496 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1866#true} {1866#true} #119#return; {1866#true} is VALID [2020-07-18 00:48:32,496 INFO L263 TraceCheckUtils]: 3: Hoare triple {1866#true} call #t~ret10 := main(); {1866#true} is VALID [2020-07-18 00:48:32,497 INFO L280 TraceCheckUtils]: 4: Hoare triple {1866#true} havoc ~len~0; {1866#true} is VALID [2020-07-18 00:48:32,497 INFO L280 TraceCheckUtils]: 5: Hoare triple {1866#true} havoc ~i~0; {1866#true} is VALID [2020-07-18 00:48:32,497 INFO L280 TraceCheckUtils]: 6: Hoare triple {1866#true} havoc ~j~0; {1866#true} is VALID [2020-07-18 00:48:32,497 INFO L280 TraceCheckUtils]: 7: Hoare triple {1866#true} havoc ~bufsize~0; {1866#true} is VALID [2020-07-18 00:48:32,498 INFO L280 TraceCheckUtils]: 8: Hoare triple {1866#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1866#true} is VALID [2020-07-18 00:48:32,498 INFO L280 TraceCheckUtils]: 9: Hoare triple {1866#true} ~bufsize~0 := #t~nondet0; {1866#true} is VALID [2020-07-18 00:48:32,498 INFO L280 TraceCheckUtils]: 10: Hoare triple {1866#true} havoc #t~nondet0; {1866#true} is VALID [2020-07-18 00:48:32,499 INFO L280 TraceCheckUtils]: 11: Hoare triple {1866#true} assume !(~bufsize~0 < 0); {1866#true} is VALID [2020-07-18 00:48:32,499 INFO L280 TraceCheckUtils]: 12: Hoare triple {1866#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1866#true} is VALID [2020-07-18 00:48:32,499 INFO L280 TraceCheckUtils]: 13: Hoare triple {1866#true} ~len~0 := #t~nondet1; {1866#true} is VALID [2020-07-18 00:48:32,499 INFO L280 TraceCheckUtils]: 14: Hoare triple {1866#true} havoc #t~nondet1; {1866#true} is VALID [2020-07-18 00:48:32,500 INFO L280 TraceCheckUtils]: 15: Hoare triple {1866#true} ~limit~0 := ~bufsize~0 - 4; {1870#(<= (+ main_~limit~0 4) main_~bufsize~0)} is VALID [2020-07-18 00:48:32,501 INFO L280 TraceCheckUtils]: 16: Hoare triple {1870#(<= (+ main_~limit~0 4) main_~bufsize~0)} ~i~0 := 0; {1870#(<= (+ main_~limit~0 4) main_~bufsize~0)} is VALID [2020-07-18 00:48:32,502 INFO L280 TraceCheckUtils]: 17: Hoare triple {1870#(<= (+ main_~limit~0 4) main_~bufsize~0)} assume !!(~i~0 < ~len~0); {1870#(<= (+ main_~limit~0 4) main_~bufsize~0)} is VALID [2020-07-18 00:48:32,502 INFO L280 TraceCheckUtils]: 18: Hoare triple {1870#(<= (+ main_~limit~0 4) main_~bufsize~0)} ~j~0 := 0; {1870#(<= (+ main_~limit~0 4) main_~bufsize~0)} is VALID [2020-07-18 00:48:32,503 INFO L280 TraceCheckUtils]: 19: Hoare triple {1870#(<= (+ main_~limit~0 4) main_~bufsize~0)} assume !!(~i~0 < ~len~0 && ~j~0 < ~limit~0); {1871#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-18 00:48:32,504 INFO L280 TraceCheckUtils]: 20: Hoare triple {1871#(<= (+ main_~j~0 5) main_~bufsize~0)} assume !(1 + ~i~0 < ~len~0); {1871#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-18 00:48:32,504 INFO L263 TraceCheckUtils]: 21: Hoare triple {1871#(<= (+ main_~j~0 5) main_~bufsize~0)} call __VERIFIER_assert((if ~i~0 < ~len~0 then 1 else 0)); {1866#true} is VALID [2020-07-18 00:48:32,504 INFO L280 TraceCheckUtils]: 22: Hoare triple {1866#true} ~cond := #in~cond; {1866#true} is VALID [2020-07-18 00:48:32,505 INFO L280 TraceCheckUtils]: 23: Hoare triple {1866#true} assume !(0 == ~cond); {1866#true} is VALID [2020-07-18 00:48:32,505 INFO L280 TraceCheckUtils]: 24: Hoare triple {1866#true} assume true; {1866#true} is VALID [2020-07-18 00:48:32,506 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1866#true} {1871#(<= (+ main_~j~0 5) main_~bufsize~0)} #147#return; {1871#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-18 00:48:32,506 INFO L263 TraceCheckUtils]: 26: Hoare triple {1871#(<= (+ main_~j~0 5) main_~bufsize~0)} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {1866#true} is VALID [2020-07-18 00:48:32,507 INFO L280 TraceCheckUtils]: 27: Hoare triple {1866#true} ~cond := #in~cond; {1866#true} is VALID [2020-07-18 00:48:32,507 INFO L280 TraceCheckUtils]: 28: Hoare triple {1866#true} assume !(0 == ~cond); {1866#true} is VALID [2020-07-18 00:48:32,507 INFO L280 TraceCheckUtils]: 29: Hoare triple {1866#true} assume true; {1866#true} is VALID [2020-07-18 00:48:32,508 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1866#true} {1871#(<= (+ main_~j~0 5) main_~bufsize~0)} #149#return; {1871#(<= (+ main_~j~0 5) main_~bufsize~0)} is VALID [2020-07-18 00:48:32,509 INFO L263 TraceCheckUtils]: 31: Hoare triple {1871#(<= (+ main_~j~0 5) main_~bufsize~0)} call __VERIFIER_assert((if ~j~0 < ~bufsize~0 then 1 else 0)); {1880#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:48:32,510 INFO L280 TraceCheckUtils]: 32: Hoare triple {1880#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1881#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:48:32,511 INFO L280 TraceCheckUtils]: 33: Hoare triple {1881#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1867#false} is VALID [2020-07-18 00:48:32,511 INFO L280 TraceCheckUtils]: 34: Hoare triple {1867#false} assume !false; {1867#false} is VALID [2020-07-18 00:48:32,513 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-18 00:48:32,513 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:32,514 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1101886492] [2020-07-18 00:48:32,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:32,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-18 00:48:32,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609791368] [2020-07-18 00:48:32,515 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2020-07-18 00:48:32,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:32,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 00:48:32,547 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-18 00:48:32,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-18 00:48:32,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:32,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-18 00:48:32,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:48:32,549 INFO L87 Difference]: Start difference. First operand 100 states and 125 transitions. Second operand 6 states. [2020-07-18 00:48:33,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:33,185 INFO L93 Difference]: Finished difference Result 106 states and 130 transitions. [2020-07-18 00:48:33,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-18 00:48:33,186 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2020-07-18 00:48:33,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:33,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:48:33,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2020-07-18 00:48:33,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:48:33,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2020-07-18 00:48:33,192 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 91 transitions. [2020-07-18 00:48:33,297 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:33,299 INFO L225 Difference]: With dead ends: 106 [2020-07-18 00:48:33,300 INFO L226 Difference]: Without dead ends: 104 [2020-07-18 00:48:33,300 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-18 00:48:33,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-07-18 00:48:33,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2020-07-18 00:48:33,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:33,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand 104 states. [2020-07-18 00:48:33,464 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 104 states. [2020-07-18 00:48:33,465 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 104 states. [2020-07-18 00:48:33,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:33,471 INFO L93 Difference]: Finished difference Result 104 states and 128 transitions. [2020-07-18 00:48:33,471 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 128 transitions. [2020-07-18 00:48:33,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:33,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:33,472 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 104 states. [2020-07-18 00:48:33,472 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 104 states. [2020-07-18 00:48:33,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:33,477 INFO L93 Difference]: Finished difference Result 104 states and 128 transitions. [2020-07-18 00:48:33,478 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 128 transitions. [2020-07-18 00:48:33,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:33,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:33,479 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:33,479 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:33,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-07-18 00:48:33,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 128 transitions. [2020-07-18 00:48:33,483 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 128 transitions. Word has length 35 [2020-07-18 00:48:33,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:33,484 INFO L479 AbstractCegarLoop]: Abstraction has 104 states and 128 transitions. [2020-07-18 00:48:33,484 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-18 00:48:33,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 104 states and 128 transitions. [2020-07-18 00:48:33,656 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:33,656 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 128 transitions. [2020-07-18 00:48:33,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-18 00:48:33,658 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:33,658 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:48:33,658 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 00:48:33,659 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:33,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:33,659 INFO L82 PathProgramCache]: Analyzing trace with hash 364478305, now seen corresponding path program 1 times [2020-07-18 00:48:33,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:33,660 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1900078037] [2020-07-18 00:48:33,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:33,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:33,724 INFO L280 TraceCheckUtils]: 0: Hoare triple {2516#true} assume true; {2516#true} is VALID [2020-07-18 00:48:33,725 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2516#true} {2516#true} #119#return; {2516#true} is VALID [2020-07-18 00:48:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:33,736 INFO L280 TraceCheckUtils]: 0: Hoare triple {2516#true} ~cond := #in~cond; {2516#true} is VALID [2020-07-18 00:48:33,736 INFO L280 TraceCheckUtils]: 1: Hoare triple {2516#true} assume !(0 == ~cond); {2516#true} is VALID [2020-07-18 00:48:33,736 INFO L280 TraceCheckUtils]: 2: Hoare triple {2516#true} assume true; {2516#true} is VALID [2020-07-18 00:48:33,737 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2516#true} {2520#(<= 0 main_~j~0)} #147#return; {2520#(<= 0 main_~j~0)} is VALID [2020-07-18 00:48:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:33,744 INFO L280 TraceCheckUtils]: 0: Hoare triple {2516#true} ~cond := #in~cond; {2516#true} is VALID [2020-07-18 00:48:33,744 INFO L280 TraceCheckUtils]: 1: Hoare triple {2516#true} assume !(0 == ~cond); {2516#true} is VALID [2020-07-18 00:48:33,744 INFO L280 TraceCheckUtils]: 2: Hoare triple {2516#true} assume true; {2516#true} is VALID [2020-07-18 00:48:33,745 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2516#true} {2520#(<= 0 main_~j~0)} #149#return; {2520#(<= 0 main_~j~0)} is VALID [2020-07-18 00:48:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:33,754 INFO L280 TraceCheckUtils]: 0: Hoare triple {2516#true} ~cond := #in~cond; {2516#true} is VALID [2020-07-18 00:48:33,754 INFO L280 TraceCheckUtils]: 1: Hoare triple {2516#true} assume !(0 == ~cond); {2516#true} is VALID [2020-07-18 00:48:33,755 INFO L280 TraceCheckUtils]: 2: Hoare triple {2516#true} assume true; {2516#true} is VALID [2020-07-18 00:48:33,755 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2516#true} {2520#(<= 0 main_~j~0)} #151#return; {2520#(<= 0 main_~j~0)} is VALID [2020-07-18 00:48:33,755 INFO L263 TraceCheckUtils]: 0: Hoare triple {2516#true} call ULTIMATE.init(); {2516#true} is VALID [2020-07-18 00:48:33,756 INFO L280 TraceCheckUtils]: 1: Hoare triple {2516#true} assume true; {2516#true} is VALID [2020-07-18 00:48:33,756 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2516#true} {2516#true} #119#return; {2516#true} is VALID [2020-07-18 00:48:33,756 INFO L263 TraceCheckUtils]: 3: Hoare triple {2516#true} call #t~ret10 := main(); {2516#true} is VALID [2020-07-18 00:48:33,756 INFO L280 TraceCheckUtils]: 4: Hoare triple {2516#true} havoc ~len~0; {2516#true} is VALID [2020-07-18 00:48:33,756 INFO L280 TraceCheckUtils]: 5: Hoare triple {2516#true} havoc ~i~0; {2516#true} is VALID [2020-07-18 00:48:33,757 INFO L280 TraceCheckUtils]: 6: Hoare triple {2516#true} havoc ~j~0; {2516#true} is VALID [2020-07-18 00:48:33,757 INFO L280 TraceCheckUtils]: 7: Hoare triple {2516#true} havoc ~bufsize~0; {2516#true} is VALID [2020-07-18 00:48:33,757 INFO L280 TraceCheckUtils]: 8: Hoare triple {2516#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2516#true} is VALID [2020-07-18 00:48:33,757 INFO L280 TraceCheckUtils]: 9: Hoare triple {2516#true} ~bufsize~0 := #t~nondet0; {2516#true} is VALID [2020-07-18 00:48:33,758 INFO L280 TraceCheckUtils]: 10: Hoare triple {2516#true} havoc #t~nondet0; {2516#true} is VALID [2020-07-18 00:48:33,758 INFO L280 TraceCheckUtils]: 11: Hoare triple {2516#true} assume !(~bufsize~0 < 0); {2516#true} is VALID [2020-07-18 00:48:33,759 INFO L280 TraceCheckUtils]: 12: Hoare triple {2516#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2516#true} is VALID [2020-07-18 00:48:33,759 INFO L280 TraceCheckUtils]: 13: Hoare triple {2516#true} ~len~0 := #t~nondet1; {2516#true} is VALID [2020-07-18 00:48:33,759 INFO L280 TraceCheckUtils]: 14: Hoare triple {2516#true} havoc #t~nondet1; {2516#true} is VALID [2020-07-18 00:48:33,760 INFO L280 TraceCheckUtils]: 15: Hoare triple {2516#true} ~limit~0 := ~bufsize~0 - 4; {2516#true} is VALID [2020-07-18 00:48:33,760 INFO L280 TraceCheckUtils]: 16: Hoare triple {2516#true} ~i~0 := 0; {2516#true} is VALID [2020-07-18 00:48:33,760 INFO L280 TraceCheckUtils]: 17: Hoare triple {2516#true} assume !!(~i~0 < ~len~0); {2516#true} is VALID [2020-07-18 00:48:33,761 INFO L280 TraceCheckUtils]: 18: Hoare triple {2516#true} ~j~0 := 0; {2520#(<= 0 main_~j~0)} is VALID [2020-07-18 00:48:33,761 INFO L280 TraceCheckUtils]: 19: Hoare triple {2520#(<= 0 main_~j~0)} assume !!(~i~0 < ~len~0 && ~j~0 < ~limit~0); {2520#(<= 0 main_~j~0)} is VALID [2020-07-18 00:48:33,762 INFO L280 TraceCheckUtils]: 20: Hoare triple {2520#(<= 0 main_~j~0)} assume !(1 + ~i~0 < ~len~0); {2520#(<= 0 main_~j~0)} is VALID [2020-07-18 00:48:33,762 INFO L263 TraceCheckUtils]: 21: Hoare triple {2520#(<= 0 main_~j~0)} call __VERIFIER_assert((if ~i~0 < ~len~0 then 1 else 0)); {2516#true} is VALID [2020-07-18 00:48:33,762 INFO L280 TraceCheckUtils]: 22: Hoare triple {2516#true} ~cond := #in~cond; {2516#true} is VALID [2020-07-18 00:48:33,762 INFO L280 TraceCheckUtils]: 23: Hoare triple {2516#true} assume !(0 == ~cond); {2516#true} is VALID [2020-07-18 00:48:33,762 INFO L280 TraceCheckUtils]: 24: Hoare triple {2516#true} assume true; {2516#true} is VALID [2020-07-18 00:48:33,763 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {2516#true} {2520#(<= 0 main_~j~0)} #147#return; {2520#(<= 0 main_~j~0)} is VALID [2020-07-18 00:48:33,763 INFO L263 TraceCheckUtils]: 26: Hoare triple {2520#(<= 0 main_~j~0)} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {2516#true} is VALID [2020-07-18 00:48:33,763 INFO L280 TraceCheckUtils]: 27: Hoare triple {2516#true} ~cond := #in~cond; {2516#true} is VALID [2020-07-18 00:48:33,764 INFO L280 TraceCheckUtils]: 28: Hoare triple {2516#true} assume !(0 == ~cond); {2516#true} is VALID [2020-07-18 00:48:33,764 INFO L280 TraceCheckUtils]: 29: Hoare triple {2516#true} assume true; {2516#true} is VALID [2020-07-18 00:48:33,764 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2516#true} {2520#(<= 0 main_~j~0)} #149#return; {2520#(<= 0 main_~j~0)} is VALID [2020-07-18 00:48:33,765 INFO L263 TraceCheckUtils]: 31: Hoare triple {2520#(<= 0 main_~j~0)} call __VERIFIER_assert((if ~j~0 < ~bufsize~0 then 1 else 0)); {2516#true} is VALID [2020-07-18 00:48:33,765 INFO L280 TraceCheckUtils]: 32: Hoare triple {2516#true} ~cond := #in~cond; {2516#true} is VALID [2020-07-18 00:48:33,765 INFO L280 TraceCheckUtils]: 33: Hoare triple {2516#true} assume !(0 == ~cond); {2516#true} is VALID [2020-07-18 00:48:33,765 INFO L280 TraceCheckUtils]: 34: Hoare triple {2516#true} assume true; {2516#true} is VALID [2020-07-18 00:48:33,766 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {2516#true} {2520#(<= 0 main_~j~0)} #151#return; {2520#(<= 0 main_~j~0)} is VALID [2020-07-18 00:48:33,767 INFO L263 TraceCheckUtils]: 36: Hoare triple {2520#(<= 0 main_~j~0)} call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); {2533#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:48:33,767 INFO L280 TraceCheckUtils]: 37: Hoare triple {2533#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2534#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:48:33,768 INFO L280 TraceCheckUtils]: 38: Hoare triple {2534#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2517#false} is VALID [2020-07-18 00:48:33,769 INFO L280 TraceCheckUtils]: 39: Hoare triple {2517#false} assume !false; {2517#false} is VALID [2020-07-18 00:48:33,770 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-18 00:48:33,771 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:33,771 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1900078037] [2020-07-18 00:48:33,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:33,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 00:48:33,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008521769] [2020-07-18 00:48:33,772 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2020-07-18 00:48:33,772 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:33,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 00:48:33,812 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:33,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 00:48:33,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:33,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 00:48:33,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:48:33,814 INFO L87 Difference]: Start difference. First operand 104 states and 128 transitions. Second operand 5 states. [2020-07-18 00:48:34,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:34,395 INFO L93 Difference]: Finished difference Result 135 states and 172 transitions. [2020-07-18 00:48:34,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 00:48:34,395 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2020-07-18 00:48:34,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:34,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:48:34,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2020-07-18 00:48:34,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:48:34,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2020-07-18 00:48:34,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 126 transitions. [2020-07-18 00:48:34,536 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:34,542 INFO L225 Difference]: With dead ends: 135 [2020-07-18 00:48:34,542 INFO L226 Difference]: Without dead ends: 133 [2020-07-18 00:48:34,543 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 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-18 00:48:34,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-07-18 00:48:34,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 125. [2020-07-18 00:48:34,760 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:34,760 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 125 states. [2020-07-18 00:48:34,760 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 125 states. [2020-07-18 00:48:34,761 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 125 states. [2020-07-18 00:48:34,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:34,767 INFO L93 Difference]: Finished difference Result 133 states and 170 transitions. [2020-07-18 00:48:34,767 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 170 transitions. [2020-07-18 00:48:34,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:34,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:34,769 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 133 states. [2020-07-18 00:48:34,769 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 133 states. [2020-07-18 00:48:34,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:34,775 INFO L93 Difference]: Finished difference Result 133 states and 170 transitions. [2020-07-18 00:48:34,776 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 170 transitions. [2020-07-18 00:48:34,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:34,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:34,777 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:34,777 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:34,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-07-18 00:48:34,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 162 transitions. [2020-07-18 00:48:34,784 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 162 transitions. Word has length 40 [2020-07-18 00:48:34,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:34,784 INFO L479 AbstractCegarLoop]: Abstraction has 125 states and 162 transitions. [2020-07-18 00:48:34,784 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 00:48:34,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 125 states and 162 transitions. [2020-07-18 00:48:35,028 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:35,028 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 162 transitions. [2020-07-18 00:48:35,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-18 00:48:35,030 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:35,030 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:48:35,030 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 00:48:35,031 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:35,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:35,031 INFO L82 PathProgramCache]: Analyzing trace with hash 914533499, now seen corresponding path program 1 times [2020-07-18 00:48:35,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:35,031 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1886775634] [2020-07-18 00:48:35,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:35,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:35,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:35,147 INFO L280 TraceCheckUtils]: 0: Hoare triple {3325#true} assume true; {3325#true} is VALID [2020-07-18 00:48:35,148 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3325#true} {3325#true} #119#return; {3325#true} is VALID [2020-07-18 00:48:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:35,155 INFO L280 TraceCheckUtils]: 0: Hoare triple {3325#true} ~cond := #in~cond; {3325#true} is VALID [2020-07-18 00:48:35,155 INFO L280 TraceCheckUtils]: 1: Hoare triple {3325#true} assume !(0 == ~cond); {3325#true} is VALID [2020-07-18 00:48:35,155 INFO L280 TraceCheckUtils]: 2: Hoare triple {3325#true} assume true; {3325#true} is VALID [2020-07-18 00:48:35,156 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3325#true} {3329#(<= main_~len~0 (+ main_~i~0 1))} #147#return; {3329#(<= main_~len~0 (+ main_~i~0 1))} is VALID [2020-07-18 00:48:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:35,161 INFO L280 TraceCheckUtils]: 0: Hoare triple {3325#true} ~cond := #in~cond; {3325#true} is VALID [2020-07-18 00:48:35,161 INFO L280 TraceCheckUtils]: 1: Hoare triple {3325#true} assume !(0 == ~cond); {3325#true} is VALID [2020-07-18 00:48:35,162 INFO L280 TraceCheckUtils]: 2: Hoare triple {3325#true} assume true; {3325#true} is VALID [2020-07-18 00:48:35,162 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3325#true} {3329#(<= main_~len~0 (+ main_~i~0 1))} #149#return; {3329#(<= main_~len~0 (+ main_~i~0 1))} is VALID [2020-07-18 00:48:35,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:35,167 INFO L280 TraceCheckUtils]: 0: Hoare triple {3325#true} ~cond := #in~cond; {3325#true} is VALID [2020-07-18 00:48:35,168 INFO L280 TraceCheckUtils]: 1: Hoare triple {3325#true} assume !(0 == ~cond); {3325#true} is VALID [2020-07-18 00:48:35,168 INFO L280 TraceCheckUtils]: 2: Hoare triple {3325#true} assume true; {3325#true} is VALID [2020-07-18 00:48:35,169 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3325#true} {3329#(<= main_~len~0 (+ main_~i~0 1))} #151#return; {3329#(<= main_~len~0 (+ main_~i~0 1))} is VALID [2020-07-18 00:48:35,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:35,185 INFO L280 TraceCheckUtils]: 0: Hoare triple {3325#true} ~cond := #in~cond; {3325#true} is VALID [2020-07-18 00:48:35,185 INFO L280 TraceCheckUtils]: 1: Hoare triple {3325#true} assume !(0 == ~cond); {3325#true} is VALID [2020-07-18 00:48:35,185 INFO L280 TraceCheckUtils]: 2: Hoare triple {3325#true} assume true; {3325#true} is VALID [2020-07-18 00:48:35,192 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3325#true} {3329#(<= main_~len~0 (+ main_~i~0 1))} #153#return; {3329#(<= main_~len~0 (+ main_~i~0 1))} is VALID [2020-07-18 00:48:35,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:35,202 INFO L280 TraceCheckUtils]: 0: Hoare triple {3325#true} ~cond := #in~cond; {3325#true} is VALID [2020-07-18 00:48:35,203 INFO L280 TraceCheckUtils]: 1: Hoare triple {3325#true} assume !(0 == ~cond); {3325#true} is VALID [2020-07-18 00:48:35,203 INFO L280 TraceCheckUtils]: 2: Hoare triple {3325#true} assume true; {3325#true} is VALID [2020-07-18 00:48:35,203 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3325#true} {3326#false} #123#return; {3326#false} is VALID [2020-07-18 00:48:35,204 INFO L263 TraceCheckUtils]: 0: Hoare triple {3325#true} call ULTIMATE.init(); {3325#true} is VALID [2020-07-18 00:48:35,204 INFO L280 TraceCheckUtils]: 1: Hoare triple {3325#true} assume true; {3325#true} is VALID [2020-07-18 00:48:35,204 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3325#true} {3325#true} #119#return; {3325#true} is VALID [2020-07-18 00:48:35,204 INFO L263 TraceCheckUtils]: 3: Hoare triple {3325#true} call #t~ret10 := main(); {3325#true} is VALID [2020-07-18 00:48:35,205 INFO L280 TraceCheckUtils]: 4: Hoare triple {3325#true} havoc ~len~0; {3325#true} is VALID [2020-07-18 00:48:35,205 INFO L280 TraceCheckUtils]: 5: Hoare triple {3325#true} havoc ~i~0; {3325#true} is VALID [2020-07-18 00:48:35,205 INFO L280 TraceCheckUtils]: 6: Hoare triple {3325#true} havoc ~j~0; {3325#true} is VALID [2020-07-18 00:48:35,205 INFO L280 TraceCheckUtils]: 7: Hoare triple {3325#true} havoc ~bufsize~0; {3325#true} is VALID [2020-07-18 00:48:35,205 INFO L280 TraceCheckUtils]: 8: Hoare triple {3325#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {3325#true} is VALID [2020-07-18 00:48:35,206 INFO L280 TraceCheckUtils]: 9: Hoare triple {3325#true} ~bufsize~0 := #t~nondet0; {3325#true} is VALID [2020-07-18 00:48:35,206 INFO L280 TraceCheckUtils]: 10: Hoare triple {3325#true} havoc #t~nondet0; {3325#true} is VALID [2020-07-18 00:48:35,206 INFO L280 TraceCheckUtils]: 11: Hoare triple {3325#true} assume !(~bufsize~0 < 0); {3325#true} is VALID [2020-07-18 00:48:35,206 INFO L280 TraceCheckUtils]: 12: Hoare triple {3325#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3325#true} is VALID [2020-07-18 00:48:35,207 INFO L280 TraceCheckUtils]: 13: Hoare triple {3325#true} ~len~0 := #t~nondet1; {3325#true} is VALID [2020-07-18 00:48:35,207 INFO L280 TraceCheckUtils]: 14: Hoare triple {3325#true} havoc #t~nondet1; {3325#true} is VALID [2020-07-18 00:48:35,207 INFO L280 TraceCheckUtils]: 15: Hoare triple {3325#true} ~limit~0 := ~bufsize~0 - 4; {3325#true} is VALID [2020-07-18 00:48:35,208 INFO L280 TraceCheckUtils]: 16: Hoare triple {3325#true} ~i~0 := 0; {3325#true} is VALID [2020-07-18 00:48:35,208 INFO L280 TraceCheckUtils]: 17: Hoare triple {3325#true} assume !!(~i~0 < ~len~0); {3325#true} is VALID [2020-07-18 00:48:35,208 INFO L280 TraceCheckUtils]: 18: Hoare triple {3325#true} ~j~0 := 0; {3325#true} is VALID [2020-07-18 00:48:35,209 INFO L280 TraceCheckUtils]: 19: Hoare triple {3325#true} assume !!(~i~0 < ~len~0 && ~j~0 < ~limit~0); {3325#true} is VALID [2020-07-18 00:48:35,214 INFO L280 TraceCheckUtils]: 20: Hoare triple {3325#true} assume !(1 + ~i~0 < ~len~0); {3329#(<= main_~len~0 (+ main_~i~0 1))} is VALID [2020-07-18 00:48:35,214 INFO L263 TraceCheckUtils]: 21: Hoare triple {3329#(<= main_~len~0 (+ main_~i~0 1))} call __VERIFIER_assert((if ~i~0 < ~len~0 then 1 else 0)); {3325#true} is VALID [2020-07-18 00:48:35,214 INFO L280 TraceCheckUtils]: 22: Hoare triple {3325#true} ~cond := #in~cond; {3325#true} is VALID [2020-07-18 00:48:35,214 INFO L280 TraceCheckUtils]: 23: Hoare triple {3325#true} assume !(0 == ~cond); {3325#true} is VALID [2020-07-18 00:48:35,215 INFO L280 TraceCheckUtils]: 24: Hoare triple {3325#true} assume true; {3325#true} is VALID [2020-07-18 00:48:35,216 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {3325#true} {3329#(<= main_~len~0 (+ main_~i~0 1))} #147#return; {3329#(<= main_~len~0 (+ main_~i~0 1))} is VALID [2020-07-18 00:48:35,216 INFO L263 TraceCheckUtils]: 26: Hoare triple {3329#(<= main_~len~0 (+ main_~i~0 1))} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {3325#true} is VALID [2020-07-18 00:48:35,216 INFO L280 TraceCheckUtils]: 27: Hoare triple {3325#true} ~cond := #in~cond; {3325#true} is VALID [2020-07-18 00:48:35,216 INFO L280 TraceCheckUtils]: 28: Hoare triple {3325#true} assume !(0 == ~cond); {3325#true} is VALID [2020-07-18 00:48:35,217 INFO L280 TraceCheckUtils]: 29: Hoare triple {3325#true} assume true; {3325#true} is VALID [2020-07-18 00:48:35,217 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {3325#true} {3329#(<= main_~len~0 (+ main_~i~0 1))} #149#return; {3329#(<= main_~len~0 (+ main_~i~0 1))} is VALID [2020-07-18 00:48:35,218 INFO L263 TraceCheckUtils]: 31: Hoare triple {3329#(<= main_~len~0 (+ main_~i~0 1))} call __VERIFIER_assert((if ~j~0 < ~bufsize~0 then 1 else 0)); {3325#true} is VALID [2020-07-18 00:48:35,218 INFO L280 TraceCheckUtils]: 32: Hoare triple {3325#true} ~cond := #in~cond; {3325#true} is VALID [2020-07-18 00:48:35,218 INFO L280 TraceCheckUtils]: 33: Hoare triple {3325#true} assume !(0 == ~cond); {3325#true} is VALID [2020-07-18 00:48:35,218 INFO L280 TraceCheckUtils]: 34: Hoare triple {3325#true} assume true; {3325#true} is VALID [2020-07-18 00:48:35,219 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {3325#true} {3329#(<= main_~len~0 (+ main_~i~0 1))} #151#return; {3329#(<= main_~len~0 (+ main_~i~0 1))} is VALID [2020-07-18 00:48:35,219 INFO L263 TraceCheckUtils]: 36: Hoare triple {3329#(<= main_~len~0 (+ main_~i~0 1))} call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); {3325#true} is VALID [2020-07-18 00:48:35,220 INFO L280 TraceCheckUtils]: 37: Hoare triple {3325#true} ~cond := #in~cond; {3325#true} is VALID [2020-07-18 00:48:35,220 INFO L280 TraceCheckUtils]: 38: Hoare triple {3325#true} assume !(0 == ~cond); {3325#true} is VALID [2020-07-18 00:48:35,220 INFO L280 TraceCheckUtils]: 39: Hoare triple {3325#true} assume true; {3325#true} is VALID [2020-07-18 00:48:35,221 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {3325#true} {3329#(<= main_~len~0 (+ main_~i~0 1))} #153#return; {3329#(<= main_~len~0 (+ main_~i~0 1))} is VALID [2020-07-18 00:48:35,222 INFO L280 TraceCheckUtils]: 41: Hoare triple {3329#(<= main_~len~0 (+ main_~i~0 1))} #t~post8 := ~j~0; {3329#(<= main_~len~0 (+ main_~i~0 1))} is VALID [2020-07-18 00:48:35,223 INFO L280 TraceCheckUtils]: 42: Hoare triple {3329#(<= main_~len~0 (+ main_~i~0 1))} ~j~0 := 1 + #t~post8; {3329#(<= main_~len~0 (+ main_~i~0 1))} is VALID [2020-07-18 00:48:35,224 INFO L280 TraceCheckUtils]: 43: Hoare triple {3329#(<= main_~len~0 (+ main_~i~0 1))} havoc #t~post8; {3329#(<= main_~len~0 (+ main_~i~0 1))} is VALID [2020-07-18 00:48:35,225 INFO L280 TraceCheckUtils]: 44: Hoare triple {3329#(<= main_~len~0 (+ main_~i~0 1))} #t~post9 := ~i~0; {3346#(<= main_~len~0 (+ |main_#t~post9| 1))} is VALID [2020-07-18 00:48:35,227 INFO L280 TraceCheckUtils]: 45: Hoare triple {3346#(<= main_~len~0 (+ |main_#t~post9| 1))} ~i~0 := 1 + #t~post9; {3347#(<= main_~len~0 main_~i~0)} is VALID [2020-07-18 00:48:35,228 INFO L280 TraceCheckUtils]: 46: Hoare triple {3347#(<= main_~len~0 main_~i~0)} havoc #t~post9; {3347#(<= main_~len~0 main_~i~0)} is VALID [2020-07-18 00:48:35,229 INFO L280 TraceCheckUtils]: 47: Hoare triple {3347#(<= main_~len~0 main_~i~0)} assume !!(~i~0 < ~len~0 && ~j~0 < ~limit~0); {3347#(<= main_~len~0 main_~i~0)} is VALID [2020-07-18 00:48:35,230 INFO L280 TraceCheckUtils]: 48: Hoare triple {3347#(<= main_~len~0 main_~i~0)} assume 1 + ~i~0 < ~len~0; {3326#false} is VALID [2020-07-18 00:48:35,230 INFO L263 TraceCheckUtils]: 49: Hoare triple {3326#false} call __VERIFIER_assert((if 1 + ~i~0 < ~len~0 then 1 else 0)); {3325#true} is VALID [2020-07-18 00:48:35,230 INFO L280 TraceCheckUtils]: 50: Hoare triple {3325#true} ~cond := #in~cond; {3325#true} is VALID [2020-07-18 00:48:35,230 INFO L280 TraceCheckUtils]: 51: Hoare triple {3325#true} assume !(0 == ~cond); {3325#true} is VALID [2020-07-18 00:48:35,231 INFO L280 TraceCheckUtils]: 52: Hoare triple {3325#true} assume true; {3325#true} is VALID [2020-07-18 00:48:35,231 INFO L275 TraceCheckUtils]: 53: Hoare quadruple {3325#true} {3326#false} #123#return; {3326#false} is VALID [2020-07-18 00:48:35,231 INFO L263 TraceCheckUtils]: 54: Hoare triple {3326#false} call __VERIFIER_assert((if 0 <= ~i~0 then 1 else 0)); {3326#false} is VALID [2020-07-18 00:48:35,231 INFO L280 TraceCheckUtils]: 55: Hoare triple {3326#false} ~cond := #in~cond; {3326#false} is VALID [2020-07-18 00:48:35,232 INFO L280 TraceCheckUtils]: 56: Hoare triple {3326#false} assume 0 == ~cond; {3326#false} is VALID [2020-07-18 00:48:35,232 INFO L280 TraceCheckUtils]: 57: Hoare triple {3326#false} assume !false; {3326#false} is VALID [2020-07-18 00:48:35,235 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-18 00:48:35,299 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:35,299 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1886775634] [2020-07-18 00:48:35,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:35,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-18 00:48:35,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229181738] [2020-07-18 00:48:35,300 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2020-07-18 00:48:35,301 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:35,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-18 00:48:35,319 WARN L140 InductivityCheck]: Transition 3354#(and (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) ( _ , assume !false; , 3326#false ) not inductive [2020-07-18 00:48:35,320 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-18 00:48:35,320 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:583) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:455) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-18 00:48:35,326 INFO L168 Benchmark]: Toolchain (without parser) took 7657.64 ms. Allocated memory was 137.4 MB in the beginning and 314.0 MB in the end (delta: 176.7 MB). Free memory was 102.4 MB in the beginning and 221.8 MB in the end (delta: -119.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 7.1 GB. [2020-07-18 00:48:35,327 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.4 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-18 00:48:35,328 INFO L168 Benchmark]: CACSL2BoogieTranslator took 258.14 ms. Allocated memory is still 137.4 MB. Free memory was 102.0 MB in the beginning and 91.5 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2020-07-18 00:48:35,329 INFO L168 Benchmark]: Boogie Preprocessor took 120.29 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 91.5 MB in the beginning and 179.9 MB in the end (delta: -88.5 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2020-07-18 00:48:35,329 INFO L168 Benchmark]: RCFGBuilder took 543.03 ms. Allocated memory is still 201.9 MB. Free memory was 179.9 MB in the beginning and 146.7 MB in the end (delta: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 7.1 GB. [2020-07-18 00:48:35,330 INFO L168 Benchmark]: TraceAbstraction took 6729.70 ms. Allocated memory was 201.9 MB in the beginning and 314.0 MB in the end (delta: 112.2 MB). Free memory was 146.0 MB in the beginning and 221.8 MB in the end (delta: -75.8 MB). Peak memory consumption was 36.4 MB. Max. memory is 7.1 GB. [2020-07-18 00:48:35,333 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.23 ms. Allocated memory is still 137.4 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 258.14 ms. Allocated memory is still 137.4 MB. Free memory was 102.0 MB in the beginning and 91.5 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 120.29 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 91.5 MB in the beginning and 179.9 MB in the end (delta: -88.5 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 543.03 ms. Allocated memory is still 201.9 MB. Free memory was 179.9 MB in the beginning and 146.7 MB in the end (delta: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6729.70 ms. Allocated memory was 201.9 MB in the beginning and 314.0 MB in the end (delta: 112.2 MB). Free memory was 146.0 MB in the beginning and 221.8 MB in the end (delta: -75.8 MB). Peak memory consumption was 36.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:142) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...