/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/NetBSD_loop.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:28:23,805 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:28:23,808 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:28:23,833 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:28:23,833 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:28:23,836 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:28:23,838 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:28:23,851 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:28:23,855 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:28:23,858 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:28:23,860 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:28:23,863 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:28:23,864 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:28:23,866 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:28:23,868 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:28:23,870 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:28:23,872 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:28:23,874 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:28:23,876 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:28:23,882 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:28:23,888 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:28:23,893 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:28:23,895 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:28:23,895 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:28:23,898 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:28:23,898 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:28:23,898 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:28:23,899 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:28:23,900 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:28:23,901 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:28:23,901 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:28:23,902 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:28:23,903 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:28:23,904 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:28:23,905 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:28:23,905 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:28:23,906 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:28:23,906 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:28:23,906 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:28:23,907 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:28:23,908 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:28:23,909 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:28:23,925 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:28:23,925 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:28:23,927 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:28:23,927 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:28:23,927 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:28:23,927 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:28:23,928 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:28:23,928 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:28:23,928 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:28:23,928 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:28:23,928 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:28:23,928 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:28:23,929 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:28:23,929 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:28:23,929 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:28:23,929 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:28:23,929 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:28:23,930 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:28:23,930 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:28:23,930 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:28:23,930 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:28:23,930 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:28:23,931 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:28:23,931 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:28:23,931 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:28:23,931 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:28:23,931 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:28:23,932 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:28:23,932 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:28:23,932 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:28:24,263 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:28:24,282 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:28:24,287 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:28:24,289 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:28:24,290 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:28:24,291 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/NetBSD_loop.i [2020-07-10 15:28:24,392 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94f4e5099/f0235d13b1f341b381c6f6ffa0b3315d/FLAGbc1851cd9 [2020-07-10 15:28:24,923 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:28:24,924 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/NetBSD_loop.i [2020-07-10 15:28:24,931 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94f4e5099/f0235d13b1f341b381c6f6ffa0b3315d/FLAGbc1851cd9 [2020-07-10 15:28:25,287 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94f4e5099/f0235d13b1f341b381c6f6ffa0b3315d [2020-07-10 15:28:25,300 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:28:25,302 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:28:25,306 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:28:25,306 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:28:25,310 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:28:25,312 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:28:25" (1/1) ... [2020-07-10 15:28:25,315 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e526213 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:25, skipping insertion in model container [2020-07-10 15:28:25,316 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:28:25" (1/1) ... [2020-07-10 15:28:25,326 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:28:25,349 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:28:25,550 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:28:25,555 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:28:25,575 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:28:25,592 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:28:25,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:25 WrapperNode [2020-07-10 15:28:25,593 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:28:25,594 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:28:25,594 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:28:25,594 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:28:25,610 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:25" (1/1) ... [2020-07-10 15:28:25,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:25" (1/1) ... [2020-07-10 15:28:25,616 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:25" (1/1) ... [2020-07-10 15:28:25,617 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:25" (1/1) ... [2020-07-10 15:28:25,623 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:25" (1/1) ... [2020-07-10 15:28:25,630 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:25" (1/1) ... [2020-07-10 15:28:25,631 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:25" (1/1) ... [2020-07-10 15:28:25,632 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:28:25,633 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:28:25,633 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:28:25,633 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:28:25,635 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:28:25,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:28:25,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:28:25,804 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:28:25,804 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:28:25,804 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:28:25,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:28:25,804 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:28:25,804 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:28:25,805 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:28:25,805 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:28:25,805 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:28:25,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:28:25,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:28:26,103 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:28:26,104 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 15:28:26,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:28:26 BoogieIcfgContainer [2020-07-10 15:28:26,110 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:28:26,112 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:28:26,112 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:28:26,116 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:28:26,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:28:25" (1/3) ... [2020-07-10 15:28:26,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a6f27d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:28:26, skipping insertion in model container [2020-07-10 15:28:26,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:25" (2/3) ... [2020-07-10 15:28:26,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a6f27d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:28:26, skipping insertion in model container [2020-07-10 15:28:26,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:28:26" (3/3) ... [2020-07-10 15:28:26,121 INFO L109 eAbstractionObserver]: Analyzing ICFG NetBSD_loop.i [2020-07-10 15:28:26,138 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:28:26,149 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:28:26,168 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:28:26,197 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:28:26,198 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:28:26,198 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:28:26,198 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:28:26,201 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:28:26,202 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:28:26,202 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:28:26,202 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:28:26,254 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2020-07-10 15:28:26,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-10 15:28:26,263 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:26,265 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:26,265 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:26,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:26,273 INFO L82 PathProgramCache]: Analyzing trace with hash 826978896, now seen corresponding path program 1 times [2020-07-10 15:28:26,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:26,287 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93890450] [2020-07-10 15:28:26,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:26,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:26,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:26,575 INFO L280 TraceCheckUtils]: 0: Hoare triple {25#true} assume true; {25#true} is VALID [2020-07-10 15:28:26,576 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {25#true} {25#true} #49#return; {25#true} is VALID [2020-07-10 15:28:26,578 INFO L263 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {25#true} is VALID [2020-07-10 15:28:26,579 INFO L280 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2020-07-10 15:28:26,579 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #49#return; {25#true} is VALID [2020-07-10 15:28:26,580 INFO L263 TraceCheckUtils]: 3: Hoare triple {25#true} call #t~ret2 := main(); {25#true} is VALID [2020-07-10 15:28:26,581 INFO L280 TraceCheckUtils]: 4: Hoare triple {25#true} havoc ~MAXPATHLEN~0;havoc ~pathbuf_off~0;havoc ~bound_off~0;havoc ~glob2_p_off~0;havoc ~glob2_pathbuf_off~0;havoc ~glob2_pathlim_off~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~MAXPATHLEN~0 := #t~nondet0;havoc #t~nondet0; {25#true} is VALID [2020-07-10 15:28:26,581 INFO L280 TraceCheckUtils]: 5: Hoare triple {25#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {25#true} is VALID [2020-07-10 15:28:26,584 INFO L280 TraceCheckUtils]: 6: Hoare triple {25#true} ~pathbuf_off~0 := 0;~bound_off~0 := ~pathbuf_off~0 + (1 + ~MAXPATHLEN~0) - 1;~glob2_pathbuf_off~0 := ~pathbuf_off~0;~glob2_pathlim_off~0 := ~bound_off~0;~glob2_p_off~0 := ~glob2_pathbuf_off~0; {29#(<= 0 main_~glob2_p_off~0)} is VALID [2020-07-10 15:28:26,585 INFO L280 TraceCheckUtils]: 7: Hoare triple {29#(<= 0 main_~glob2_p_off~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {29#(<= 0 main_~glob2_p_off~0)} is VALID [2020-07-10 15:28:26,587 INFO L263 TraceCheckUtils]: 8: Hoare triple {29#(<= 0 main_~glob2_p_off~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {30#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:28:26,589 INFO L280 TraceCheckUtils]: 9: Hoare triple {30#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {31#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:28:26,590 INFO L280 TraceCheckUtils]: 10: Hoare triple {31#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {26#false} is VALID [2020-07-10 15:28:26,591 INFO L280 TraceCheckUtils]: 11: Hoare triple {26#false} assume !false; {26#false} is VALID [2020-07-10 15:28:26,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:28:26,594 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93890450] [2020-07-10 15:28:26,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:26,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:28:26,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044520539] [2020-07-10 15:28:26,606 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-10 15:28:26,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:26,614 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:28:26,652 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:26,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:28:26,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:26,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:28:26,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:28:26,666 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 5 states. [2020-07-10 15:28:26,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:26,938 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-10 15:28:26,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:28:26,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-10 15:28:26,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:26,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:28:26,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2020-07-10 15:28:26,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:28:26,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2020-07-10 15:28:26,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2020-07-10 15:28:27,061 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:27,076 INFO L225 Difference]: With dead ends: 44 [2020-07-10 15:28:27,077 INFO L226 Difference]: Without dead ends: 21 [2020-07-10 15:28:27,082 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:28:27,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-10 15:28:27,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-10 15:28:27,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:27,142 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2020-07-10 15:28:27,143 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-10 15:28:27,143 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-10 15:28:27,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:27,148 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2020-07-10 15:28:27,148 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2020-07-10 15:28:27,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:27,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:27,149 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-10 15:28:27,150 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-10 15:28:27,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:27,154 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2020-07-10 15:28:27,154 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2020-07-10 15:28:27,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:27,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:27,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:27,156 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:27,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-10 15:28:27,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2020-07-10 15:28:27,161 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 12 [2020-07-10 15:28:27,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:27,162 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2020-07-10 15:28:27,162 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:28:27,162 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2020-07-10 15:28:27,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-10 15:28:27,163 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:27,164 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:27,164 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:28:27,164 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:27,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:27,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1747164342, now seen corresponding path program 1 times [2020-07-10 15:28:27,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:27,166 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697575579] [2020-07-10 15:28:27,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:27,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:27,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:27,320 INFO L280 TraceCheckUtils]: 0: Hoare triple {168#true} assume true; {168#true} is VALID [2020-07-10 15:28:27,320 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {168#true} {168#true} #49#return; {168#true} is VALID [2020-07-10 15:28:27,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:27,379 INFO L280 TraceCheckUtils]: 0: Hoare triple {168#true} ~cond := #in~cond; {168#true} is VALID [2020-07-10 15:28:27,379 INFO L280 TraceCheckUtils]: 1: Hoare triple {168#true} assume !(0 == ~cond); {168#true} is VALID [2020-07-10 15:28:27,380 INFO L280 TraceCheckUtils]: 2: Hoare triple {168#true} assume true; {168#true} is VALID [2020-07-10 15:28:27,383 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {168#true} {173#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #53#return; {173#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2020-07-10 15:28:27,384 INFO L263 TraceCheckUtils]: 0: Hoare triple {168#true} call ULTIMATE.init(); {168#true} is VALID [2020-07-10 15:28:27,384 INFO L280 TraceCheckUtils]: 1: Hoare triple {168#true} assume true; {168#true} is VALID [2020-07-10 15:28:27,384 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {168#true} {168#true} #49#return; {168#true} is VALID [2020-07-10 15:28:27,385 INFO L263 TraceCheckUtils]: 3: Hoare triple {168#true} call #t~ret2 := main(); {168#true} is VALID [2020-07-10 15:28:27,385 INFO L280 TraceCheckUtils]: 4: Hoare triple {168#true} havoc ~MAXPATHLEN~0;havoc ~pathbuf_off~0;havoc ~bound_off~0;havoc ~glob2_p_off~0;havoc ~glob2_pathbuf_off~0;havoc ~glob2_pathlim_off~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~MAXPATHLEN~0 := #t~nondet0;havoc #t~nondet0; {168#true} is VALID [2020-07-10 15:28:27,387 INFO L280 TraceCheckUtils]: 5: Hoare triple {168#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {172#(<= 1 main_~MAXPATHLEN~0)} is VALID [2020-07-10 15:28:27,388 INFO L280 TraceCheckUtils]: 6: Hoare triple {172#(<= 1 main_~MAXPATHLEN~0)} ~pathbuf_off~0 := 0;~bound_off~0 := ~pathbuf_off~0 + (1 + ~MAXPATHLEN~0) - 1;~glob2_pathbuf_off~0 := ~pathbuf_off~0;~glob2_pathlim_off~0 := ~bound_off~0;~glob2_p_off~0 := ~glob2_pathbuf_off~0; {173#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2020-07-10 15:28:27,389 INFO L280 TraceCheckUtils]: 7: Hoare triple {173#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {173#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2020-07-10 15:28:27,389 INFO L263 TraceCheckUtils]: 8: Hoare triple {173#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {168#true} is VALID [2020-07-10 15:28:27,390 INFO L280 TraceCheckUtils]: 9: Hoare triple {168#true} ~cond := #in~cond; {168#true} is VALID [2020-07-10 15:28:27,390 INFO L280 TraceCheckUtils]: 10: Hoare triple {168#true} assume !(0 == ~cond); {168#true} is VALID [2020-07-10 15:28:27,390 INFO L280 TraceCheckUtils]: 11: Hoare triple {168#true} assume true; {168#true} is VALID [2020-07-10 15:28:27,392 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {168#true} {173#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #53#return; {173#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2020-07-10 15:28:27,394 INFO L263 TraceCheckUtils]: 13: Hoare triple {173#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {178#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:28:27,395 INFO L280 TraceCheckUtils]: 14: Hoare triple {178#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {179#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:28:27,396 INFO L280 TraceCheckUtils]: 15: Hoare triple {179#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {169#false} is VALID [2020-07-10 15:28:27,396 INFO L280 TraceCheckUtils]: 16: Hoare triple {169#false} assume !false; {169#false} is VALID [2020-07-10 15:28:27,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:28:27,399 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697575579] [2020-07-10 15:28:27,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:27,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:28:27,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227590165] [2020-07-10 15:28:27,402 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-07-10 15:28:27,402 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:27,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:28:27,429 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:27,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:28:27,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:27,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:28:27,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:28:27,431 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 6 states. [2020-07-10 15:28:27,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:27,647 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-07-10 15:28:27,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:28:27,647 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-07-10 15:28:27,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:27,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:27,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2020-07-10 15:28:27,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:27,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2020-07-10 15:28:27,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 29 transitions. [2020-07-10 15:28:27,696 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:27,698 INFO L225 Difference]: With dead ends: 31 [2020-07-10 15:28:27,698 INFO L226 Difference]: Without dead ends: 29 [2020-07-10 15:28:27,700 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 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-10 15:28:27,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-10 15:28:27,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2020-07-10 15:28:27,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:27,722 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 28 states. [2020-07-10 15:28:27,722 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 28 states. [2020-07-10 15:28:27,723 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 28 states. [2020-07-10 15:28:27,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:27,728 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-07-10 15:28:27,728 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-10 15:28:27,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:27,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:27,729 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 29 states. [2020-07-10 15:28:27,729 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 29 states. [2020-07-10 15:28:27,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:27,733 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-07-10 15:28:27,733 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-10 15:28:27,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:27,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:27,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:27,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:27,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-10 15:28:27,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2020-07-10 15:28:27,737 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 17 [2020-07-10 15:28:27,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:27,738 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2020-07-10 15:28:27,738 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:28:27,738 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-10 15:28:27,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-10 15:28:27,739 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:27,740 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:27,740 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:28:27,740 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:27,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:27,741 INFO L82 PathProgramCache]: Analyzing trace with hash -94267114, now seen corresponding path program 1 times [2020-07-10 15:28:27,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:27,742 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134399088] [2020-07-10 15:28:27,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:27,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:27,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:27,856 INFO L280 TraceCheckUtils]: 0: Hoare triple {329#true} assume true; {329#true} is VALID [2020-07-10 15:28:27,856 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {329#true} {329#true} #49#return; {329#true} is VALID [2020-07-10 15:28:27,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:27,866 INFO L280 TraceCheckUtils]: 0: Hoare triple {329#true} ~cond := #in~cond; {329#true} is VALID [2020-07-10 15:28:27,866 INFO L280 TraceCheckUtils]: 1: Hoare triple {329#true} assume !(0 == ~cond); {329#true} is VALID [2020-07-10 15:28:27,867 INFO L280 TraceCheckUtils]: 2: Hoare triple {329#true} assume true; {329#true} is VALID [2020-07-10 15:28:27,868 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {329#true} {334#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #53#return; {334#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2020-07-10 15:28:27,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:27,878 INFO L280 TraceCheckUtils]: 0: Hoare triple {329#true} ~cond := #in~cond; {329#true} is VALID [2020-07-10 15:28:27,879 INFO L280 TraceCheckUtils]: 1: Hoare triple {329#true} assume !(0 == ~cond); {329#true} is VALID [2020-07-10 15:28:27,879 INFO L280 TraceCheckUtils]: 2: Hoare triple {329#true} assume true; {329#true} is VALID [2020-07-10 15:28:27,880 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {329#true} {334#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #55#return; {334#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2020-07-10 15:28:27,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:27,890 INFO L280 TraceCheckUtils]: 0: Hoare triple {329#true} ~cond := #in~cond; {329#true} is VALID [2020-07-10 15:28:27,890 INFO L280 TraceCheckUtils]: 1: Hoare triple {329#true} assume !(0 == ~cond); {329#true} is VALID [2020-07-10 15:28:27,890 INFO L280 TraceCheckUtils]: 2: Hoare triple {329#true} assume true; {329#true} is VALID [2020-07-10 15:28:27,892 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {329#true} {343#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} #53#return; {343#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-10 15:28:27,892 INFO L263 TraceCheckUtils]: 0: Hoare triple {329#true} call ULTIMATE.init(); {329#true} is VALID [2020-07-10 15:28:27,892 INFO L280 TraceCheckUtils]: 1: Hoare triple {329#true} assume true; {329#true} is VALID [2020-07-10 15:28:27,893 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {329#true} {329#true} #49#return; {329#true} is VALID [2020-07-10 15:28:27,893 INFO L263 TraceCheckUtils]: 3: Hoare triple {329#true} call #t~ret2 := main(); {329#true} is VALID [2020-07-10 15:28:27,893 INFO L280 TraceCheckUtils]: 4: Hoare triple {329#true} havoc ~MAXPATHLEN~0;havoc ~pathbuf_off~0;havoc ~bound_off~0;havoc ~glob2_p_off~0;havoc ~glob2_pathbuf_off~0;havoc ~glob2_pathlim_off~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~MAXPATHLEN~0 := #t~nondet0;havoc #t~nondet0; {329#true} is VALID [2020-07-10 15:28:27,894 INFO L280 TraceCheckUtils]: 5: Hoare triple {329#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {333#(<= 1 main_~MAXPATHLEN~0)} is VALID [2020-07-10 15:28:27,896 INFO L280 TraceCheckUtils]: 6: Hoare triple {333#(<= 1 main_~MAXPATHLEN~0)} ~pathbuf_off~0 := 0;~bound_off~0 := ~pathbuf_off~0 + (1 + ~MAXPATHLEN~0) - 1;~glob2_pathbuf_off~0 := ~pathbuf_off~0;~glob2_pathlim_off~0 := ~bound_off~0;~glob2_p_off~0 := ~glob2_pathbuf_off~0; {334#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2020-07-10 15:28:27,897 INFO L280 TraceCheckUtils]: 7: Hoare triple {334#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {334#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2020-07-10 15:28:27,897 INFO L263 TraceCheckUtils]: 8: Hoare triple {334#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {329#true} is VALID [2020-07-10 15:28:27,897 INFO L280 TraceCheckUtils]: 9: Hoare triple {329#true} ~cond := #in~cond; {329#true} is VALID [2020-07-10 15:28:27,898 INFO L280 TraceCheckUtils]: 10: Hoare triple {329#true} assume !(0 == ~cond); {329#true} is VALID [2020-07-10 15:28:27,898 INFO L280 TraceCheckUtils]: 11: Hoare triple {329#true} assume true; {329#true} is VALID [2020-07-10 15:28:27,899 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {329#true} {334#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #53#return; {334#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2020-07-10 15:28:27,900 INFO L263 TraceCheckUtils]: 13: Hoare triple {334#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {329#true} is VALID [2020-07-10 15:28:27,900 INFO L280 TraceCheckUtils]: 14: Hoare triple {329#true} ~cond := #in~cond; {329#true} is VALID [2020-07-10 15:28:27,900 INFO L280 TraceCheckUtils]: 15: Hoare triple {329#true} assume !(0 == ~cond); {329#true} is VALID [2020-07-10 15:28:27,901 INFO L280 TraceCheckUtils]: 16: Hoare triple {329#true} assume true; {329#true} is VALID [2020-07-10 15:28:27,902 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {329#true} {334#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #55#return; {334#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2020-07-10 15:28:27,903 INFO L280 TraceCheckUtils]: 18: Hoare triple {334#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #t~post1 := ~glob2_p_off~0;~glob2_p_off~0 := 1 + #t~post1;havoc #t~post1; {343#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-10 15:28:27,904 INFO L280 TraceCheckUtils]: 19: Hoare triple {343#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {343#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-10 15:28:27,904 INFO L263 TraceCheckUtils]: 20: Hoare triple {343#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {329#true} is VALID [2020-07-10 15:28:27,905 INFO L280 TraceCheckUtils]: 21: Hoare triple {329#true} ~cond := #in~cond; {329#true} is VALID [2020-07-10 15:28:27,905 INFO L280 TraceCheckUtils]: 22: Hoare triple {329#true} assume !(0 == ~cond); {329#true} is VALID [2020-07-10 15:28:27,905 INFO L280 TraceCheckUtils]: 23: Hoare triple {329#true} assume true; {329#true} is VALID [2020-07-10 15:28:27,907 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {329#true} {343#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} #53#return; {343#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-10 15:28:27,908 INFO L263 TraceCheckUtils]: 25: Hoare triple {343#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {348#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:28:27,910 INFO L280 TraceCheckUtils]: 26: Hoare triple {348#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {349#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:28:27,913 INFO L280 TraceCheckUtils]: 27: Hoare triple {349#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {330#false} is VALID [2020-07-10 15:28:27,913 INFO L280 TraceCheckUtils]: 28: Hoare triple {330#false} assume !false; {330#false} is VALID [2020-07-10 15:28:27,916 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-10 15:28:27,917 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134399088] [2020-07-10 15:28:27,917 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753185824] [2020-07-10 15:28:27,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:28:27,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:27,967 INFO L264 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-10 15:28:27,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:27,983 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:28:28,170 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:28:28,193 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:28:28,251 INFO L263 TraceCheckUtils]: 0: Hoare triple {329#true} call ULTIMATE.init(); {329#true} is VALID [2020-07-10 15:28:28,251 INFO L280 TraceCheckUtils]: 1: Hoare triple {329#true} assume true; {329#true} is VALID [2020-07-10 15:28:28,252 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {329#true} {329#true} #49#return; {329#true} is VALID [2020-07-10 15:28:28,252 INFO L263 TraceCheckUtils]: 3: Hoare triple {329#true} call #t~ret2 := main(); {329#true} is VALID [2020-07-10 15:28:28,253 INFO L280 TraceCheckUtils]: 4: Hoare triple {329#true} havoc ~MAXPATHLEN~0;havoc ~pathbuf_off~0;havoc ~bound_off~0;havoc ~glob2_p_off~0;havoc ~glob2_pathbuf_off~0;havoc ~glob2_pathlim_off~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~MAXPATHLEN~0 := #t~nondet0;havoc #t~nondet0; {329#true} is VALID [2020-07-10 15:28:28,254 INFO L280 TraceCheckUtils]: 5: Hoare triple {329#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {333#(<= 1 main_~MAXPATHLEN~0)} is VALID [2020-07-10 15:28:28,256 INFO L280 TraceCheckUtils]: 6: Hoare triple {333#(<= 1 main_~MAXPATHLEN~0)} ~pathbuf_off~0 := 0;~bound_off~0 := ~pathbuf_off~0 + (1 + ~MAXPATHLEN~0) - 1;~glob2_pathbuf_off~0 := ~pathbuf_off~0;~glob2_pathlim_off~0 := ~bound_off~0;~glob2_p_off~0 := ~glob2_pathbuf_off~0; {371#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} is VALID [2020-07-10 15:28:28,258 INFO L280 TraceCheckUtils]: 7: Hoare triple {371#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {371#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} is VALID [2020-07-10 15:28:28,258 INFO L263 TraceCheckUtils]: 8: Hoare triple {371#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {329#true} is VALID [2020-07-10 15:28:28,259 INFO L280 TraceCheckUtils]: 9: Hoare triple {329#true} ~cond := #in~cond; {329#true} is VALID [2020-07-10 15:28:28,259 INFO L280 TraceCheckUtils]: 10: Hoare triple {329#true} assume !(0 == ~cond); {329#true} is VALID [2020-07-10 15:28:28,260 INFO L280 TraceCheckUtils]: 11: Hoare triple {329#true} assume true; {329#true} is VALID [2020-07-10 15:28:28,261 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {329#true} {371#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} #53#return; {371#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} is VALID [2020-07-10 15:28:28,262 INFO L263 TraceCheckUtils]: 13: Hoare triple {371#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {329#true} is VALID [2020-07-10 15:28:28,262 INFO L280 TraceCheckUtils]: 14: Hoare triple {329#true} ~cond := #in~cond; {329#true} is VALID [2020-07-10 15:28:28,263 INFO L280 TraceCheckUtils]: 15: Hoare triple {329#true} assume !(0 == ~cond); {329#true} is VALID [2020-07-10 15:28:28,263 INFO L280 TraceCheckUtils]: 16: Hoare triple {329#true} assume true; {329#true} is VALID [2020-07-10 15:28:28,265 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {329#true} {371#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} #55#return; {371#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} is VALID [2020-07-10 15:28:28,267 INFO L280 TraceCheckUtils]: 18: Hoare triple {371#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} #t~post1 := ~glob2_p_off~0;~glob2_p_off~0 := 1 + #t~post1;havoc #t~post1; {408#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 1))} is VALID [2020-07-10 15:28:28,268 INFO L280 TraceCheckUtils]: 19: Hoare triple {408#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 1))} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {408#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 1))} is VALID [2020-07-10 15:28:28,269 INFO L263 TraceCheckUtils]: 20: Hoare triple {408#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 1))} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {329#true} is VALID [2020-07-10 15:28:28,269 INFO L280 TraceCheckUtils]: 21: Hoare triple {329#true} ~cond := #in~cond; {329#true} is VALID [2020-07-10 15:28:28,270 INFO L280 TraceCheckUtils]: 22: Hoare triple {329#true} assume !(0 == ~cond); {329#true} is VALID [2020-07-10 15:28:28,270 INFO L280 TraceCheckUtils]: 23: Hoare triple {329#true} assume true; {329#true} is VALID [2020-07-10 15:28:28,271 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {329#true} {408#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 1))} #53#return; {408#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 1))} is VALID [2020-07-10 15:28:28,273 INFO L263 TraceCheckUtils]: 25: Hoare triple {408#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 1))} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {430#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:28:28,275 INFO L280 TraceCheckUtils]: 26: Hoare triple {430#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {434#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:28:28,276 INFO L280 TraceCheckUtils]: 27: Hoare triple {434#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {330#false} is VALID [2020-07-10 15:28:28,277 INFO L280 TraceCheckUtils]: 28: Hoare triple {330#false} assume !false; {330#false} is VALID [2020-07-10 15:28:28,280 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-10 15:28:28,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:28:28,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2020-07-10 15:28:28,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612952420] [2020-07-10 15:28:28,283 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-07-10 15:28:28,283 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:28,284 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 15:28:28,344 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-10 15:28:28,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 15:28:28,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:28,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 15:28:28,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:28:28,346 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 11 states. [2020-07-10 15:28:28,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:28,769 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2020-07-10 15:28:28,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 15:28:28,769 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-07-10 15:28:28,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:28,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:28:28,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2020-07-10 15:28:28,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:28:28,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2020-07-10 15:28:28,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2020-07-10 15:28:28,825 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:28,827 INFO L225 Difference]: With dead ends: 39 [2020-07-10 15:28:28,827 INFO L226 Difference]: Without dead ends: 37 [2020-07-10 15:28:28,828 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-07-10 15:28:28,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-10 15:28:28,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2020-07-10 15:28:28,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:28,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 36 states. [2020-07-10 15:28:28,868 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 36 states. [2020-07-10 15:28:28,869 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 36 states. [2020-07-10 15:28:28,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:28,873 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-07-10 15:28:28,873 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-10 15:28:28,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:28,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:28,874 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 37 states. [2020-07-10 15:28:28,875 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 37 states. [2020-07-10 15:28:28,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:28,879 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-07-10 15:28:28,879 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-10 15:28:28,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:28,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:28,880 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:28,881 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:28,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-10 15:28:28,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2020-07-10 15:28:28,884 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 29 [2020-07-10 15:28:28,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:28,884 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2020-07-10 15:28:28,884 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 15:28:28,885 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2020-07-10 15:28:28,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-10 15:28:28,886 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:28,887 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:29,100 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-10 15:28:29,100 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:29,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:29,101 INFO L82 PathProgramCache]: Analyzing trace with hash -2069363338, now seen corresponding path program 2 times [2020-07-10 15:28:29,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:29,102 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039738217] [2020-07-10 15:28:29,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:29,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:29,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:29,284 INFO L280 TraceCheckUtils]: 0: Hoare triple {625#true} assume true; {625#true} is VALID [2020-07-10 15:28:29,284 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {625#true} {625#true} #49#return; {625#true} is VALID [2020-07-10 15:28:29,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:29,303 INFO L280 TraceCheckUtils]: 0: Hoare triple {625#true} ~cond := #in~cond; {625#true} is VALID [2020-07-10 15:28:29,303 INFO L280 TraceCheckUtils]: 1: Hoare triple {625#true} assume !(0 == ~cond); {625#true} is VALID [2020-07-10 15:28:29,303 INFO L280 TraceCheckUtils]: 2: Hoare triple {625#true} assume true; {625#true} is VALID [2020-07-10 15:28:29,312 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {625#true} {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #53#return; {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-10 15:28:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:29,341 INFO L280 TraceCheckUtils]: 0: Hoare triple {625#true} ~cond := #in~cond; {625#true} is VALID [2020-07-10 15:28:29,342 INFO L280 TraceCheckUtils]: 1: Hoare triple {625#true} assume !(0 == ~cond); {625#true} is VALID [2020-07-10 15:28:29,342 INFO L280 TraceCheckUtils]: 2: Hoare triple {625#true} assume true; {625#true} is VALID [2020-07-10 15:28:29,344 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {625#true} {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #55#return; {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-10 15:28:29,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:29,352 INFO L280 TraceCheckUtils]: 0: Hoare triple {625#true} ~cond := #in~cond; {625#true} is VALID [2020-07-10 15:28:29,353 INFO L280 TraceCheckUtils]: 1: Hoare triple {625#true} assume !(0 == ~cond); {625#true} is VALID [2020-07-10 15:28:29,353 INFO L280 TraceCheckUtils]: 2: Hoare triple {625#true} assume true; {625#true} is VALID [2020-07-10 15:28:29,354 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {625#true} {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #53#return; {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-10 15:28:29,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:29,362 INFO L280 TraceCheckUtils]: 0: Hoare triple {625#true} ~cond := #in~cond; {625#true} is VALID [2020-07-10 15:28:29,362 INFO L280 TraceCheckUtils]: 1: Hoare triple {625#true} assume !(0 == ~cond); {625#true} is VALID [2020-07-10 15:28:29,363 INFO L280 TraceCheckUtils]: 2: Hoare triple {625#true} assume true; {625#true} is VALID [2020-07-10 15:28:29,364 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {625#true} {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #55#return; {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-10 15:28:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:29,373 INFO L280 TraceCheckUtils]: 0: Hoare triple {625#true} ~cond := #in~cond; {625#true} is VALID [2020-07-10 15:28:29,374 INFO L280 TraceCheckUtils]: 1: Hoare triple {625#true} assume !(0 == ~cond); {625#true} is VALID [2020-07-10 15:28:29,374 INFO L280 TraceCheckUtils]: 2: Hoare triple {625#true} assume true; {625#true} is VALID [2020-07-10 15:28:29,376 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {625#true} {646#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} #53#return; {646#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-10 15:28:29,376 INFO L263 TraceCheckUtils]: 0: Hoare triple {625#true} call ULTIMATE.init(); {625#true} is VALID [2020-07-10 15:28:29,377 INFO L280 TraceCheckUtils]: 1: Hoare triple {625#true} assume true; {625#true} is VALID [2020-07-10 15:28:29,377 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {625#true} {625#true} #49#return; {625#true} is VALID [2020-07-10 15:28:29,377 INFO L263 TraceCheckUtils]: 3: Hoare triple {625#true} call #t~ret2 := main(); {625#true} is VALID [2020-07-10 15:28:29,378 INFO L280 TraceCheckUtils]: 4: Hoare triple {625#true} havoc ~MAXPATHLEN~0;havoc ~pathbuf_off~0;havoc ~bound_off~0;havoc ~glob2_p_off~0;havoc ~glob2_pathbuf_off~0;havoc ~glob2_pathlim_off~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~MAXPATHLEN~0 := #t~nondet0;havoc #t~nondet0; {625#true} is VALID [2020-07-10 15:28:29,378 INFO L280 TraceCheckUtils]: 5: Hoare triple {625#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {625#true} is VALID [2020-07-10 15:28:29,380 INFO L280 TraceCheckUtils]: 6: Hoare triple {625#true} ~pathbuf_off~0 := 0;~bound_off~0 := ~pathbuf_off~0 + (1 + ~MAXPATHLEN~0) - 1;~glob2_pathbuf_off~0 := ~pathbuf_off~0;~glob2_pathlim_off~0 := ~bound_off~0;~glob2_p_off~0 := ~glob2_pathbuf_off~0; {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-10 15:28:29,381 INFO L280 TraceCheckUtils]: 7: Hoare triple {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-10 15:28:29,381 INFO L263 TraceCheckUtils]: 8: Hoare triple {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {625#true} is VALID [2020-07-10 15:28:29,381 INFO L280 TraceCheckUtils]: 9: Hoare triple {625#true} ~cond := #in~cond; {625#true} is VALID [2020-07-10 15:28:29,381 INFO L280 TraceCheckUtils]: 10: Hoare triple {625#true} assume !(0 == ~cond); {625#true} is VALID [2020-07-10 15:28:29,382 INFO L280 TraceCheckUtils]: 11: Hoare triple {625#true} assume true; {625#true} is VALID [2020-07-10 15:28:29,383 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {625#true} {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #53#return; {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-10 15:28:29,384 INFO L263 TraceCheckUtils]: 13: Hoare triple {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {625#true} is VALID [2020-07-10 15:28:29,384 INFO L280 TraceCheckUtils]: 14: Hoare triple {625#true} ~cond := #in~cond; {625#true} is VALID [2020-07-10 15:28:29,384 INFO L280 TraceCheckUtils]: 15: Hoare triple {625#true} assume !(0 == ~cond); {625#true} is VALID [2020-07-10 15:28:29,385 INFO L280 TraceCheckUtils]: 16: Hoare triple {625#true} assume true; {625#true} is VALID [2020-07-10 15:28:29,386 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {625#true} {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #55#return; {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-10 15:28:29,387 INFO L280 TraceCheckUtils]: 18: Hoare triple {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #t~post1 := ~glob2_p_off~0;~glob2_p_off~0 := 1 + #t~post1;havoc #t~post1; {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-10 15:28:29,387 INFO L280 TraceCheckUtils]: 19: Hoare triple {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-10 15:28:29,388 INFO L263 TraceCheckUtils]: 20: Hoare triple {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {625#true} is VALID [2020-07-10 15:28:29,388 INFO L280 TraceCheckUtils]: 21: Hoare triple {625#true} ~cond := #in~cond; {625#true} is VALID [2020-07-10 15:28:29,388 INFO L280 TraceCheckUtils]: 22: Hoare triple {625#true} assume !(0 == ~cond); {625#true} is VALID [2020-07-10 15:28:29,389 INFO L280 TraceCheckUtils]: 23: Hoare triple {625#true} assume true; {625#true} is VALID [2020-07-10 15:28:29,390 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {625#true} {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #53#return; {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-10 15:28:29,391 INFO L263 TraceCheckUtils]: 25: Hoare triple {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {625#true} is VALID [2020-07-10 15:28:29,391 INFO L280 TraceCheckUtils]: 26: Hoare triple {625#true} ~cond := #in~cond; {625#true} is VALID [2020-07-10 15:28:29,391 INFO L280 TraceCheckUtils]: 27: Hoare triple {625#true} assume !(0 == ~cond); {625#true} is VALID [2020-07-10 15:28:29,392 INFO L280 TraceCheckUtils]: 28: Hoare triple {625#true} assume true; {625#true} is VALID [2020-07-10 15:28:29,393 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {625#true} {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #55#return; {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-10 15:28:29,394 INFO L280 TraceCheckUtils]: 30: Hoare triple {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #t~post1 := ~glob2_p_off~0;~glob2_p_off~0 := 1 + #t~post1;havoc #t~post1; {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-10 15:28:29,396 INFO L280 TraceCheckUtils]: 31: Hoare triple {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {646#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-10 15:28:29,396 INFO L263 TraceCheckUtils]: 32: Hoare triple {646#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {625#true} is VALID [2020-07-10 15:28:29,396 INFO L280 TraceCheckUtils]: 33: Hoare triple {625#true} ~cond := #in~cond; {625#true} is VALID [2020-07-10 15:28:29,397 INFO L280 TraceCheckUtils]: 34: Hoare triple {625#true} assume !(0 == ~cond); {625#true} is VALID [2020-07-10 15:28:29,397 INFO L280 TraceCheckUtils]: 35: Hoare triple {625#true} assume true; {625#true} is VALID [2020-07-10 15:28:29,399 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {625#true} {646#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} #53#return; {646#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-10 15:28:29,400 INFO L263 TraceCheckUtils]: 37: Hoare triple {646#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {651#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:28:29,402 INFO L280 TraceCheckUtils]: 38: Hoare triple {651#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {652#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:28:29,403 INFO L280 TraceCheckUtils]: 39: Hoare triple {652#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {626#false} is VALID [2020-07-10 15:28:29,403 INFO L280 TraceCheckUtils]: 40: Hoare triple {626#false} assume !false; {626#false} is VALID [2020-07-10 15:28:29,405 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-07-10 15:28:29,406 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039738217] [2020-07-10 15:28:29,407 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737849434] [2020-07-10 15:28:29,407 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:28:29,448 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:28:29,448 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:28:29,451 INFO L264 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-10 15:28:29,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:29,479 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:28:29,587 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:28:29,636 INFO L263 TraceCheckUtils]: 0: Hoare triple {625#true} call ULTIMATE.init(); {625#true} is VALID [2020-07-10 15:28:29,637 INFO L280 TraceCheckUtils]: 1: Hoare triple {625#true} assume true; {625#true} is VALID [2020-07-10 15:28:29,637 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {625#true} {625#true} #49#return; {625#true} is VALID [2020-07-10 15:28:29,638 INFO L263 TraceCheckUtils]: 3: Hoare triple {625#true} call #t~ret2 := main(); {625#true} is VALID [2020-07-10 15:28:29,638 INFO L280 TraceCheckUtils]: 4: Hoare triple {625#true} havoc ~MAXPATHLEN~0;havoc ~pathbuf_off~0;havoc ~bound_off~0;havoc ~glob2_p_off~0;havoc ~glob2_pathbuf_off~0;havoc ~glob2_pathlim_off~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~MAXPATHLEN~0 := #t~nondet0;havoc #t~nondet0; {625#true} is VALID [2020-07-10 15:28:29,638 INFO L280 TraceCheckUtils]: 5: Hoare triple {625#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {625#true} is VALID [2020-07-10 15:28:29,640 INFO L280 TraceCheckUtils]: 6: Hoare triple {625#true} ~pathbuf_off~0 := 0;~bound_off~0 := ~pathbuf_off~0 + (1 + ~MAXPATHLEN~0) - 1;~glob2_pathbuf_off~0 := ~pathbuf_off~0;~glob2_pathlim_off~0 := ~bound_off~0;~glob2_p_off~0 := ~glob2_pathbuf_off~0; {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-10 15:28:29,640 INFO L280 TraceCheckUtils]: 7: Hoare triple {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-10 15:28:29,641 INFO L263 TraceCheckUtils]: 8: Hoare triple {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {625#true} is VALID [2020-07-10 15:28:29,641 INFO L280 TraceCheckUtils]: 9: Hoare triple {625#true} ~cond := #in~cond; {625#true} is VALID [2020-07-10 15:28:29,641 INFO L280 TraceCheckUtils]: 10: Hoare triple {625#true} assume !(0 == ~cond); {625#true} is VALID [2020-07-10 15:28:29,641 INFO L280 TraceCheckUtils]: 11: Hoare triple {625#true} assume true; {625#true} is VALID [2020-07-10 15:28:29,643 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {625#true} {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #53#return; {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-10 15:28:29,643 INFO L263 TraceCheckUtils]: 13: Hoare triple {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {625#true} is VALID [2020-07-10 15:28:29,643 INFO L280 TraceCheckUtils]: 14: Hoare triple {625#true} ~cond := #in~cond; {625#true} is VALID [2020-07-10 15:28:29,643 INFO L280 TraceCheckUtils]: 15: Hoare triple {625#true} assume !(0 == ~cond); {625#true} is VALID [2020-07-10 15:28:29,644 INFO L280 TraceCheckUtils]: 16: Hoare triple {625#true} assume true; {625#true} is VALID [2020-07-10 15:28:29,645 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {625#true} {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #55#return; {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-10 15:28:29,646 INFO L280 TraceCheckUtils]: 18: Hoare triple {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #t~post1 := ~glob2_p_off~0;~glob2_p_off~0 := 1 + #t~post1;havoc #t~post1; {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-10 15:28:29,646 INFO L280 TraceCheckUtils]: 19: Hoare triple {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-10 15:28:29,647 INFO L263 TraceCheckUtils]: 20: Hoare triple {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {625#true} is VALID [2020-07-10 15:28:29,647 INFO L280 TraceCheckUtils]: 21: Hoare triple {625#true} ~cond := #in~cond; {625#true} is VALID [2020-07-10 15:28:29,647 INFO L280 TraceCheckUtils]: 22: Hoare triple {625#true} assume !(0 == ~cond); {625#true} is VALID [2020-07-10 15:28:29,648 INFO L280 TraceCheckUtils]: 23: Hoare triple {625#true} assume true; {625#true} is VALID [2020-07-10 15:28:29,649 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {625#true} {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #53#return; {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-10 15:28:29,649 INFO L263 TraceCheckUtils]: 25: Hoare triple {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {625#true} is VALID [2020-07-10 15:28:29,649 INFO L280 TraceCheckUtils]: 26: Hoare triple {625#true} ~cond := #in~cond; {625#true} is VALID [2020-07-10 15:28:29,650 INFO L280 TraceCheckUtils]: 27: Hoare triple {625#true} assume !(0 == ~cond); {625#true} is VALID [2020-07-10 15:28:29,650 INFO L280 TraceCheckUtils]: 28: Hoare triple {625#true} assume true; {625#true} is VALID [2020-07-10 15:28:29,652 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {625#true} {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #55#return; {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-10 15:28:29,653 INFO L280 TraceCheckUtils]: 30: Hoare triple {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #t~post1 := ~glob2_p_off~0;~glob2_p_off~0 := 1 + #t~post1;havoc #t~post1; {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-10 15:28:29,654 INFO L280 TraceCheckUtils]: 31: Hoare triple {629#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {646#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-10 15:28:29,654 INFO L263 TraceCheckUtils]: 32: Hoare triple {646#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {625#true} is VALID [2020-07-10 15:28:29,654 INFO L280 TraceCheckUtils]: 33: Hoare triple {625#true} ~cond := #in~cond; {625#true} is VALID [2020-07-10 15:28:29,655 INFO L280 TraceCheckUtils]: 34: Hoare triple {625#true} assume !(0 == ~cond); {625#true} is VALID [2020-07-10 15:28:29,655 INFO L280 TraceCheckUtils]: 35: Hoare triple {625#true} assume true; {625#true} is VALID [2020-07-10 15:28:29,656 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {625#true} {646#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} #53#return; {646#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-10 15:28:29,657 INFO L263 TraceCheckUtils]: 37: Hoare triple {646#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {767#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:28:29,658 INFO L280 TraceCheckUtils]: 38: Hoare triple {767#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {771#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:28:29,660 INFO L280 TraceCheckUtils]: 39: Hoare triple {771#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {626#false} is VALID [2020-07-10 15:28:29,661 INFO L280 TraceCheckUtils]: 40: Hoare triple {626#false} assume !false; {626#false} is VALID [2020-07-10 15:28:29,663 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-07-10 15:28:29,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:28:29,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2020-07-10 15:28:29,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152183309] [2020-07-10 15:28:29,665 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-07-10 15:28:29,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:29,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 15:28:29,698 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:29,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 15:28:29,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:29,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 15:28:29,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:28:29,700 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 8 states. [2020-07-10 15:28:29,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:29,910 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2020-07-10 15:28:29,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:28:29,910 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-07-10 15:28:29,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:29,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:28:29,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2020-07-10 15:28:29,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:28:29,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2020-07-10 15:28:29,921 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 21 transitions. [2020-07-10 15:28:29,951 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:29,951 INFO L225 Difference]: With dead ends: 36 [2020-07-10 15:28:29,952 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:28:29,953 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:28:29,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:28:29,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:28:29,955 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:29,955 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:28:29,955 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:28:29,956 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:28:29,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:29,956 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:28:29,956 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:28:29,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:29,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:29,957 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:28:29,957 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:28:29,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:29,957 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:28:29,957 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:28:29,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:29,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:29,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:29,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:29,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:28:29,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:28:29,962 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2020-07-10 15:28:29,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:29,963 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:28:29,963 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 15:28:29,963 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:28:29,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:30,176 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:28:30,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:28:30,294 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 15:28:30,294 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:28:30,295 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:28:30,295 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:28:30,295 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:28:30,295 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:28:30,295 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-10 15:28:30,295 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-10 15:28:30,296 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 5) no Hoare annotation was computed. [2020-07-10 15:28:30,296 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-10 15:28:30,296 INFO L271 CegarLoopResult]: At program point L33(lines 14 34) the Hoare annotation is: true [2020-07-10 15:28:30,296 INFO L268 CegarLoopResult]: For program point L31(lines 27 32) no Hoare annotation was computed. [2020-07-10 15:28:30,296 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (and (<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0) (<= 0 main_~glob2_p_off~0) (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)) [2020-07-10 15:28:30,296 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 34) the Hoare annotation is: true [2020-07-10 15:28:30,297 INFO L264 CegarLoopResult]: At program point L30-1(line 30) the Hoare annotation is: (and (<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0) (<= 0 main_~glob2_p_off~0) (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)) [2020-07-10 15:28:30,297 INFO L264 CegarLoopResult]: At program point L27-2(lines 27 32) the Hoare annotation is: (and (<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0) (<= 0 main_~glob2_p_off~0) (<= 1 main_~MAXPATHLEN~0)) [2020-07-10 15:28:30,297 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 13 34) no Hoare annotation was computed. [2020-07-10 15:28:30,297 INFO L268 CegarLoopResult]: For program point L22(line 22) no Hoare annotation was computed. [2020-07-10 15:28:30,297 INFO L268 CegarLoopResult]: For program point L22-1(line 22) no Hoare annotation was computed. [2020-07-10 15:28:30,297 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 13 34) no Hoare annotation was computed. [2020-07-10 15:28:30,298 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-10 15:28:30,298 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 6 11) no Hoare annotation was computed. [2020-07-10 15:28:30,298 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-10 15:28:30,298 INFO L268 CegarLoopResult]: For program point L7(lines 7 9) no Hoare annotation was computed. [2020-07-10 15:28:30,298 INFO L268 CegarLoopResult]: For program point L7-2(lines 6 11) no Hoare annotation was computed. [2020-07-10 15:28:30,298 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-10 15:28:30,304 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:28:30,305 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:28:30,305 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:28:30,305 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-10 15:28:30,305 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:28:30,305 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:28:30,305 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:28:30,305 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:28:30,305 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:28:30,305 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:28:30,306 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-10 15:28:30,306 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-10 15:28:30,306 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:28:30,306 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-10 15:28:30,306 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-10 15:28:30,306 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:28:30,306 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-10 15:28:30,306 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-10 15:28:30,306 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2020-07-10 15:28:30,308 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:28:30,308 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:28:30,308 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:28:30,308 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:28:30,308 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-10 15:28:30,308 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-10 15:28:30,308 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:28:30,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:28:30 BoogieIcfgContainer [2020-07-10 15:28:30,322 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:28:30,326 INFO L168 Benchmark]: Toolchain (without parser) took 5023.49 ms. Allocated memory was 144.7 MB in the beginning and 248.0 MB in the end (delta: 103.3 MB). Free memory was 102.6 MB in the beginning and 177.3 MB in the end (delta: -74.7 MB). Peak memory consumption was 28.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:28:30,327 INFO L168 Benchmark]: CDTParser took 1.77 ms. Allocated memory is still 144.7 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 15:28:30,328 INFO L168 Benchmark]: CACSL2BoogieTranslator took 287.78 ms. Allocated memory is still 144.7 MB. Free memory was 102.4 MB in the beginning and 92.7 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-10 15:28:30,329 INFO L168 Benchmark]: Boogie Preprocessor took 38.59 ms. Allocated memory is still 144.7 MB. Free memory was 92.7 MB in the beginning and 91.1 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:28:30,330 INFO L168 Benchmark]: RCFGBuilder took 477.36 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 91.1 MB in the beginning and 164.4 MB in the end (delta: -73.3 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:28:30,331 INFO L168 Benchmark]: TraceAbstraction took 4210.32 ms. Allocated memory was 202.9 MB in the beginning and 248.0 MB in the end (delta: 45.1 MB). Free memory was 164.4 MB in the beginning and 177.3 MB in the end (delta: -12.9 MB). Peak memory consumption was 32.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:28:30,335 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 1.77 ms. Allocated memory is still 144.7 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 287.78 ms. Allocated memory is still 144.7 MB. Free memory was 102.4 MB in the beginning and 92.7 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.59 ms. Allocated memory is still 144.7 MB. Free memory was 92.7 MB in the beginning and 91.1 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 477.36 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 91.1 MB in the beginning and 164.4 MB in the end (delta: -73.3 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4210.32 ms. Allocated memory was 202.9 MB in the beginning and 248.0 MB in the end (delta: 45.1 MB). Free memory was 164.4 MB in the beginning and 177.3 MB in the end (delta: -12.9 MB). Peak memory consumption was 32.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: (glob2_pathlim_off <= MAXPATHLEN && 0 <= glob2_p_off) && 1 <= MAXPATHLEN - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.9s, OverallIterations: 4, TraceHistogramMax: 6, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 70 SDtfs, 39 SDslu, 232 SDs, 0 SdLazy, 135 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 16 PreInvPairs, 27 NumberOfFragments, 42 HoareAnnotationTreeSize, 16 FomulaSimplifications, 108 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 169 NumberOfCodeBlocks, 169 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 163 ConstructedInterpolants, 0 QuantifiedInterpolants, 9919 SizeOfPredicates, 9 NumberOfNonLiveVariables, 153 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 150/164 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...