/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/id_build.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 02:31:02,781 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 02:31:02,784 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 02:31:02,806 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 02:31:02,806 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 02:31:02,809 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 02:31:02,811 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 02:31:02,826 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 02:31:02,828 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 02:31:02,830 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 02:31:02,831 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 02:31:02,832 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 02:31:02,834 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 02:31:02,837 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 02:31:02,841 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 02:31:02,842 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 02:31:02,846 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 02:31:02,848 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 02:31:02,851 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 02:31:02,858 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 02:31:02,862 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 02:31:02,865 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 02:31:02,867 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 02:31:02,868 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 02:31:02,870 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 02:31:02,871 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 02:31:02,871 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 02:31:02,875 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 02:31:02,875 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 02:31:02,878 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 02:31:02,878 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 02:31:02,879 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 02:31:02,881 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 02:31:02,882 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 02:31:02,883 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 02:31:02,883 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 02:31:02,886 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 02:31:02,887 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 02:31:02,887 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 02:31:02,888 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 02:31:02,890 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 02:31:02,891 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 02:31:02,904 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 02:31:02,904 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 02:31:02,907 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 02:31:02,907 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 02:31:02,907 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 02:31:02,907 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 02:31:02,908 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 02:31:02,908 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 02:31:02,908 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 02:31:02,908 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 02:31:02,909 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 02:31:02,910 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 02:31:02,910 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 02:31:02,910 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 02:31:02,911 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 02:31:02,911 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 02:31:02,911 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 02:31:02,911 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 02:31:02,912 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 02:31:02,912 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 02:31:02,912 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 02:31:02,912 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 02:31:02,912 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 02:31:03,206 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 02:31:03,220 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 02:31:03,224 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 02:31:03,226 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 02:31:03,226 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 02:31:03,227 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/id_build.i.v+lhb-reducer.c [2020-07-11 02:31:03,326 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f80e5680/add2ed19250646b190403df34f7561ec/FLAGc243df8d0 [2020-07-11 02:31:03,835 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 02:31:03,839 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/id_build.i.v+lhb-reducer.c [2020-07-11 02:31:03,848 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f80e5680/add2ed19250646b190403df34f7561ec/FLAGc243df8d0 [2020-07-11 02:31:04,196 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f80e5680/add2ed19250646b190403df34f7561ec [2020-07-11 02:31:04,206 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 02:31:04,208 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 02:31:04,210 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 02:31:04,210 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 02:31:04,214 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 02:31:04,216 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:31:04" (1/1) ... [2020-07-11 02:31:04,219 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40f97057 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:04, skipping insertion in model container [2020-07-11 02:31:04,219 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:31:04" (1/1) ... [2020-07-11 02:31:04,227 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 02:31:04,249 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 02:31:04,451 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:31:04,458 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 02:31:04,483 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:31:04,501 INFO L208 MainTranslator]: Completed translation [2020-07-11 02:31:04,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:04 WrapperNode [2020-07-11 02:31:04,501 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 02:31:04,502 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 02:31:04,503 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 02:31:04,503 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 02:31:04,519 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:04" (1/1) ... [2020-07-11 02:31:04,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:04" (1/1) ... [2020-07-11 02:31:04,526 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:04" (1/1) ... [2020-07-11 02:31:04,527 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:04" (1/1) ... [2020-07-11 02:31:04,533 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:04" (1/1) ... [2020-07-11 02:31:04,538 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:04" (1/1) ... [2020-07-11 02:31:04,539 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:04" (1/1) ... [2020-07-11 02:31:04,541 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 02:31:04,542 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 02:31:04,542 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 02:31:04,542 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 02:31:04,543 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 02:31:04,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 02:31:04,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 02:31:04,701 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-11 02:31:04,701 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 02:31:04,701 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 02:31:04,701 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-11 02:31:04,701 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-11 02:31:04,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-11 02:31:04,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 02:31:04,702 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 02:31:04,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 02:31:04,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 02:31:05,155 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 02:31:05,156 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-11 02:31:05,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:31:05 BoogieIcfgContainer [2020-07-11 02:31:05,162 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 02:31:05,163 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 02:31:05,163 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 02:31:05,167 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 02:31:05,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 02:31:04" (1/3) ... [2020-07-11 02:31:05,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b389546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:31:05, skipping insertion in model container [2020-07-11 02:31:05,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:04" (2/3) ... [2020-07-11 02:31:05,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b389546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:31:05, skipping insertion in model container [2020-07-11 02:31:05,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:31:05" (3/3) ... [2020-07-11 02:31:05,171 INFO L109 eAbstractionObserver]: Analyzing ICFG id_build.i.v+lhb-reducer.c [2020-07-11 02:31:05,183 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 02:31:05,193 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2020-07-11 02:31:05,208 INFO L251 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2020-07-11 02:31:05,233 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 02:31:05,233 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 02:31:05,233 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 02:31:05,233 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 02:31:05,233 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 02:31:05,234 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 02:31:05,234 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 02:31:05,234 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 02:31:05,249 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2020-07-11 02:31:05,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-11 02:31:05,258 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:31:05,259 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:31:05,260 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:31:05,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:31:05,266 INFO L82 PathProgramCache]: Analyzing trace with hash -627197159, now seen corresponding path program 1 times [2020-07-11 02:31:05,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:31:05,274 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [518980750] [2020-07-11 02:31:05,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:31:05,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:05,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:05,572 INFO L280 TraceCheckUtils]: 0: Hoare triple {67#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_100~0 |old(~__return_100~0)|))} ~__return_main~0 := 0; {58#true} is VALID [2020-07-11 02:31:05,573 INFO L280 TraceCheckUtils]: 1: Hoare triple {58#true} ~__return_100~0 := 0; {58#true} is VALID [2020-07-11 02:31:05,573 INFO L280 TraceCheckUtils]: 2: Hoare triple {58#true} assume true; {58#true} is VALID [2020-07-11 02:31:05,574 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {58#true} {58#true} #89#return; {58#true} is VALID [2020-07-11 02:31:05,578 INFO L263 TraceCheckUtils]: 0: Hoare triple {58#true} call ULTIMATE.init(); {67#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_100~0 |old(~__return_100~0)|))} is VALID [2020-07-11 02:31:05,579 INFO L280 TraceCheckUtils]: 1: Hoare triple {67#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_100~0 |old(~__return_100~0)|))} ~__return_main~0 := 0; {58#true} is VALID [2020-07-11 02:31:05,579 INFO L280 TraceCheckUtils]: 2: Hoare triple {58#true} ~__return_100~0 := 0; {58#true} is VALID [2020-07-11 02:31:05,580 INFO L280 TraceCheckUtils]: 3: Hoare triple {58#true} assume true; {58#true} is VALID [2020-07-11 02:31:05,580 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {58#true} {58#true} #89#return; {58#true} is VALID [2020-07-11 02:31:05,581 INFO L263 TraceCheckUtils]: 5: Hoare triple {58#true} call #t~ret1 := main(); {58#true} is VALID [2020-07-11 02:31:05,581 INFO L280 TraceCheckUtils]: 6: Hoare triple {58#true} havoc ~main__offset~0; {58#true} is VALID [2020-07-11 02:31:05,581 INFO L280 TraceCheckUtils]: 7: Hoare triple {58#true} havoc ~main__length~0; {58#true} is VALID [2020-07-11 02:31:05,582 INFO L280 TraceCheckUtils]: 8: Hoare triple {58#true} havoc ~main__nlen~0; {58#true} is VALID [2020-07-11 02:31:05,582 INFO L280 TraceCheckUtils]: 9: Hoare triple {58#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {58#true} is VALID [2020-07-11 02:31:05,583 INFO L280 TraceCheckUtils]: 10: Hoare triple {58#true} ~main__nlen~0 := #t~nondet0; {58#true} is VALID [2020-07-11 02:31:05,583 INFO L280 TraceCheckUtils]: 11: Hoare triple {58#true} havoc #t~nondet0; {58#true} is VALID [2020-07-11 02:31:05,584 INFO L280 TraceCheckUtils]: 12: Hoare triple {58#true} havoc ~main__i~0; {58#true} is VALID [2020-07-11 02:31:05,584 INFO L280 TraceCheckUtils]: 13: Hoare triple {58#true} havoc ~main__j~0; {58#true} is VALID [2020-07-11 02:31:05,584 INFO L280 TraceCheckUtils]: 14: Hoare triple {58#true} ~main__i~0 := 0; {58#true} is VALID [2020-07-11 02:31:05,586 INFO L280 TraceCheckUtils]: 15: Hoare triple {58#true} assume ~main__i~0 < ~main__nlen~0; {64#(< main_~main__i~0 main_~main__nlen~0)} is VALID [2020-07-11 02:31:05,587 INFO L280 TraceCheckUtils]: 16: Hoare triple {64#(< main_~main__i~0 main_~main__nlen~0)} ~main__j~0 := 0; {64#(< main_~main__i~0 main_~main__nlen~0)} is VALID [2020-07-11 02:31:05,588 INFO L280 TraceCheckUtils]: 17: Hoare triple {64#(< main_~main__i~0 main_~main__nlen~0)} assume ~main__j~0 < 8; {64#(< main_~main__i~0 main_~main__nlen~0)} is VALID [2020-07-11 02:31:05,589 INFO L280 TraceCheckUtils]: 18: Hoare triple {64#(< main_~main__i~0 main_~main__nlen~0)} havoc ~__tmp_1~0; {64#(< main_~main__i~0 main_~main__nlen~0)} is VALID [2020-07-11 02:31:05,591 INFO L280 TraceCheckUtils]: 19: Hoare triple {64#(< main_~main__i~0 main_~main__nlen~0)} ~__tmp_1~0 := (if 0 <= ~main__nlen~0 - 1 - ~main__i~0 then 1 else 0); {65#(not (= 0 main_~__tmp_1~0))} is VALID [2020-07-11 02:31:05,592 INFO L280 TraceCheckUtils]: 20: Hoare triple {65#(not (= 0 main_~__tmp_1~0))} havoc ~__VERIFIER_assert__cond~0; {65#(not (= 0 main_~__tmp_1~0))} is VALID [2020-07-11 02:31:05,594 INFO L280 TraceCheckUtils]: 21: Hoare triple {65#(not (= 0 main_~__tmp_1~0))} ~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {66#(not (= 0 main_~__VERIFIER_assert__cond~0))} is VALID [2020-07-11 02:31:05,595 INFO L280 TraceCheckUtils]: 22: Hoare triple {66#(not (= 0 main_~__VERIFIER_assert__cond~0))} assume 0 == ~__VERIFIER_assert__cond~0; {59#false} is VALID [2020-07-11 02:31:05,596 INFO L280 TraceCheckUtils]: 23: Hoare triple {59#false} assume !false; {59#false} is VALID [2020-07-11 02:31:05,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 02:31:05,601 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [518980750] [2020-07-11 02:31:05,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:31:05,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-11 02:31:05,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680132047] [2020-07-11 02:31:05,612 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-07-11 02:31:05,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:31:05,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 02:31:05,679 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:31:05,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 02:31:05,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:31:05,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 02:31:05,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-11 02:31:05,694 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 6 states. [2020-07-11 02:31:06,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:06,493 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2020-07-11 02:31:06,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-11 02:31:06,494 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-07-11 02:31:06,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:31:06,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 02:31:06,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2020-07-11 02:31:06,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 02:31:06,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2020-07-11 02:31:06,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 66 transitions. [2020-07-11 02:31:06,617 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:31:06,631 INFO L225 Difference]: With dead ends: 61 [2020-07-11 02:31:06,631 INFO L226 Difference]: Without dead ends: 43 [2020-07-11 02:31:06,636 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-07-11 02:31:06,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-11 02:31:06,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-07-11 02:31:06,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:31:06,795 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2020-07-11 02:31:06,796 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2020-07-11 02:31:06,796 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2020-07-11 02:31:06,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:06,802 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2020-07-11 02:31:06,803 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2020-07-11 02:31:06,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:06,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:06,804 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2020-07-11 02:31:06,804 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2020-07-11 02:31:06,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:06,810 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2020-07-11 02:31:06,810 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2020-07-11 02:31:06,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:06,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:06,811 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:31:06,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:31:06,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-11 02:31:06,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2020-07-11 02:31:06,817 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 24 [2020-07-11 02:31:06,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:31:06,818 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2020-07-11 02:31:06,818 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 02:31:06,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 45 transitions. [2020-07-11 02:31:06,891 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:31:06,891 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2020-07-11 02:31:06,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-11 02:31:06,892 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:31:06,893 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, 1, 1, 1, 1] [2020-07-11 02:31:06,893 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 02:31:06,894 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:31:06,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:31:06,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1662596629, now seen corresponding path program 1 times [2020-07-11 02:31:06,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:31:06,895 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1903914321] [2020-07-11 02:31:06,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:31:06,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:07,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:07,041 INFO L280 TraceCheckUtils]: 0: Hoare triple {383#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_100~0 |old(~__return_100~0)|))} ~__return_main~0 := 0; {374#true} is VALID [2020-07-11 02:31:07,042 INFO L280 TraceCheckUtils]: 1: Hoare triple {374#true} ~__return_100~0 := 0; {374#true} is VALID [2020-07-11 02:31:07,042 INFO L280 TraceCheckUtils]: 2: Hoare triple {374#true} assume true; {374#true} is VALID [2020-07-11 02:31:07,043 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {374#true} {374#true} #89#return; {374#true} is VALID [2020-07-11 02:31:07,044 INFO L263 TraceCheckUtils]: 0: Hoare triple {374#true} call ULTIMATE.init(); {383#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_100~0 |old(~__return_100~0)|))} is VALID [2020-07-11 02:31:07,045 INFO L280 TraceCheckUtils]: 1: Hoare triple {383#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_100~0 |old(~__return_100~0)|))} ~__return_main~0 := 0; {374#true} is VALID [2020-07-11 02:31:07,045 INFO L280 TraceCheckUtils]: 2: Hoare triple {374#true} ~__return_100~0 := 0; {374#true} is VALID [2020-07-11 02:31:07,046 INFO L280 TraceCheckUtils]: 3: Hoare triple {374#true} assume true; {374#true} is VALID [2020-07-11 02:31:07,046 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {374#true} {374#true} #89#return; {374#true} is VALID [2020-07-11 02:31:07,046 INFO L263 TraceCheckUtils]: 5: Hoare triple {374#true} call #t~ret1 := main(); {374#true} is VALID [2020-07-11 02:31:07,047 INFO L280 TraceCheckUtils]: 6: Hoare triple {374#true} havoc ~main__offset~0; {374#true} is VALID [2020-07-11 02:31:07,047 INFO L280 TraceCheckUtils]: 7: Hoare triple {374#true} havoc ~main__length~0; {374#true} is VALID [2020-07-11 02:31:07,047 INFO L280 TraceCheckUtils]: 8: Hoare triple {374#true} havoc ~main__nlen~0; {374#true} is VALID [2020-07-11 02:31:07,048 INFO L280 TraceCheckUtils]: 9: Hoare triple {374#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {374#true} is VALID [2020-07-11 02:31:07,048 INFO L280 TraceCheckUtils]: 10: Hoare triple {374#true} ~main__nlen~0 := #t~nondet0; {374#true} is VALID [2020-07-11 02:31:07,048 INFO L280 TraceCheckUtils]: 11: Hoare triple {374#true} havoc #t~nondet0; {374#true} is VALID [2020-07-11 02:31:07,049 INFO L280 TraceCheckUtils]: 12: Hoare triple {374#true} havoc ~main__i~0; {374#true} is VALID [2020-07-11 02:31:07,049 INFO L280 TraceCheckUtils]: 13: Hoare triple {374#true} havoc ~main__j~0; {374#true} is VALID [2020-07-11 02:31:07,050 INFO L280 TraceCheckUtils]: 14: Hoare triple {374#true} ~main__i~0 := 0; {380#(< 0 (+ main_~main__i~0 1))} is VALID [2020-07-11 02:31:07,051 INFO L280 TraceCheckUtils]: 15: Hoare triple {380#(< 0 (+ main_~main__i~0 1))} assume ~main__i~0 < ~main__nlen~0; {380#(< 0 (+ main_~main__i~0 1))} is VALID [2020-07-11 02:31:07,052 INFO L280 TraceCheckUtils]: 16: Hoare triple {380#(< 0 (+ main_~main__i~0 1))} ~main__j~0 := 0; {380#(< 0 (+ main_~main__i~0 1))} is VALID [2020-07-11 02:31:07,053 INFO L280 TraceCheckUtils]: 17: Hoare triple {380#(< 0 (+ main_~main__i~0 1))} assume ~main__j~0 < 8; {380#(< 0 (+ main_~main__i~0 1))} is VALID [2020-07-11 02:31:07,054 INFO L280 TraceCheckUtils]: 18: Hoare triple {380#(< 0 (+ main_~main__i~0 1))} havoc ~__tmp_1~0; {380#(< 0 (+ main_~main__i~0 1))} is VALID [2020-07-11 02:31:07,055 INFO L280 TraceCheckUtils]: 19: Hoare triple {380#(< 0 (+ main_~main__i~0 1))} ~__tmp_1~0 := (if 0 <= ~main__nlen~0 - 1 - ~main__i~0 then 1 else 0); {380#(< 0 (+ main_~main__i~0 1))} is VALID [2020-07-11 02:31:07,056 INFO L280 TraceCheckUtils]: 20: Hoare triple {380#(< 0 (+ main_~main__i~0 1))} havoc ~__VERIFIER_assert__cond~0; {380#(< 0 (+ main_~main__i~0 1))} is VALID [2020-07-11 02:31:07,057 INFO L280 TraceCheckUtils]: 21: Hoare triple {380#(< 0 (+ main_~main__i~0 1))} ~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {380#(< 0 (+ main_~main__i~0 1))} is VALID [2020-07-11 02:31:07,058 INFO L280 TraceCheckUtils]: 22: Hoare triple {380#(< 0 (+ main_~main__i~0 1))} assume !(0 == ~__VERIFIER_assert__cond~0); {380#(< 0 (+ main_~main__i~0 1))} is VALID [2020-07-11 02:31:07,059 INFO L280 TraceCheckUtils]: 23: Hoare triple {380#(< 0 (+ main_~main__i~0 1))} havoc ~__tmp_2~0; {380#(< 0 (+ main_~main__i~0 1))} is VALID [2020-07-11 02:31:07,061 INFO L280 TraceCheckUtils]: 24: Hoare triple {380#(< 0 (+ main_~main__i~0 1))} ~__tmp_2~0 := (if ~main__nlen~0 - 1 - ~main__i~0 < ~main__nlen~0 then 1 else 0); {381#(not (= 0 main_~__tmp_2~0))} is VALID [2020-07-11 02:31:07,062 INFO L280 TraceCheckUtils]: 25: Hoare triple {381#(not (= 0 main_~__tmp_2~0))} havoc ~__VERIFIER_assert__cond~1; {381#(not (= 0 main_~__tmp_2~0))} is VALID [2020-07-11 02:31:07,063 INFO L280 TraceCheckUtils]: 26: Hoare triple {381#(not (= 0 main_~__tmp_2~0))} ~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {382#(not (= 0 main_~__VERIFIER_assert__cond~1))} is VALID [2020-07-11 02:31:07,064 INFO L280 TraceCheckUtils]: 27: Hoare triple {382#(not (= 0 main_~__VERIFIER_assert__cond~1))} assume 0 == ~__VERIFIER_assert__cond~1; {375#false} is VALID [2020-07-11 02:31:07,064 INFO L280 TraceCheckUtils]: 28: Hoare triple {375#false} assume !false; {375#false} is VALID [2020-07-11 02:31:07,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 02:31:07,067 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1903914321] [2020-07-11 02:31:07,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:31:07,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-11 02:31:07,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125246497] [2020-07-11 02:31:07,070 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2020-07-11 02:31:07,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:31:07,071 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 02:31:07,116 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:31:07,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 02:31:07,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:31:07,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 02:31:07,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-11 02:31:07,118 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 6 states. [2020-07-11 02:31:07,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:07,587 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2020-07-11 02:31:07,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-11 02:31:07,588 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2020-07-11 02:31:07,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:31:07,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 02:31:07,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2020-07-11 02:31:07,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 02:31:07,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2020-07-11 02:31:07,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 48 transitions. [2020-07-11 02:31:07,653 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:31:07,656 INFO L225 Difference]: With dead ends: 46 [2020-07-11 02:31:07,656 INFO L226 Difference]: Without dead ends: 44 [2020-07-11 02:31:07,657 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-07-11 02:31:07,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-11 02:31:07,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2020-07-11 02:31:07,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:31:07,804 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 41 states. [2020-07-11 02:31:07,804 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 41 states. [2020-07-11 02:31:07,804 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 41 states. [2020-07-11 02:31:07,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:07,810 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2020-07-11 02:31:07,810 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2020-07-11 02:31:07,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:07,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:07,811 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 44 states. [2020-07-11 02:31:07,811 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 44 states. [2020-07-11 02:31:07,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:07,815 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2020-07-11 02:31:07,815 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2020-07-11 02:31:07,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:07,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:07,816 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:31:07,816 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:31:07,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-11 02:31:07,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2020-07-11 02:31:07,819 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 29 [2020-07-11 02:31:07,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:31:07,820 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2020-07-11 02:31:07,820 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 02:31:07,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 43 transitions. [2020-07-11 02:31:07,890 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:31:07,891 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2020-07-11 02:31:07,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-11 02:31:07,894 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:31:07,894 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:31:07,894 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 02:31:07,895 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:31:07,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:31:07,895 INFO L82 PathProgramCache]: Analyzing trace with hash 792220297, now seen corresponding path program 1 times [2020-07-11 02:31:07,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:31:07,896 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [484768655] [2020-07-11 02:31:07,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:31:07,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:08,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:08,079 INFO L280 TraceCheckUtils]: 0: Hoare triple {667#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_100~0 |old(~__return_100~0)|))} ~__return_main~0 := 0; {656#true} is VALID [2020-07-11 02:31:08,079 INFO L280 TraceCheckUtils]: 1: Hoare triple {656#true} ~__return_100~0 := 0; {656#true} is VALID [2020-07-11 02:31:08,080 INFO L280 TraceCheckUtils]: 2: Hoare triple {656#true} assume true; {656#true} is VALID [2020-07-11 02:31:08,080 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {656#true} {656#true} #89#return; {656#true} is VALID [2020-07-11 02:31:08,081 INFO L263 TraceCheckUtils]: 0: Hoare triple {656#true} call ULTIMATE.init(); {667#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_100~0 |old(~__return_100~0)|))} is VALID [2020-07-11 02:31:08,082 INFO L280 TraceCheckUtils]: 1: Hoare triple {667#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_100~0 |old(~__return_100~0)|))} ~__return_main~0 := 0; {656#true} is VALID [2020-07-11 02:31:08,082 INFO L280 TraceCheckUtils]: 2: Hoare triple {656#true} ~__return_100~0 := 0; {656#true} is VALID [2020-07-11 02:31:08,082 INFO L280 TraceCheckUtils]: 3: Hoare triple {656#true} assume true; {656#true} is VALID [2020-07-11 02:31:08,082 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {656#true} {656#true} #89#return; {656#true} is VALID [2020-07-11 02:31:08,083 INFO L263 TraceCheckUtils]: 5: Hoare triple {656#true} call #t~ret1 := main(); {656#true} is VALID [2020-07-11 02:31:08,083 INFO L280 TraceCheckUtils]: 6: Hoare triple {656#true} havoc ~main__offset~0; {656#true} is VALID [2020-07-11 02:31:08,083 INFO L280 TraceCheckUtils]: 7: Hoare triple {656#true} havoc ~main__length~0; {656#true} is VALID [2020-07-11 02:31:08,084 INFO L280 TraceCheckUtils]: 8: Hoare triple {656#true} havoc ~main__nlen~0; {656#true} is VALID [2020-07-11 02:31:08,084 INFO L280 TraceCheckUtils]: 9: Hoare triple {656#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {656#true} is VALID [2020-07-11 02:31:08,084 INFO L280 TraceCheckUtils]: 10: Hoare triple {656#true} ~main__nlen~0 := #t~nondet0; {656#true} is VALID [2020-07-11 02:31:08,084 INFO L280 TraceCheckUtils]: 11: Hoare triple {656#true} havoc #t~nondet0; {656#true} is VALID [2020-07-11 02:31:08,085 INFO L280 TraceCheckUtils]: 12: Hoare triple {656#true} havoc ~main__i~0; {656#true} is VALID [2020-07-11 02:31:08,085 INFO L280 TraceCheckUtils]: 13: Hoare triple {656#true} havoc ~main__j~0; {656#true} is VALID [2020-07-11 02:31:08,085 INFO L280 TraceCheckUtils]: 14: Hoare triple {656#true} ~main__i~0 := 0; {656#true} is VALID [2020-07-11 02:31:08,086 INFO L280 TraceCheckUtils]: 15: Hoare triple {656#true} assume ~main__i~0 < ~main__nlen~0; {656#true} is VALID [2020-07-11 02:31:08,086 INFO L280 TraceCheckUtils]: 16: Hoare triple {656#true} ~main__j~0 := 0; {656#true} is VALID [2020-07-11 02:31:08,086 INFO L280 TraceCheckUtils]: 17: Hoare triple {656#true} assume ~main__j~0 < 8; {656#true} is VALID [2020-07-11 02:31:08,087 INFO L280 TraceCheckUtils]: 18: Hoare triple {656#true} havoc ~__tmp_1~0; {656#true} is VALID [2020-07-11 02:31:08,088 INFO L280 TraceCheckUtils]: 19: Hoare triple {656#true} ~__tmp_1~0 := (if 0 <= ~main__nlen~0 - 1 - ~main__i~0 then 1 else 0); {662#(or (and (= 1 main_~__tmp_1~0) (<= (+ main_~main__i~0 1) main_~main__nlen~0)) (and (= 0 main_~__tmp_1~0) (< main_~main__nlen~0 (+ main_~main__i~0 1))))} is VALID [2020-07-11 02:31:08,089 INFO L280 TraceCheckUtils]: 20: Hoare triple {662#(or (and (= 1 main_~__tmp_1~0) (<= (+ main_~main__i~0 1) main_~main__nlen~0)) (and (= 0 main_~__tmp_1~0) (< main_~main__nlen~0 (+ main_~main__i~0 1))))} havoc ~__VERIFIER_assert__cond~0; {662#(or (and (= 1 main_~__tmp_1~0) (<= (+ main_~main__i~0 1) main_~main__nlen~0)) (and (= 0 main_~__tmp_1~0) (< main_~main__nlen~0 (+ main_~main__i~0 1))))} is VALID [2020-07-11 02:31:08,090 INFO L280 TraceCheckUtils]: 21: Hoare triple {662#(or (and (= 1 main_~__tmp_1~0) (<= (+ main_~main__i~0 1) main_~main__nlen~0)) (and (= 0 main_~__tmp_1~0) (< main_~main__nlen~0 (+ main_~main__i~0 1))))} ~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {663#(or (and (<= (+ main_~main__i~0 1) main_~main__nlen~0) (= 1 main_~__VERIFIER_assert__cond~0)) (and (= 0 main_~__VERIFIER_assert__cond~0) (< main_~main__nlen~0 (+ main_~main__i~0 1))))} is VALID [2020-07-11 02:31:08,094 INFO L280 TraceCheckUtils]: 22: Hoare triple {663#(or (and (<= (+ main_~main__i~0 1) main_~main__nlen~0) (= 1 main_~__VERIFIER_assert__cond~0)) (and (= 0 main_~__VERIFIER_assert__cond~0) (< main_~main__nlen~0 (+ main_~main__i~0 1))))} assume !(0 == ~__VERIFIER_assert__cond~0); {664#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} is VALID [2020-07-11 02:31:08,095 INFO L280 TraceCheckUtils]: 23: Hoare triple {664#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} havoc ~__tmp_2~0; {664#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} is VALID [2020-07-11 02:31:08,096 INFO L280 TraceCheckUtils]: 24: Hoare triple {664#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} ~__tmp_2~0 := (if ~main__nlen~0 - 1 - ~main__i~0 < ~main__nlen~0 then 1 else 0); {664#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} is VALID [2020-07-11 02:31:08,097 INFO L280 TraceCheckUtils]: 25: Hoare triple {664#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} havoc ~__VERIFIER_assert__cond~1; {664#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} is VALID [2020-07-11 02:31:08,098 INFO L280 TraceCheckUtils]: 26: Hoare triple {664#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} ~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {664#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} is VALID [2020-07-11 02:31:08,098 INFO L280 TraceCheckUtils]: 27: Hoare triple {664#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} assume !(0 == ~__VERIFIER_assert__cond~1); {664#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} is VALID [2020-07-11 02:31:08,099 INFO L280 TraceCheckUtils]: 28: Hoare triple {664#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} ~main__j~0 := 1 + ~main__j~0; {664#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} is VALID [2020-07-11 02:31:08,100 INFO L280 TraceCheckUtils]: 29: Hoare triple {664#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} assume ~main__j~0 < 8; {664#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} is VALID [2020-07-11 02:31:08,101 INFO L280 TraceCheckUtils]: 30: Hoare triple {664#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} havoc ~__tmp_3~0; {664#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} is VALID [2020-07-11 02:31:08,102 INFO L280 TraceCheckUtils]: 31: Hoare triple {664#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} ~__tmp_3~0 := (if 0 <= ~main__nlen~0 - 1 - ~main__i~0 then 1 else 0); {665#(not (= 0 main_~__tmp_3~0))} is VALID [2020-07-11 02:31:08,102 INFO L280 TraceCheckUtils]: 32: Hoare triple {665#(not (= 0 main_~__tmp_3~0))} havoc ~__VERIFIER_assert__cond~2; {665#(not (= 0 main_~__tmp_3~0))} is VALID [2020-07-11 02:31:08,103 INFO L280 TraceCheckUtils]: 33: Hoare triple {665#(not (= 0 main_~__tmp_3~0))} ~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {666#(not (= 0 main_~__VERIFIER_assert__cond~2))} is VALID [2020-07-11 02:31:08,104 INFO L280 TraceCheckUtils]: 34: Hoare triple {666#(not (= 0 main_~__VERIFIER_assert__cond~2))} assume 0 == ~__VERIFIER_assert__cond~2; {657#false} is VALID [2020-07-11 02:31:08,104 INFO L280 TraceCheckUtils]: 35: Hoare triple {657#false} assume !false; {657#false} is VALID [2020-07-11 02:31:08,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 02:31:08,108 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [484768655] [2020-07-11 02:31:08,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:31:08,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-11 02:31:08,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775923586] [2020-07-11 02:31:08,110 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2020-07-11 02:31:08,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:31:08,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-11 02:31:08,149 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:31:08,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-11 02:31:08,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:31:08,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-11 02:31:08,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-11 02:31:08,151 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 8 states. [2020-07-11 02:31:09,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:09,391 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2020-07-11 02:31:09,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-11 02:31:09,392 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2020-07-11 02:31:09,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:31:09,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 02:31:09,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 78 transitions. [2020-07-11 02:31:09,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 02:31:09,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 78 transitions. [2020-07-11 02:31:09,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 78 transitions. [2020-07-11 02:31:09,518 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:31:09,518 INFO L225 Difference]: With dead ends: 72 [2020-07-11 02:31:09,518 INFO L226 Difference]: Without dead ends: 0 [2020-07-11 02:31:09,520 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2020-07-11 02:31:09,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-11 02:31:09,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-11 02:31:09,521 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:31:09,521 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-11 02:31:09,522 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 02:31:09,522 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 02:31:09,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:09,522 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 02:31:09,522 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:31:09,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:09,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:09,523 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 02:31:09,523 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 02:31:09,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:09,523 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 02:31:09,524 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:31:09,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:09,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:09,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:31:09,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:31:09,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-11 02:31:09,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-11 02:31:09,525 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2020-07-11 02:31:09,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:31:09,525 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-11 02:31:09,525 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-11 02:31:09,526 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-11 02:31:09,526 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:31:09,526 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:31:09,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:09,526 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 02:31:09,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-11 02:31:10,964 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-11 02:31:10,965 INFO L271 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-07-11 02:31:10,965 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_100~0 |old(~__return_100~0)|)) [2020-07-11 02:31:10,966 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-11 02:31:10,966 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-11 02:31:10,966 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-11 02:31:10,966 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-11 02:31:10,966 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-11 02:31:10,966 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 4 6) no Hoare annotation was computed. [2020-07-11 02:31:10,966 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-11 02:31:10,967 INFO L268 CegarLoopResult]: For program point L5-1(line 5) no Hoare annotation was computed. [2020-07-11 02:31:10,967 INFO L268 CegarLoopResult]: For program point L5-3(lines 4 6) no Hoare annotation was computed. [2020-07-11 02:31:10,967 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 4 6) no Hoare annotation was computed. [2020-07-11 02:31:10,967 INFO L264 CegarLoopResult]: At program point L31(lines 31 87) the Hoare annotation is: (and (= 1 main_~__tmp_1~0) (< main_~main__i~0 main_~main__nlen~0) (= |old(~__return_100~0)| ~__return_100~0) (= 1 main_~__VERIFIER_assert__cond~0) (< 0 (+ main_~main__i~0 1))) [2020-07-11 02:31:10,967 INFO L264 CegarLoopResult]: At program point L93(lines 12 100) the Hoare annotation is: (and (= |old(~__return_100~0)| ~__return_100~0) (< 0 (+ main_~main__i~0 1))) [2020-07-11 02:31:10,968 INFO L264 CegarLoopResult]: At program point L60(lines 60 68) the Hoare annotation is: (and (not (= 0 main_~__tmp_3~0)) (not (= 0 main_~__VERIFIER_assert__cond~2)) (not (= 0 main_~__VERIFIER_assert__cond~0)) (< main_~main__i~0 main_~main__nlen~0) (= |old(~__return_100~0)| ~__return_100~0) (not (= 0 main_~__tmp_2~0)) (not (= 0 main_~__VERIFIER_assert__cond~1)) (not (= 0 main_~__tmp_1~0)) (< 0 (+ main_~main__i~0 1))) [2020-07-11 02:31:10,968 INFO L264 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: (and (< main_~main__i~0 main_~main__nlen~0) (= |old(~__return_100~0)| ~__return_100~0) (< 0 (+ main_~main__i~0 1))) [2020-07-11 02:31:10,968 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 11 100) the Hoare annotation is: (or (and (not (= 0 main_~__VERIFIER_assert__cond~0)) (not (= 0 main_~__tmp_1~0))) (= |old(~__return_100~0)| ~__return_100~0)) [2020-07-11 02:31:10,968 INFO L264 CegarLoopResult]: At program point L56(line 56) the Hoare annotation is: (and (not (= 0 main_~__VERIFIER_assert__cond~0)) (< main_~main__i~0 main_~main__nlen~0) (= |old(~__return_100~0)| ~__return_100~0) (not (= 0 main_~__tmp_2~0)) (not (= 0 main_~__VERIFIER_assert__cond~1)) (not (= 0 main_~__tmp_1~0)) (< 0 (+ main_~main__i~0 1))) [2020-07-11 02:31:10,969 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (< main_~main__i~0 main_~main__nlen~0) (= |old(~__return_100~0)| ~__return_100~0) (< 0 (+ main_~main__i~0 1))) [2020-07-11 02:31:10,969 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (= |old(~__return_100~0)| ~__return_100~0) [2020-07-11 02:31:10,969 INFO L264 CegarLoopResult]: At program point L81(line 81) the Hoare annotation is: (and (not (= 0 main_~__VERIFIER_assert__cond~0)) (= |old(~__return_100~0)| ~__return_100~0) (not (= 0 main_~__tmp_1~0))) [2020-07-11 02:31:10,969 INFO L264 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (= |old(~__return_100~0)| ~__return_100~0) [2020-07-11 02:31:10,969 INFO L264 CegarLoopResult]: At program point L77(lines 50 85) the Hoare annotation is: (and (not (= 0 main_~__VERIFIER_assert__cond~0)) (< main_~main__i~0 main_~main__nlen~0) (= |old(~__return_100~0)| ~__return_100~0) (not (= 0 main_~__tmp_2~0)) (not (= 0 main_~__VERIFIER_assert__cond~1)) (not (= 0 main_~__tmp_1~0)) (< 0 (+ main_~main__i~0 1))) [2020-07-11 02:31:10,970 INFO L264 CegarLoopResult]: At program point L44(lines 44 85) the Hoare annotation is: (let ((.cse0 (< main_~main__i~0 main_~main__nlen~0)) (.cse1 (= |old(~__return_100~0)| ~__return_100~0)) (.cse2 (not (= 0 main_~__tmp_2~0))) (.cse3 (not (= 0 main_~__VERIFIER_assert__cond~1))) (.cse4 (< 0 (+ main_~main__i~0 1)))) (or (and (not (= 0 main_~__tmp_3~0)) (not (= 0 main_~__VERIFIER_assert__cond~2)) (not (= 0 main_~__VERIFIER_assert__cond~0)) .cse0 .cse1 .cse2 .cse3 (not (= 0 main_~__tmp_1~0)) .cse4) (and (= 1 main_~__tmp_1~0) .cse0 .cse1 .cse2 .cse3 (= 1 main_~__VERIFIER_assert__cond~0) .cse4))) [2020-07-11 02:31:10,970 INFO L264 CegarLoopResult]: At program point L73(line 73) the Hoare annotation is: (and (not (= 0 main_~__VERIFIER_assert__cond~0)) (< main_~main__i~0 main_~main__nlen~0) (= |old(~__return_100~0)| ~__return_100~0) (not (= 0 main_~__tmp_2~0)) (not (= 0 main_~__VERIFIER_assert__cond~1)) (not (= 0 main_~__tmp_1~0)) (< 0 (+ main_~main__i~0 1))) [2020-07-11 02:31:10,970 INFO L264 CegarLoopResult]: At program point L98(line 98) the Hoare annotation is: (= |old(~__return_100~0)| ~__return_100~0) [2020-07-11 02:31:10,970 INFO L264 CegarLoopResult]: At program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 62) the Hoare annotation is: false [2020-07-11 02:31:10,970 INFO L264 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: (and (< main_~main__i~0 main_~main__nlen~0) (= |old(~__return_100~0)| ~__return_100~0) (< 0 (+ main_~main__i~0 1))) [2020-07-11 02:31:10,971 INFO L264 CegarLoopResult]: At program point L57(line 57) the Hoare annotation is: (and (not (= 0 main_~__VERIFIER_assert__cond~0)) (< main_~main__i~0 main_~main__nlen~0) (= |old(~__return_100~0)| ~__return_100~0) (not (= 0 main_~__tmp_2~0)) (not (= 0 main_~__VERIFIER_assert__cond~1)) (not (= 0 main_~__tmp_1~0)) (< 0 (+ main_~main__i~0 1))) [2020-07-11 02:31:10,971 INFO L264 CegarLoopResult]: At program point L24(lines 24 94) the Hoare annotation is: (and (< main_~main__i~0 main_~main__nlen~0) (= |old(~__return_100~0)| ~__return_100~0) (< 0 (+ main_~main__i~0 1))) [2020-07-11 02:31:10,971 INFO L264 CegarLoopResult]: At program point L82(line 82) the Hoare annotation is: (and (not (= 0 main_~__VERIFIER_assert__cond~0)) (not (= 0 main_~__tmp_1~0))) [2020-07-11 02:31:10,971 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (= |old(~__return_100~0)| ~__return_100~0) [2020-07-11 02:31:10,971 INFO L264 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: (= |old(~__return_100~0)| ~__return_100~0) [2020-07-11 02:31:10,972 INFO L264 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: (= |old(~__return_100~0)| ~__return_100~0) [2020-07-11 02:31:10,972 INFO L264 CegarLoopResult]: At program point L74(lines 74 83) the Hoare annotation is: (and (not (= 0 main_~__VERIFIER_assert__cond~0)) (= |old(~__return_100~0)| ~__return_100~0) (not (= 0 main_~__tmp_2~0)) (not (= 0 main_~__VERIFIER_assert__cond~1)) (not (= 0 main_~__tmp_1~0)) (< 0 (+ main_~main__i~0 1))) [2020-07-11 02:31:10,972 INFO L264 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: (let ((.cse0 (< main_~main__i~0 main_~main__nlen~0)) (.cse1 (= |old(~__return_100~0)| ~__return_100~0)) (.cse2 (< 0 (+ main_~main__i~0 1)))) (or (and (= 1 main_~__tmp_1~0) .cse0 .cse1 (= 1 main_~__VERIFIER_assert__cond~0) .cse2) (and (not (= 0 main_~__tmp_3~0)) (not (= 0 main_~__VERIFIER_assert__cond~2)) (not (= 0 main_~__VERIFIER_assert__cond~0)) .cse0 .cse1 (not (= 0 main_~__tmp_1~0)) .cse2))) [2020-07-11 02:31:10,972 INFO L264 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: false [2020-07-11 02:31:10,972 INFO L264 CegarLoopResult]: At program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 46) the Hoare annotation is: false [2020-07-11 02:31:10,973 INFO L264 CegarLoopResult]: At program point L62(line 62) the Hoare annotation is: false [2020-07-11 02:31:10,973 INFO L264 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: (and (= 1 main_~__tmp_1~0) (< main_~main__i~0 main_~main__nlen~0) (= |old(~__return_100~0)| ~__return_100~0) (< 0 (+ main_~main__i~0 1))) [2020-07-11 02:31:10,973 INFO L264 CegarLoopResult]: At program point L58(line 58) the Hoare annotation is: (and (not (= 0 main_~__tmp_3~0)) (not (= 0 main_~__VERIFIER_assert__cond~0)) (< main_~main__i~0 main_~main__nlen~0) (= |old(~__return_100~0)| ~__return_100~0) (not (= 0 main_~__tmp_2~0)) (not (= 0 main_~__VERIFIER_assert__cond~1)) (not (= 0 main_~__tmp_1~0)) (< 0 (+ main_~main__i~0 1))) [2020-07-11 02:31:10,973 INFO L264 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (= |old(~__return_100~0)| ~__return_100~0) [2020-07-11 02:31:10,973 INFO L264 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: false [2020-07-11 02:31:10,974 INFO L264 CegarLoopResult]: At program point mainFINAL(lines 11 100) the Hoare annotation is: (or (and (not (= 0 main_~__VERIFIER_assert__cond~0)) (not (= 0 main_~__tmp_1~0))) (= |old(~__return_100~0)| ~__return_100~0)) [2020-07-11 02:31:10,974 INFO L264 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: (let ((.cse0 (< main_~main__i~0 main_~main__nlen~0)) (.cse1 (= |old(~__return_100~0)| ~__return_100~0)) (.cse2 (not (= 0 main_~__tmp_2~0))) (.cse3 (< 0 (+ main_~main__i~0 1)))) (or (and (not (= 0 main_~__tmp_3~0)) (not (= 0 main_~__VERIFIER_assert__cond~2)) (not (= 0 main_~__VERIFIER_assert__cond~0)) .cse0 .cse1 .cse2 (not (= 0 main_~__tmp_1~0)) .cse3) (and (= 1 main_~__tmp_1~0) .cse0 .cse1 .cse2 (= 1 main_~__VERIFIER_assert__cond~0) .cse3))) [2020-07-11 02:31:10,974 INFO L264 CegarLoopResult]: At program point L67(lines 37 87) the Hoare annotation is: (let ((.cse0 (< main_~main__i~0 main_~main__nlen~0)) (.cse1 (= |old(~__return_100~0)| ~__return_100~0)) (.cse2 (< 0 (+ main_~main__i~0 1)))) (or (and (= 1 main_~__tmp_1~0) .cse0 .cse1 (= 1 main_~__VERIFIER_assert__cond~0) .cse2) (and (not (= 0 main_~__tmp_3~0)) (not (= 0 main_~__VERIFIER_assert__cond~2)) (not (= 0 main_~__VERIFIER_assert__cond~0)) .cse0 .cse1 (not (= 0 main_~__tmp_1~0)) .cse2))) [2020-07-11 02:31:10,974 INFO L264 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: false [2020-07-11 02:31:10,974 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 33) the Hoare annotation is: false [2020-07-11 02:31:10,975 INFO L264 CegarLoopResult]: At program point L63(line 63) the Hoare annotation is: false [2020-07-11 02:31:10,975 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (and (= 1 main_~__tmp_1~0) (< main_~main__i~0 main_~main__nlen~0) (= |old(~__return_100~0)| ~__return_100~0) (< 0 (+ main_~main__i~0 1))) [2020-07-11 02:31:10,975 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 11 100) the Hoare annotation is: (= |old(~__return_100~0)| ~__return_100~0) [2020-07-11 02:31:10,975 INFO L264 CegarLoopResult]: At program point L92(line 92) the Hoare annotation is: (and (< main_~main__i~0 main_~main__nlen~0) (= |old(~__return_100~0)| ~__return_100~0) (< 0 (+ main_~main__i~0 1))) [2020-07-11 02:31:10,975 INFO L264 CegarLoopResult]: At program point L59(line 59) the Hoare annotation is: (and (not (= 0 main_~__tmp_3~0)) (not (= 0 main_~__VERIFIER_assert__cond~0)) (< main_~main__i~0 main_~main__nlen~0) (= |old(~__return_100~0)| ~__return_100~0) (not (= 0 main_~__tmp_2~0)) (not (= 0 main_~__VERIFIER_assert__cond~1)) (not (= 0 main_~__tmp_1~0)) (< 0 (+ main_~main__i~0 1))) [2020-07-11 02:31:10,976 INFO L264 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (let ((.cse0 (< main_~main__i~0 main_~main__nlen~0)) (.cse1 (= |old(~__return_100~0)| ~__return_100~0)) (.cse2 (not (= 0 main_~__tmp_2~0))) (.cse3 (not (= 0 main_~__VERIFIER_assert__cond~1))) (.cse4 (< 0 (+ main_~main__i~0 1)))) (or (and (not (= 0 main_~__tmp_3~0)) (not (= 0 main_~__VERIFIER_assert__cond~2)) (not (= 0 main_~__VERIFIER_assert__cond~0)) .cse0 .cse1 .cse2 .cse3 (not (= 0 main_~__tmp_1~0)) .cse4) (and (= 1 main_~__tmp_1~0) .cse0 .cse1 .cse2 .cse3 (= 1 main_~__VERIFIER_assert__cond~0) .cse4))) [2020-07-11 02:31:10,976 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (= |old(~__return_100~0)| ~__return_100~0) [2020-07-11 02:31:10,976 INFO L264 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: false [2020-07-11 02:31:10,976 INFO L264 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: (= |old(~__return_100~0)| ~__return_100~0) [2020-07-11 02:31:10,977 INFO L264 CegarLoopResult]: At program point L76(line 76) the Hoare annotation is: (and (not (= 0 main_~__VERIFIER_assert__cond~0)) (< main_~main__i~0 main_~main__nlen~0) (= |old(~__return_100~0)| ~__return_100~0) (not (= 0 main_~__tmp_2~0)) (not (= 0 main_~__VERIFIER_assert__cond~1)) (not (= 0 main_~__tmp_1~0)) (< 0 (+ main_~main__i~0 1))) [2020-07-11 02:31:10,977 INFO L264 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: (let ((.cse0 (< main_~main__i~0 main_~main__nlen~0)) (.cse1 (= |old(~__return_100~0)| ~__return_100~0)) (.cse2 (not (= 0 main_~__tmp_2~0))) (.cse3 (< 0 (+ main_~main__i~0 1)))) (or (and (not (= 0 main_~__tmp_3~0)) (not (= 0 main_~__VERIFIER_assert__cond~2)) (not (= 0 main_~__VERIFIER_assert__cond~0)) .cse0 .cse1 .cse2 (not (= 0 main_~__tmp_1~0)) .cse3) (and (= 1 main_~__tmp_1~0) .cse0 .cse1 .cse2 (= 1 main_~__VERIFIER_assert__cond~0) .cse3))) [2020-07-11 02:31:10,987 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-11 02:31:10,988 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-11 02:31:10,988 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-11 02:31:10,989 WARN L170 areAnnotationChecker]: L5-1 has no Hoare annotation [2020-07-11 02:31:10,989 WARN L170 areAnnotationChecker]: L5-3 has no Hoare annotation [2020-07-11 02:31:11,013 INFO L163 areAnnotationChecker]: CFG has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-11 02:31:11,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 02:31:11 BoogieIcfgContainer [2020-07-11 02:31:11,034 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 02:31:11,038 INFO L168 Benchmark]: Toolchain (without parser) took 6829.07 ms. Allocated memory was 138.4 MB in the beginning and 302.0 MB in the end (delta: 163.6 MB). Free memory was 103.5 MB in the beginning and 230.3 MB in the end (delta: -126.8 MB). Peak memory consumption was 36.8 MB. Max. memory is 7.1 GB. [2020-07-11 02:31:11,039 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 138.4 MB. Free memory was 121.9 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-11 02:31:11,040 INFO L168 Benchmark]: CACSL2BoogieTranslator took 292.30 ms. Allocated memory is still 138.4 MB. Free memory was 103.3 MB in the beginning and 93.0 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2020-07-11 02:31:11,040 INFO L168 Benchmark]: Boogie Preprocessor took 39.38 ms. Allocated memory is still 138.4 MB. Free memory was 93.0 MB in the beginning and 91.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2020-07-11 02:31:11,042 INFO L168 Benchmark]: RCFGBuilder took 619.62 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 91.5 MB in the beginning and 158.5 MB in the end (delta: -67.0 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2020-07-11 02:31:11,043 INFO L168 Benchmark]: TraceAbstraction took 5871.23 ms. Allocated memory was 202.9 MB in the beginning and 302.0 MB in the end (delta: 99.1 MB). Free memory was 157.8 MB in the beginning and 230.3 MB in the end (delta: -72.5 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2020-07-11 02:31:11,046 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.31 ms. Allocated memory is still 138.4 MB. Free memory was 121.9 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 292.30 ms. Allocated memory is still 138.4 MB. Free memory was 103.3 MB in the beginning and 93.0 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.38 ms. Allocated memory is still 138.4 MB. Free memory was 93.0 MB in the beginning and 91.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 619.62 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 91.5 MB in the beginning and 158.5 MB in the end (delta: -67.0 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5871.23 ms. Allocated memory was 202.9 MB in the beginning and 302.0 MB in the end (delta: 99.1 MB). Free memory was 157.8 MB in the beginning and 230.3 MB in the end (delta: -72.5 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 33]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 62]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 46]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: \old(__return_100) == __return_100 && 0 < main__i + 1 - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: (((((!(0 == __VERIFIER_assert__cond) && main__i < main__nlen) && \old(__return_100) == __return_100) && !(0 == __tmp_2)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __tmp_1)) && 0 < main__i + 1 - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ((((1 == __tmp_1 && main__i < main__nlen) && \old(__return_100) == __return_100) && 1 == __VERIFIER_assert__cond) && 0 < main__i + 1) || ((((((!(0 == __tmp_3) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && main__i < main__nlen) && \old(__return_100) == __return_100) && !(0 == __tmp_1)) && 0 < main__i + 1) - ProcedureContractResult [Line: 11]: Procedure Contract for main Derived contract for procedure main: (!(0 == __VERIFIER_assert__cond) && !(0 == __tmp_1)) || \old(__return_100) == __return_100 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 60 locations, 3 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.2s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 126 SDtfs, 333 SDslu, 85 SDs, 0 SdLazy, 304 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 55 LocationsWithAnnotation, 55 PreInvPairs, 92 NumberOfFragments, 812 HoareAnnotationTreeSize, 55 FomulaSimplifications, 1452 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 55 FomulaSimplificationsInter, 432 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 89 NumberOfCodeBlocks, 89 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 86 ConstructedInterpolants, 0 QuantifiedInterpolants, 8282 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...